Related papers: Metric Poincar\'e inequalities for graphs
An important problem is to determine under which circumstances a metric on a conformally compact manifold is conformal to a Poincar\'e--Einstein metric. Such conformal rescalings are in general obstructed by conformal invariants of the…
We give lower bound estimates for the macroscopic scale of coarse differentiability of Lipschitz maps from a Carnot group with the Carnot-Carath\'{e}odory metric $(G,\dcc)$ to a few different classes of metric spaces. Using this result, we…
By measured graphs we mean graphs endowed with a measure on the set of vertices. In this context, we explore the relations between the appropriate Cheeger constant and Poincar\'{e} inequalities. We prove that the so-called Cheeger…
Let $\MM$ be the space of finite measures on a Locally compact Polish space, and let $\BG$ be the Gamma distribution on $\MM$ with intensity measure $\nu\in \MM$. Let $\nn^{ext}$ be the extrinsic derivative with tangent bundle $T\MM=…
We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…
In a doubling metric measure space $(X,\rho,\mu)$ supporting a Poincar\'e inequality, we give a new characterisation of first-order Sobolev spaces by mean oscillations, and extend previous characterisations of constant functions in terms of…
In this paper we shall study smooth submanifolds immersed in a k-step Carnot group G of homogeneous dimension Q. Among other results, we shall prove an isoperimetric inequality for the case of a $C^2$-smooth compact hypersurface S with - or…
A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\subseteq V(G)$ is a local metric set for $G$ if…
We introduce the post-processing preorder and equivalence relations for general measurements on a possibly infinite-dimensional general probabilistic theory described by an order unit Banach space $E$ with a Banach predual. We define the…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
The asymptotic symmetries of electromagnetism in all higher spacetime dimensions $d>4$ are extended, by incorporating consistently angle-dependent $u(1)$ gauge transformations with a linear growth in the radial coordinate at spatial…
We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…
A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let $\{G_1, G_2, \ldots,…
We prove local $L^p$-Poincar\'e inequalities, $ p\in[1,\infty]$, on quasiconvex sets in infinite graphs endowed with a family of locally doubling measures, and global $L^p$-Poincar\'e inequalities on connected sets for flow measures on…
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension…
We investigate a hierarchy of semidefinite bounds $\vartheta^{(r)}(G)$ for the stability number $\alpha(G)$ of a graph $G$, based on its copositive programming formulation and introduced by de Klerk and Pasechnik [{\em SIAM J. Optim.} 12…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…