Related papers: Strong Isoperimetric Inequality for Tessellating Q…

The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…

Various properties of isoperimetric, functional, Transport-Entropy and concentration inequalities are studied on a Riemannian manifold equipped with a measure, whose generalized Ricci curvature is bounded from below. First, stability of…

We consider capillarity functionals which measure the perimeter of sets contained in a Euclidean half-space assigning a constant weight $\lambda \in (-1,1)$ to the portion of the boundary that touches the boundary of the half-space.…

Utilizing recently developed abstract notions of sectional curvature, we introduce a method for constructing a curvature-based geometric profile of discrete metric spaces. The curvature concept that we use here captures the metric relations…

Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times…

We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

The concept of Gromov hyperbolicity manifests itself in many different ways. With only mild assumptions on the underlying metric space, the spectrum of equivalent properties includes various thin triangle conditions, the stability of…

We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

We study two types of isotropic planes: weakly isotropic and strongly isotropic planes. We prove that a Riemannian manifold of indefinite metric is conformally flat if and only if its curvature tensor vanishes on all the strongly isotropic…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…

We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.

In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…

We reveal strong and weak inequalities relating two fundamental macroscopic quantum geometric quantities, the quantum distance and Berry phase, for closed paths in the Hilbert space of wavefunctions. We recount the role of quantum geometry…

Houdr\'e and Tetali defined a class of isoperimetric constants $\varphi_p$ of graphs for $0 \leq p \leq 1$, and conjectured a Cheeger-type inequality for $\varphi_\frac12$ of the form $$\lambda_2 \lesssim \varphi_\frac12 \lesssim…

A 3-dimensional graph-manifold is composed from simple blocks which are products of compact surfaces with boundary by the circle. Its global structure may be as complicated as one likes and is described by a graph which might be an…

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the…

Information theoretic geometry near critical points in classical and quantum systems is well understood for exactly solvable systems. Here we show that renormalization group flow equations can be used to construct the information metric and…