Related papers: Cheeger inequalities for graph limits
We prove a $\Gamma$-convergence result for Cheeger energies along sequences of metric measure spaces, where the measure space is kept fixed, while distances are monotonically converging from below to the limit one. As a consequence, we show…
The classical Cheeger's inequality relates the edge conductance $\phi$ of a graph and the second smallest eigenvalue $\lambda_2$ of the Laplacian matrix. Recently, Olesker-Taylor and Zanetti discovered a Cheeger-type inequality $\psi^2 /…
We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…
We compute the Cheeger constants of a collection of hyperbolic surfaces corresponding to maximal non-compact arithmetic Fuchsian groups, and to subgroups which are the rotation subgroup of maximal reflection groups. The Cheeger constants…
We establish a lower bound for the energy of a complex unit gain graph in terms of the matching number of its underlying graph, and characterize all the complex unit gain graphs whose energy reaches this bound.
We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…
In this paper, we determine a formula for Kemeny's constant for a graph with multiple bridges, in terms of quantities that are inherent to the subgraphs obtained upon removal of all bridges and that can be computed independently. With the…
In spectral graph theory, the Cheeger's inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph's Laplacian operator. Recently this inequality has been extended to undirected…
We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…
We derive a formula for the level spacing probability distribution in quantum graphs. We apply it to simple examples and we discuss its relation with previous work and its possible application in more general cases. Moreover, we derive an…
We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.
Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…
We introduce certain relative differential characters which we call Cheeger-Chern-Simons characters. These combine the well-known Cheeger-Simons characters with Chern-Simons forms. In the same way as the Cheeger-Simons characters generalize…
We introduce the concept of NIC-planar graphs and present the full characterization of NIC-planar complete k-partite graphs.
We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.
In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality. The result was first discovered as a consequence of the classical Forster's…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.