Related papers: Cheeger inequalities for graph limits
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…
We prove a general result characterizing a specific class of Serrin domains as supports of unbounded and periodic constant mean curvature graphs. We apply this result to prove the existence of a family of unbounded periodic constant mean…
We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…
We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While…
We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
For any graphs $G$ and $H$, we say that a bound is of Vizing-type if $\gamma(G\square H)\geq c \gamma(G)\gamma(H)$ for some constant $c$. We show several bounds of Vizing-type for graphs $G$ with forbidden induced subgraphs. In particular,…
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
This is an expository article presenting various results about the Cheeger problem and its connections with other relevant mathematical problems. In section 2 we synthetically describe three mathematical problems (eigenvalue estimates,…
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Using an inverse system of metric graphs as in: J. Cheeger and B. Kleiner, "Inverse limit spaces satisfying a Poincar\'e inequality", we provide a simple example of a metric space $X$ that admits Poincar\'e inequalities for a continuum of…
We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
Topological integrals appear frequently in Lagrangian field theories. On manifolds without boundary, they can be treated in the framework of (absolute) (co)homology using the formalism of Cheeger--Simons differential characters. String and…
The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use multiple eigenvalues in a higher-order Cheeger's inequality…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.