2015
DOI: 10.1016/j.disc.2014.08.012
|View full text |Cite
|
Sign up to set email alerts
|

Exact and asymptotic results on coarse Ricci curvature of graphs

Abstract: Abstract. In this paper we study Ollivier's coarse Ricci-curvature for graphs, and obtain exact formulas for the Ricci-curvature for bipartite graphs and for the graphs with girth at least 5. These are the first formulas for Ricci-curvature which hold for a wide class of graphs. We also obtain a general lower bound on the Ricci-curvature involving the size of the maximum matching in an appropriate subgraph. As a consequence, we characterize Ricci-flat graphs of girth 5, and give the first necessary and suffici… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
68
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(68 citation statements)
references
References 30 publications
0
68
0
Order By: Relevance
“…Cho and Paeng [41] slightly generalise the result on trees to graphs of girth at least 6, where the two expressions are in fact equivalent due to the locality property discussed above (graphs of girth at least 6 are locally tree-like). These results were significantly extended by Bhattacharya and Mukherjee in [42] to graphs of girth at least 5 and to bipartite graphs. Loisel and Romon [43] demonstrate that the Ollivier curvature depends only on the degree of the vertices for edges in a surface triangulation satisfying certain genericity assumptions and consequently calculate the Ollivier curvature for many polyhedral surfaces.…”
Section: The Ollivier Curvature In Graphsmentioning
confidence: 64%
“…Cho and Paeng [41] slightly generalise the result on trees to graphs of girth at least 6, where the two expressions are in fact equivalent due to the locality property discussed above (graphs of girth at least 6 are locally tree-like). These results were significantly extended by Bhattacharya and Mukherjee in [42] to graphs of girth at least 5 and to bipartite graphs. Loisel and Romon [43] demonstrate that the Ollivier curvature depends only on the degree of the vertices for edges in a surface triangulation satisfying certain genericity assumptions and consequently calculate the Ollivier curvature for many polyhedral surfaces.…”
Section: The Ollivier Curvature In Graphsmentioning
confidence: 64%
“…Because of their random character, the Regge formulation of curvature is no more applicable, a purely combinatorial version of Ricci curvature is needed. Recently, exactly such a combinatorial Ricci curvature has been proposed by Ollivier [10,11] and further elaborated on in [12][13][14][15].…”
Section: Jhep09(2017)045mentioning
confidence: 99%
“…Fortunately, it becomes much simpler for bipartite graphs [15], which have no odd cycles. Since the Ollivier curvature of an edge depends only on the triangles, squares and pentagrams supported on that edge (a discrete form of locality) [12][13][14] and there are no triangles and pentagrams on graphs in the configuration space, one can use for all practical…”
Section: Jhep09(2017)045mentioning
confidence: 99%
See 1 more Smart Citation
“…This has two immediate consequences, there are no triangles and there is a perfect matching between the unit spheres of neighboring vertices. These properties imply that both recently developed concepts of combinatorial Ricci curvature for graphs, the Ollivier curvature [15][16][17] and the Knill curvature [18] vanish and so does then also the Ricci curvature obtained in the continuum limit. These "large world" ground-state graphs are thus Ricci flat.…”
Section: Introductionmentioning
confidence: 95%