Related papers: Cheeger inequalities for unbounded graph Laplacian…
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…
In this paper, some new forms of the Cheeger's inequalities are established for general (maybe unbounded) symmetric forms, the resulting estimates improve and extend the ones obtained by Lawler and Sokal (1988) for bounded jump processes.…
We establish mild conditions under which a possibly irregular, sparse graph $G$ has "many" strong orientations. Given a graph $G$ on $n$ vertices, orient each edge in either direction with probability $1/2$ independently. We show that if…
We present some applications of ideas from partial differential equations and differential geometry to the study of difference equations on infinite graphs. All operators that we consider are examples of "elliptic operators" as defined by…
Cheeger's inequality shows that any undirected graph $G$ with minimum nonzero normalized Laplacian eigenvalue $\lambda_G$ has a cut with conductance at most $O(\sqrt{\lambda_G})$. Qualitatively, Cheeger's inequality says that if the…
We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We introduce a dynamically defined class of unbounded, connected, equilateral metric graphs on which the Kirchhoff Laplacian has zero Lebesgue measure spectrum and a nontrivial singular continuous part. A new local Borg--Marchenko…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
In this paper we prove a new extremal property of the Reuleaux triangle: it maximizes the Cheeger constant among all bodies of (same) constant width. The proof relies on a fine analysis of the optimality conditions satisfied by an optimal…
We consider some metrics and weak metrics defined on the Teichmueller space of a surface of finite type with nonempty boundary, that are defined using the hyperbolic length spectrum of simple closed curves and of properly embedded arcs, and…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
By using optimal transport theory, we prove a sharp dimension-free isoperimetric inequality involving the volume entropy, in metric measure spaces with non-negative Ricci curvature in the sense of Lott--Sturm--Villani. We show that this…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional derivative of Kemeny's constant with respect to an edge and use…
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…
A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit…
An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.
Starting from pointwise gradient estimates for the heat semigroup, we study three characterizations of weak lower curvature bounds on metric graphs. More precisely, we prove the equivalence between a weak notion of the Bakry-\'Emery…