Related papers: Strong Isoperimetric Inequality for Tessellating Q…
We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…
Sharp isoperimetric inequalities for the sine transform of even isotropic measures are established. The corresponding reverse inequalities are obtained in an asymptotically optimal form. These new inequalities have direct applications to…
In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
We introduce the concept of Gaussian integral isoperimetric transference and show how it can be applied to obtain a new class of sharp Sobolev-Poincar\'{e} inequalities with constants independent of the dimension. In the special case of…
The CD inequalities and CDE inequalities are useful in the estimate of curvature on graphs. This article is based on the ufinite graph with large girth, and finally concludes some curvature estimate in CD and CDE.
We relate the total curvature and the isoperimetric deficit of a curve $\gamma$ in a two-dimensional space of constant curvature with the area enclosed by the evolute of $\gamma$. We provide also a Gauss-Bonnet theorem for a special class…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
We derive upper and lower bounds for the vertex-isoperimetric number of the incidence graphs of unitals and determine its order of magnitude. In the case when a unital contains sufficiently large arcs, these bounds agree and give rise to…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
We prove a quantitative isoperimetric inequality for the Gaussian fractional perimeter using extension techniques. Though the exponent of the Fraenkel asymmetry is not sharp, the constant appearing in the inequality does not depend on the…
We establish several inequalities for manifolds with positive scalar curvature and, more generally, for the scalar curvature bounded from below, in the spirit of the classical bound on the distances between conjugates points in surfaces…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
An outstanding challenge for models of non-perturbative quantum gravity is the consistent formulation and quantitative evaluation of physical phenomena in a regime where geometry and matter are strongly coupled. After developing appropriate…
Recent advances in emergent geometry and discretized approaches to quantum gravity have relied upon the notion of a discrete measure of graph curvature. We focus on the two main measures that have been studied, the so-called Ollivier-Ricci…
We study the isoperimetric subgraphs of the infinite cluster $\textbf{C}_\infty$ for supercritical bond percolation on $\mathbb{Z}^d$ with $d\geq 3$. Specifically, we consider the subgraphs of $\textbf{C}_\infty \cap [-n,n]^d$ which have…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be…