Graph partitioning using matrix differential equations

Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We are interested in the case of constrained minimum cut problems, where constraints include cardinality or membership requirements, which leads to NP-hard combinatorial optimization problems. Furthermore, we are interested in ambiguity issues, that is in the robustness of clustering algorithms that are based on Fiedler spectral partitioning. The above-mentioned problems are restated as matrix nearness problems for the weight matrix of the graph. A key element in the solution of these matrix nearness problems is the use of a constrained gradient system of matrix differential equations.

[1]  Tosio Kato.  Perturbation theory for linear operators , 1966 .

[2]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[3]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[4]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[5]  C. D. Meyer,et al.  Derivatives and perturbations of eigenvectors , 1988 .

[6]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[7]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[8]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[9]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.

[10]  Francesco Maffioli,et al.  Cardinality constrained minimum cut problems: complexity and algorithms , 2004, Discret. Appl. Math..

[11]  Francesco Maffioli,et al.  An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints , 2006, Discret. Appl. Math..

[12]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[14]  Nicola Guglielmi,et al.  Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking , 2011, SIAM J. Numer. Anal..

[15]  Daniel Kressner,et al.  Low rank differential equations for Hamiltonian matrix nearness problems , 2015, Numerische Mathematik.

[16]  Nicola Guglielmi,et al.  Matrix Stabilization Using Differential Equations , 2017, SIAM J. Numer. Anal..

[17]  Nicola Guglielmi,et al.  On the Nearest Singular Matrix Pencil , 2017, SIAM J. Matrix Anal. Appl..