Related papers: Metric Poincar\'e inequalities for graphs

We present some classical and weighted Poincar\'e inequalities for some one-dimensional probability measures. This work is the one-dimensional counterpart of a recent study achieved by the authors for a class of spherically symmetric…

Poincar\'e inequality is a fundamental property that rises naturally in different branches of mathematics. The associated Poincar\'e constant plays a central role in many applications since it governs the convergence of various practical…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

We study the asymptotic properties of geodesically convex $M$-estimation on non-linear spaces. Namely, we prove that under very minimal assumptions besides geodesic convexity of the cost function, one can obtain consistency and asymptotic…

A theorem proved by Hrushovski for graphs and extended by Solecki and Vershik (independently from each other) to metric spaces leads to a stronger version of ultrahomogeneity of the infinite random graph $R$, the universal Urysohn metric…

We introduce and study the conical curvature-dimension condition, $CCD(K,N)$, for graphs. We show that $CCD(K,N)$ provides necessary and sufficient conditions for the underlying graph to satisfy a sharp global Poincar\'e inequality which in…

We establish a Shearer-type inequality for the Poincar\'e constant, showing that the Poincar\'e constant corresponding to the convolution of a collection of measures can be nontrivially controlled by the Poincar\'e constants corresponding…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

We illustrate connections between differential geometry on finite simple graphs G=(V,E) and Riemannian manifolds (M,g). The link is that curvature can be defined integral geometrically as an expectation in a probability space of…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…

We present a novel graph embedding space (i.e., a set of measures on graphs) for performing statistical analyses of networks. Key improvements over existing approaches include discovery of "motif-hubs" (multiple overlapping significant…

A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over…

The metric dimension dim(G) of a graph $G$ is the minimum cardinality of a subset $S$ of vertices of $G$ such that each vertex of $G$ is uniquely determined by its distances to $S$. It is well-known that the metric dimension of a graph can…

We present geometric conditions on a metric space $(Y,d_Y)$ ensuring that almost surely, any isometric action on $Y$ by Gromov's expander-based random group has a common fixed point. These geometric conditions involve uniform convexity and…

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

Consider a proper geodesic metric space $(X,d)$ equipped with a Borel measure $\mu.$ We establish a family of uniform Poincar\'e inequalities on $(X,d,\mu)$ if it satisfies a local Poincar\'e inequality ($P_{loc}$) and a condition on growth…

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees:…

Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with…

Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta$ and vertex conductance $\Psi^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap…