Search arXivSearch

arXiv · 2209.10762

Discrete Bakry-Émery curvature tensors and matrices of connection graphs

Abstract

Liu, Münch, and Peyerimhoff introduced the notion of Bakry-Émery curvature for connection graphs as a means to derive Buser-type bounds on the eigenvalues of connection Laplacians. In this work, we present a reformulation of the Bakry-'Emery curvature at a vertex within a connection graph. Our approach expresses this curvature through the smallest eigenvalue of a set of unitarily equivalent curvature matrices. We interpret these matrices as representations of a newly defined curvature tensor, each corresponding to a different orthonormal basis of the vertex's tangent space. This framework significantly extends earlier studies by Cushing et al. and Siconolfi on curvature matrices of standard graphs. It is important to note that the Bakry-Émery curvature in connection graphs can behave very differently from that in the underlying graphs. For instance, constant functions generally fail to serve as eigenfunctions of the connection Laplacian, which poses a substantial challenge when attempting to generalize results from standard graphs to connection graphs. We address this issue by employing the Schur complement, applied twice using pseudoinverses. Additionally, we investigate the Bakry-Émery curvature in Cartesian products of connection graphs, extending and strengthening the earlier findings of Liu, Münch, and Peyerimhoff. While our results for vertices with locally balanced structures encompass previous work, we also shed light on intriguing behaviors that arise in locally unbalanced connection structures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chunyang Hu, Shiping Liu. 2026-04-07. Discrete Bakry-Émery curvature tensors and matrices of connection graphs. https://arxiv.org/abs/2209.10762

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO