Related papers: Quantitative Obata's theorem in discrete setting

In this paper, we compare Ollivier Ricci curvature and Bakry-\'Emery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

Through the use of sub-Riemannian metrics we provide quantitative estimates for the maximal tight neighbourhood of a Reeb orbit on a three-dimensional contact manifold. Under appropriate geometric conditions we show how to construct closed…

We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…

We prove a quaternionic contact versions of the Obata's sphere theorems. We show that if the first positive eigenvalue of the sub-Laplacian on a compact qc manifold of dimension bigger than seven takes the smallest possible value then, up…

Two-dimension almost-Riemannian structures of step 2 are natural generalizations of the Grushin plane. They are generalized Riemannian structures for which the vectors of a local orthonormal frame can become parallel. Under the 2-step…

Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…

Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…

We present a Euclidean quantum gravity model in which random graphs dynamically self-assemble into discrete manifold structures. Concretely, we consider a statistical model driven by a discretisation of the Euclidean Einstein-Hilbert…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…

The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph…

We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…

We prove various comparison theorems of the $i$-th eigenvalue $\lambda_i$ of the Laplacian on fibred Riemannian manifolds by using fiberwise spherical and Euclidean (or hyperbolic) symmetrization. In particular we generalize the…

Let $G=(V,E)$ be an $n$-vertex graph, $L(G)\in \mathbb{R}^{n\times n}$ its Laplacian matrix, and let $\lambda_1(L(G))\ge \lambda_2(L(G))\ge \cdots\ge \lambda_n(L(G))=0$ denote its eigenvalues. For $1\le k\le n$, let $\varepsilon_k(G)=…

Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…

In any dimension $D$, the Euclidean Einstein-Hilbert action, which describes gravity in the absence of matter, can be discretized over random discrete spaces obtained by gluing families of polytopes together in all possible ways. In the…

Let $G$ be a connected $d$-regular graph with a given order and the second largest eigenvalue $\lambda_2(G)$. Mohar and O (private communication) asked a challenging problem: what is the best upper bound for $\lambda_2(G)$ which guarantees…