Related papers: Metric Poincar\'e inequalities for graphs
In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…
We introduce new distance measures for comparing straight-line embedded graphs based on the Fr\'echet distance and the weak Fr\'echet distance. These graph distances are defined using continuous mappings and thus take the combinatorial…
For a graph $G$ define the parameters $\ell(G)$ and $L(G)$ as the minimum and maximum value of $\nu(G\backslash F)$, where $F$ is a maximum matching of $G$ and $\nu(G)$ is the matching number of $G$. In this paper, we show that there is a…
In this paper we present new proofs of the non-embeddability of countably branching trees into Banach spaces satisfying property $(\beta_p)$ and of countably branching diamonds into Banach spaces which are $p$-AMUC for $p > 1$. These proofs…
Let $(\mathcal{X}, \rho, \mu)$ be a metric measure space of homogeneous type which supports a certain Poincar\'e inequality. Denote by the symbol $\mathcal{C}_{\mathrm{c}}^\ast(\mathcal{X})$ the space of all continuous functions $f$ with…
Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…
We introduce a natural definition of $L^p$-convergence of maps, $p \ge 1$, in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a…
This paper builds on the theory of generalised functions begun in [1]. The Colombeau theory of generalised scalar fields on manifolds is extended to a nonlinear theory of generalised tensor fields which is diffeomorphism invariant and has…
We study metric spaces homeomorphic to a closed oriented manifold from both geometric and analytic perspectives. We show that such spaces (which are sometimes called metric manifolds) admit a non-trivial integral current without boundary,…
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…
In this survey we present a generalization of the notion of metric space and some applications to discrete structures as graphs, ordered sets and transition systems. Results in that direction started in the middle eighties based on the…
The development of global sensitivity analysis of numerical model outputs has recently raised new issues on 1-dimensional Poincar\'e inequalities. Typically two kind of sensitivity indices are linked by a Poincar\'e type inequality, which…
This paper discusses how to generate general graph node embeddings from knowledge graph representations. The embedded space is composed of a number of sub-features to mimic both local affinity and remote structural relevance. These…
Let $\Omega \subset \mathbb{R}^n$ be a convex. If $u: \Omega \rightarrow \mathbb{R}$ has mean 0, then we have the classical Poincar\'{e} inequality $$ \|u \|_{L^p} \leq c_p \mbox{diam}(\Omega) \| \nabla u \|_{L^p}$$ with sharp constants…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
The aim of this paper is to establish two fundamental measure-metric properties of particular random geometric graphs. We consider $\varepsilon$-neighborhood graphs whose vertices are drawn independently and identically distributed from a…
We address the study of nonlocal gradients defined through general radial kernels $\rho$. Our investigation focuses on the properties of the associated function spaces, which depend on the characteristics of the kernel function.…
The Blow-up Lemma established by Koml\'os, S\'ark\"ozy, and Szemer\'edi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the…
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…