Searcharxiv⌕ Search

arXiv subjects

Florentin Münch

Publications and source records attributed to Florentin Münch.

53 records · Page 3Linked to original sources
arXiv2019

Distance bounds for graphs with some negative Bakry-Émery curvature

We prove distance bounds for graphs possessing positive Bakry-Émery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits an explicit upper bound for the diameter. Otherwise, the graph is a subset of the tubular neighborhood with an explicit radius around the non-positively curved vertices. Those results seem to be the first assuming non-constant Bakry-Émery curvature assumptions on graphs.

math.DG↗
arXiv2018

A discrete Hopf-Rinow-theorem

We prove a version of the Hopf-Rinow-theorem with respect to path metrics on discrete spaces. The novel aspect is that we do not a priori assume local finiteness but isolate a local finiteness type condition, called essential local finiteness, that is indeed necessary. As a side product we identify the maximal weight, called the geodesic weight, which generates the path metric in the situation when the space is complete with respect to any of the equivalent notions of completeness proven in the Hopf-Rinow theorem. As an application, we characterize the graphs for which the resistance metric is a path metric induced by the graph structure.

math.MG↗
arXiv2018

Rigidity of the Bonnet-Myers inequality for graphs with respect to Ollivier Ricci curvature

We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense. Our main result is a classification of all self-centered Bonnet-Myers sharp graphs (hypercubes, cocktail party graphs, even-dimensional demi-cubes, Johnson graphs $J(2n,n)$, the Gosset graph and suitable Cartesian products). We also present a purely combinatorial reformulation of this result. We show that Bonnet-Myers sharpness implies Lichnerowicz sharpness. We also relate Bonnet-Myers sharpness to an upper bound of Bakry-Émery $\infty$-curvature, which motivates a generalconjecture about Bakry-Émery $\infty$-curvature.

math.CO↗
arXiv2018

Coverings and the heat equation on graphs: stochastic incompleteness, the Feller property and uniform transience

We study regular coverings of graphs and manifolds with a focus on properties of the heat equation. In particular, we look at stochastic incompleteness, the Feller property and uniform transience; and investigate the connection between the validity of these properties on the base space and its covering. For both graphs and manifolds, we prove the equivalence of stochastic incompleteness of the base and that of its cover. Along the way we also give some new conditions for the Feller property to hold on graphs.

math.FA↗
arXiv2018

Curvature calculations for antitrees

In this article we prove that antitrees with suitable growth properties are examples of infinite graphs exhibiting strictly positive curvature in various contexts: in the normalized and non-normalized Bakry-Émery setting as well in the Ollivier-Ricci curvature case. We also show that these graphs do not have global positive lower curvature bounds, which one would expect in view of discrete analogues of the Bonnet-Myers theorem. The proofs in the different settings require different techniques.

math.CO↗
arXiv2017

Ricci curvature on birth-death processes

In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and Émery's $CD(K,n)$ condition for linear graphs and prove the triviality of edge weights for every linear graph supported on the infinite line $\mathbb{Z}$ with non-negative curvature. Moreover, we show that linear graphs with curvature decaying not faster than $-R^2$ are stochastically complete. We deduce a type of Bishop-Gromov comparison theorem for normalized linear graphs. For normalized linear graphs with non-negative curvature, we obtain the volume doubling property and the Poincaré inequality, which yield Gaussian heat kernel estimates and parabolic Harnack inequality by Delmotte's result. As applications, we generalize the volume growth and stochastic completeness properties to weakly spherically symmetric graphs. Furthermore, we give examples of infinite graphs with a positive lower curvature bound.

math.DG↗
arXiv2017

Ollivier Ricci curvature for general graph Laplacians: Heat equation, Laplacian comparison, non-explosion and diameter bounds

Discrete time random walks on a finite set naturally translate via a one-to-one correspondence to discrete Laplace operators. Typically, Ollivier curvature has been investigated via random walks. We first extend the definition of Ollivier curvature to general weighted graphs and then give a strikingly simple representation of Ollivier curvature using the graph Laplacian. Using the Laplacian as a generator of a continuous time Markov chain, we connect Ollivier curvature with the heat equation which is strongly related to continuous time random walks. In particular, we prove that a lower bound on the Ollivier curvature is equivalent to a certain Lipschitz decay of solutions to the heat equation. This is a discrete analogue to a celebrated Ricci curvature lower bound characterization by Renesse and Sturm. Our representation of Ollivier curvature via the Laplacian allows us to deduce a Laplacian comparison principle by which we prove non-explosion and improved diameter bounds.

math.DG↗
arXiv2017

Magnetic sparseness and Schrödinger operators on graphs

We study magnetic Schrödinger operators on graphs. We extend the notion of sparseness of graphs by including a magnetic quantity called the frustration index. This notion of magnetic sparse turn out to be equivalent to the fact that the form domain is an $\ell^{2}$ space. As a consequence, we get criteria of discreteness for the spectrum and eigenvalue asymptotics.

math.SP↗
arXiv2017

Ollivier-Ricci idleness functions of graphs

We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most $3$ linear parts, with at most $2$ linear parts in the case of a regular graph. We then apply our result to show that the idleness function of the Cartesian product of two regular graphs is completely determined by the idleness functions of the factors.

math.CO↗
arXiv2017

Rigidity properties of the hypercube via Bakry-Emery curvature

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as well as new direct methods which translate curvature to combinatorial properties. Our results can be seen as first known discrete analogues of Cheng's and Obata's rigidity theorems.

math.DG↗
arXiv2016

Bakry-Emery curvature and diameter bounds on graphs

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension bound, but is independent of the vertex degree. In particular, the second result is the first Bonnet-Myers type theorem for unbounded graph Laplacians. Moreover, our results improve diameter bounds from [6] and [10].

math.DG↗
arXiv2015

Curvature and higher order Buser inequalities for the graph connection Laplacian

We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger constants in the case of nonnegative Ricci curvature. In this process, we discuss the concepts of Cheeger type constants and a discrete Ricci curvature for connection Laplacians and study their properties systematically. The Cheeger constants are defined as mixtures of the expansion rate of the underlying graph and the frustration index of the signature. The discrete curvature, which can be computed efficiently via solving semidefinite programming problems, has a characterization by the heat semigroup for functions combined with a heat semigroup for vector fields on the graph.

math.SP↗
arXiv2015

Note on short time behavior of semigroups associated to selfadjoint operators

We present a simple observation showing that the heat kernel on a locally finite graph behaves for short times $t$ roughly like $t^d$, where $d$ is the combinatorial distance. This is very different from the classical Varadhan type behavior on manifolds. Moreover, this also gives that short time behavior and global behavior of the heat kernel are governed by two different metrics whenever the degree of the graph is not uniformly bounded.

math.FA↗
arXiv2015

Remarks on curvature dimension conditions on graphs

We show a connection between the $CDE'$ inequality and the $CDψ$ inequality. In particular, we introduce a $CD_ψ^φ$ inequality as a slight generalization of $CDψ$ which turns out to be equivalent to $CDE'$ with appropriate choices of $φ$ and $ψ$. We use this to prove that the $CDE'$ inequality implies the classical $CD$ inequality on graphs, and that the $CDE'$ inequality with curvature bound zero holds on Ricci-flat graphs.

math.DG↗
arXiv2014

Li-Yau inequality on finite graphs via non-linear curvature dimension conditions

We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of the calculus of Bakry and Émery. In the case of manifolds, the new calculus and the new curvature-dimension inequality coincide with the common ones. In the case of graphs, they coincide in a limit. In this sense, the new curvature-dimension inequality gives a more general concept of curvature on graphs and on manifolds. We show that Ricci-flat graphs have a non-negative curvature in this sense. Moreover, a variety of non-logarithmic Li-Yau type gradient estimates can be obtained by using the new Bakry-Émery type calculus. Furthermore, we use these Li-Yau inequalities to derive Harnack inequalities on graphs.

math.DG↗
arXiv2014

Geometry and spectrum of rapidly branching graphs

We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth. The underlying techniques are estimates on the isoperimetric constant. Furthermore, we give lower volume growth bounds and we provide a new criterion for stochastic incompleteness.

math.SP↗