Gene Networks in Plant Biology: Approaches in Reconstruction and Analysis
The non-convex Burer–Monteiro approach works on smooth semidefinite programs
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality
Influence maximization in complex networks through optimal percolation
Nice paper along the work of Dasgupta and Cohen-Addad et al..
A function to quantify the quality of a hierarchical graph clustering / dendrogram is proposed.
An interesting application to compress a dendrogram is proposed.
Section 8. If the input graph is a complete bipartite graph, then the quality function Q is maximum if the graph is partitioned in the two independent sets.
Comments:
Nice paper!