A Sard theorem for graph theory

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple graphs for which every unit sphere is a d-sphere, the zero locus of (f-c) is a (d-1)-graph for all c different from the range of f. If this Sard lemma is inductively applied to an ordered list functions f_1,...,f_k in which the functions are extended on the level surfaces, the set of critical values (c_1,...,c_k) for which F-c=0 is not a (d-k)-graph is a finite set. This discrete Sard result allows to construct explicit graphs triangulating a given algebraic set. We also look at a second setup: for a function F from the vertex set to R^k, we give conditions for which the simultaneous discrete algebraic set { F=c } defined as the set of simplices of dimension in {k, k+1,...,n} on which all f_i change sign, is a (d-k)-graph in the barycentric refinement of G. This maximal rank condition is adapted from the continuum and the graph { F=c } is a (n-k)-graph. While now, the critical values can have positive measure, we are closer to calculus: for k=2 for example, extrema of functions f under a constraint {g=c} happen at points, where the gradients of f and g are parallel D f = L D g, the Lagrange equations on the discrete network. As for an application, we illustrate eigenfunctions of geometric graphs and especially the second eigenvector of 3-spheres, which by Courant-Fiedler has exactly two nodal regions. The separating nodal surface of the second eigenfunction f_2 belonging to the smallest nonzero eigenvalue always appears to be a 2-sphere in experiments if G is a 3-sphere.

[1]  Oliver Knill,et al.  A discrete Gauss-Bonnet type theorem , 2010, 1009.2292.

[2]  M. Simonovits,et al.  ON THE CHROMATIC NUMBER OF GEOMETRIC GRAPHS , 1980 .

[3]  Oliver Knill,et al.  Coloring graphs using topology , 2014, ArXiv.

[4]  Oliver Knill.  A Brouwer fixed-point theorem for graph endomorphisms , 2012, ArXiv.

[5]  Oliver Knill.  The Euler characteristic of an even-dimensional graph , 2013, ArXiv.

[6]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[7]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[8]  Oliver Knill,et al.  A graph theoretical Gauss-Bonnet-Chern Theorem , 2011, ArXiv.

[9]  Oliver Knill,et al.  The graph spectrum of barycentric refinements , 2015, ArXiv.

[10]  O. Knill.  An index formula for simple graphs , 2012, ArXiv.

[11]  Oliver Knill,et al.  The McKean-Singer Formula in Graph Theory , 2013, ArXiv.

[12]  A. Morse,et al.  The Behavior of a Function on Its Critical Set , 1939 .

[13]  Oliver Knill,et al.  Graphs with Eulerian unit spheres , 2015, ArXiv.

[14]  Oliver Knill,et al.  A graph theoretical Poincare-Hopf Theorem , 2012, ArXiv.

[15]  Oliver Knill,et al.  On index expectation and curvature for networks , 2012, ArXiv.

[16]  Hans L. Cycon,et al.  Schrodinger Operators: With Application to Quantum Mechanics and Global Geometry , 1987 .

[17]  A. Sard,et al.  The measure of the critical values of differentiable maps , 1942 .

[18]  Oliver Knill,et al.  The Dirac operator of a graph , 2013, ArXiv.

[19]  Oliver Knill,et al.  The Jordan-Brouwer theorem for graphs , 2015, ArXiv.

[20]  F. Chung.  Four proofs for the Cheeger inequality and graph partition algorithms , 2007 .

[21]  Oliver Knill,et al.  Curvature from Graph Colorings , 2014, ArXiv.