Graphs with non-negative Ollivier curvature have constant bounded harmonic functions.
problem Liouville property for graphs with non-negative Ollivier curvature.
method Proving Liouville property and improving concentration results.
result Every bounded harmonic function on graphs with non-negative Ollivier curvature is constant.
The paper estimates Betti numbers for graphs with specific curvatures, proving bounds and characterizing rigidity.
problem Estimating Betti numbers for graphs with non-negative curvatures.
method Establishing Betti number estimates for graphs with non-negative Ollivier and Bakry-Émery curvatures.
result Upper bounds on the first Betti number for graphs with non-negative curvatures, with characterizations of rigidity.
The study proves inequalities and curvature properties for Markov chains.
problem Isoperimetric and concentration inequalities for Markov chains.
method Laplacian separation principle for eikonal equation; modified log-Sobolev constant; Ollivier curvature.
result Affirmative answers to open questions and new inequalities.
Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.
problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.
The paper explores curvatures on graphs and their implications for Ricci flatness.
problem Comparing and understanding different curvature notions on graphs and their implications for Ricci flatness.
method Analyzing Ollivier Ricci curvature and Bakry-Émery curvature on combinatorial graphs, investigating graph products, and proving curvature properties.
result Non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under specific conditions.
Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.
problem Understanding the relationship between graph curvature and expansion properties.
method Proving an inequality linking isoperimetric profiles to total variation decay of random walks.
result Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.
Graphs with non-negative curvature have improved heat semigroup estimates.
problem Estimating heat semigroup norms on graphs with curvature.
method Proved a reverse Poincaré inequality for graphs with non-negative Ollivier curvature.
result Heat semigroup norm estimates lead to Buser inequality, Liouville property, and eigenvalue estimates.
Lower bound on minimum vertex degree for non-negative Lin-Lu-Yau curvature on graphs.
problem Determining the minimum vertex degree for non-negative Lin-Lu-Yau curvature.
method Investigation of Ollivier-Ricci curvature and Lin-Lu-Yau modification on locally finite graphs.
result Lower bound on minimum vertex degree ensuring non-negative Lin-Lu-Yau curvature.
The paper shows subexponential growth and displacement bounds for random walks on graphs with bounded degrees and non-negative curvature.
problem Analyzing subexponential growth and displacement bounds for random walks on graphs with bounded degrees and non-negative curvature.
method Proving bounds on the continuous-time random walk displacement and log-volume growth using Ollivier--Ricci curvature.
result The paper establishes subexponential growth and displacement bounds for random walks on graphs with bounded degrees and non-negative curvature.
Non-negative curvature affects Markov chains' mixing and expansion properties.
problem Understanding the behavior of Markov chains with non-negative curvature.
method Analyzing conductance, displacement, and cutoff phenomenon in sparse Markov chains.
result Non-negatively curved Markov chains exhibit specific, non-standard behavior in terms of mixing and expansion.
Every connected, weighted graph with non-negative curvature has exactly two ends.
problem Characterizing the structure of connected, weighted graphs with non-negative curvature.
method Extremal Lipschitz extensions, variational principle, study of harmonic functions.
result Every salami has exactly two ends and no vertices with positive curvature.
New scalar curvature defined from Ollivier-Ricci curvature for graphs.
problem Defining scalar curvature for graphs and point clouds.
method Defining a new scalar version of Ollivier-Ricci curvature and proving its convergence.
result The new scalar curvature converges to scalar curvature for sampled manifolds.
This thesis explores Ollivier-Ricci curvature in graphs and manifolds, with applications to graph neural networks.
problem Understanding curvature in metric spaces and graphs.
method Combines optimal transport theory, Riemannian manifolds, and graph theory to define and analyze Ollivier-Ricci curvature.
result Extensions of Ollivier-Ricci curvature to directed graphs and applications in network science.
Study on curvature in finitely generated groups, showing positive curvature in specific cases.
problem Understanding curvature in finitely generated groups.
method Analyzing dead-end elements and related elements to find curvature, studying effect of radius.
result Examples of positive curvature for arbitrary radius in lamplighter and Houghton's group.
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 representa…
This study examines how removing edges from complete graphs affects Ollivier Ricci curvature.
problem Conditions under which Ollivier Ricci curvature changes sign after edge removal.
method Defined and analyzed graphs obtained by removing matching, vertex incident, and cycle edges from complete graphs.
result Ollivier Ricci curvature remains positive or zero for graphs formed by removing edges from complete graphs.
New methods for calculating curvature in graph theory.
problem Calculating curvature in graphs and random walks.
method Analyzing continuous and discrete-time Ollivier-Ricci curvatures of weighted graphs.
result Generalized existence and properties of Ollivier-Ricci curvature for various random walks.
Unified curvature for hypergraphs from Ollivier-Ricci.
problem Generalizing curvature to hypergraphs.
method Developed ORCHID framework to generalize Ollivier-Ricci curvature to hypergraphs.
result ORCHID curvatures have favorable theoretical properties and are scalable for hypergraph tasks.
Graphs with stronger curvature grow faster.
problem Understanding volume growth on graphs with various curvatures.
method Examined inner-outer and Ricci-Ollivier curvatures to relate them to volume growth.
result Graphs with stronger inner-outer curvature growth have faster volume growth.
The study bounds the effective diameter of graphs with positive Ollivier curvature.
problem Bounding the effective diameter of graphs with positive Ollivier curvature.
method Introducing reflective graphs and proving discrete Bonnet Myers theorem.
result The effective diameter bound is attained only for specific graphs.
New bounds for average graph distance using curvature and centrality.
problem Finding bounds for average graph distance.
method Using weighted average Ollivier curvature with edge betweenness centrality.
result Equality in bounds achieved for specific reflective graphs.
We simplify evaluation of Ollivier-Ricci curvature bounds in hypergraphs.
problem Computational challenges in evaluating Ollivier-Ricci curvature bounds in hypergraphs.
method Simplified approach with linear computational complexity.
result Significant improvements in evaluating Ollivier-Ricci curvature bounds.
Graphs can be smoothed or squashed too, study finds.
problem Graph Neural Networks struggle with over-smoothing and over-squashing issues.
method Unified framework using Ollivier-Ricci curvature to address both issues.
result Over-smoothing and over-squashing linked to positive and negative graph curvature respectively.
We prove the following estimate for the spectrum of the normalized Laplace operator Δ on a finite graph G, \begin{equation*}1- (1- k[t])^{\frac{1}{t}}\leq λ_1 \leq \cdots \leq λ_{N-1}\leq 1+ (1- k[t])^{\frac{1}{t}}, \,\forall \,\,\text{integers}\,\, t\geq 1. \end{equation*} Here k[t] is a lower bound for the Olli…
Curvature formulas on regular graphs identified bone idle edges and graphs.
problem Understanding curvature in regular graphs and identifying bone idle edges.
method Explicit formulas for Lin-Lu-Yau and Ollivier-Ricci curvatures derived from graph parameters.
result Equality condition on regular graphs for Ollivier-Ricci curvature and characterization of bone idle edges.
The paper refines Steinerberger curvature for block graphs and bridges.
problem Understanding curvature in graph theory.
method Formulas and relations for curvature in block graphs and graph bridges.
result Self-centered Bonnet-Myers sharp graphs are antipodal.
New curvature measure for causal sets derived from optimal transport.
problem Capturing Ricci curvature in causal sets.
method Using Lorentzian optimal transport, novel curvature defined along maximal chains.
result Recovery of timelike Ricci curvature from order-theoretic data.
Characterizes graphs with Lin-Lu-Yau curvature at least one and explores bone-idle graphs.
problem Characterizing graphs with specific curvature properties.
method Study of Ollivier-Ricci curvature and Lin-Lu-Yau curvature, exploration of regular graphs, and exact formula derivation.
result Characterizes edges that are bone-idle in regular graphs and provides a complete characterization of 4-regular bone-idle graphs.
The paper proves a discrete positive mass theorem for graphs.
problem Formulating and proving a discrete positive mass theorem for graphs.
method Introducing asymptotically flat graphs, defining ADM mass, and using discrete harmonic functions.
result An asymptotically flat graph with non-negative Ricci curvature is isomorphic to the standard grid graph.
The study examines discrete curvature notions on Cayley graphs of certain groups.
problem Understanding curvature in discrete settings for various groups.
method Introduced Right Angled Artin-Coxeter Hybrids (RAACHs) and derived curvatures of Cayley graphs.
result Addition of relators does not decrease weighted curvatures of Cayley graphs.
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 …
New theorem on graph curvature thresholds and uniqueness.
problem Determining the minimum number of edges for graphs to have positive curvature.
method Analyzing graphs with specific edge counts and curvature properties.
result Optimal threshold for positive curvature and uniqueness of extremal graphs.
We develop a computationally efficient method to estimate Ollivier-Ricci curvature.
problem Computational infeasibility of evaluating Ollivier-Ricci curvature on large graphs.
method Derive explicit transfer moduli between OR and BF curvatures, construct lazy transport envelopes, and use cross-edge matching.
result Deterministic bounds for OR curvature parameterized by local graph combinatorics, reducing complexity to worst-case O(max_v deg(v)^1.5).
In this survey, we study three different notions of curvature that are defined on graphs, namely, combinatorial curvature, Bakry-Émery curvature, and Ollivier's Ricci curvature. For each curvature notion, the definition and its motivation from Riemannian geometry will be explained. Moreover, we bring together some glob…
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 Cartes…
The study classifies graphs with specific curvature and maximum degree.
problem Graphs with nonnegative Ricci curvature and maximum degree constraints.
method Classification of graphs with Lin-Lu-Yau-Ollivier Ricci curvature, maximum degree ≤ 3, and diameter ≥ 6.
result Classification of graphs meeting the specified criteria.
The Ollivier Ricci flow with prescribed curvature on infinite graphs.
problem Ricci flow with prescribed curvature on infinite graphs.
method Existence and uniqueness of the solution to the Ricci flow.
result Convergence of the Ricci flow for graphs with girth at least 6.
Paper explores entropic curvature in Markov chains, comparing it to other curvatures.
problem Comparing entropic curvature to other curvatures in Markov chains.
method Adapted Γ-calculus for θ-curvatures, explicit lower bounds, curvature perturbation.
result Entropic curvature differs significantly from other curvature notions.
In this paper, we explore the relationship between one of the most elementary and important properties of graphs, the presence and relative frequency of triangles, and a combinatorial notion of Ricci curvature. We employ a definition of generalized Ricci curvature proposed by Ollivier in a general framework of Markov p…
Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for bipartite graphs and for the graphs with girth at least 5. We also prove a genera…
We have performed an empirical comparison of two distinct notions of discrete Ricci curvature for graphs or networks, namely, the Forman-Ricci curvature and Ollivier-Ricci curvature. Importantly, these two discretizations of the Ricci curvature were developed based on different properties of the classical smooth notion…
Study shows how discrete graph curvature relates to manifold curvature.
problem Relating discrete graph curvature to intrinsic manifold curvature.
method Continuum limits of Ollivier's Ricci curvature on data clouds.
result Random geometric graphs inherit global curvature properties of manifolds.
Edge subdivision affects the Perron eigenvalue of tree Ricci matrices.
problem Understanding how edge subdivision impacts the Perron eigenvalue of tree Ricci matrices.
method Compressing branches into scalar feedback functions via Schur complement, reducing the spectral problem to a one-dimensional Chebyshev equation.
result Edge subdivision can decrease, preserve, or increase the Perron eigenvalue of tree Ricci matrices.
Finite graphs with specific curvature have limited harmonic functions and ends.
problem Graphs with nonnegative curvature outside a finite subset.
method Introducing discrete Gromov-Hausdorff convergence to study bounded harmonic functions.
result The space of bounded harmonic functions is finite dimensional, and the number of non-parabolic ends is finite.
Existence and uniqueness theorem for Ricci flow on weighted graphs proved.
problem Existence and uniqueness of solutions to Ricci flow equations on weighted graphs.
method Continuous time normalized Ricci flow approach.
result Existence and uniqueness theorem for solutions to Ricci flow on weighted graphs.
The study examines symmetries in spaces with positive or non-negative curvature.
problem Understanding symmetries in spaces with curvature constraints.
method Survey of existing results for Riemannian manifolds with specified curvature properties and symmetries.
result Results on symmetries in spaces with curvature bounds.
Sharp inequality in spaces with non-negative Ricci curvature.
problem Proving a sharp isoperimetric inequality in metric measure spaces.
method Using volume entropy in non-compact metric measure spaces with non-negative synthetic Ricci curvature.
result Proved a sharp dimension-free isoperimetric inequality.
Odd GKM-manifolds with non-negative curvature split cohomology.
problem Understanding cohomology of odd-dimensional GKM-manifolds.
method Proving cohomology splitting for specific manifolds.
result Cohomology splits for GKM3 manifolds of non-negative curvature.