scholarly journals A survey of Ricci curvature for metric spaces and Markov chains

Author(s):  
Yann Ollivier
2020 ◽  
pp. 1-28
Author(s):  
Emil Saucan ◽  
Areejit Samal ◽  
Jürgen Jost

Abstract We introduce new definitions of sectional, Ricci, and scalar curvatures for networks and their higher dimensional counterparts, derived from two classical notions of curvature for curves in general metric spaces, namely, the Menger curvature and the Haantjes curvature. These curvatures are applicable to unweighted or weighted and undirected or directed networks and are more intuitive and easier to compute than other network curvatures. In particular, the proposed curvatures based on the interpretation of Haantjes definition as geodesic curvature allow us to give a network analogue of the classical local Gauss–Bonnet theorem. Furthermore, we propose even simpler and more intuitive proxies for the Haantjes curvature that allow for even faster and easier computations in large-scale networks. In addition, we also investigate the embedding properties of the proposed Ricci curvatures. Lastly, we also investigate the behavior, both on model and real-world networks, of the curvatures introduced herein with more established notions of Ricci curvature and other widely used network measures.


2007 ◽  
Vol 345 (11) ◽  
pp. 643-646 ◽  
Author(s):  
Yann Ollivier

2006 ◽  
Vol 134 (1) ◽  
pp. 165-197 ◽  
Author(s):  
Assaf Naor ◽  
Yuval Peres ◽  
Oded Schramm ◽  
Scott Sheffield

2021 ◽  
pp. 1-52
Author(s):  
DIMITRIS MICHAIL GERONTOGIANNIS

Abstract We prove that, up to topological conjugacy, every Smale space admits an Ahlfors regular Bowen measure. Bowen’s construction of Markov partitions implies that Smale spaces are factors of topological Markov chains. The latter are equipped with Parry’s measure, which is Ahlfors regular. By extending Bowen’s construction, we create a tool for transferring the Ahlfors regularity of the Parry measure down to the Bowen measure of the Smale space. An essential part of our method uses a refined notion of approximation graphs over compact metric spaces. Moreover, we obtain new estimates for the Hausdorff, box-counting and Assouad dimensions of a large class of Smale spaces.


Author(s):  
Vicenç Torra ◽  
Mariam Taha ◽  
Guillermo Navarro-Arribas

AbstractMachine and statistical learning is about constructing models from data. Data is usually understood as a set of records, a database. Nevertheless, databases are not static but change over time. We can understand this as follows: there is a space of possible databases and a database during its lifetime transits this space. Therefore, we may consider transitions between databases, and the database space. NoSQL databases also fit with this representation. In addition, when we learn models from databases, we can also consider the space of models. Naturally, there are relationships between the space of data and the space of models. Any transition in the space of data may correspond to a transition in the space of models. We argue that a better understanding of the space of data and the space of models, as well as the relationships between these two spaces is basic for machine and statistical learning. The relationship between these two spaces can be exploited in several contexts as, e.g., in model selection and data privacy. We consider that this relationship between spaces is also fundamental to understand generalization and overfitting. In this paper, we develop these ideas. Then, we consider a distance on the space of models based on a distance on the space of data. More particularly, we consider distance distribution functions and probabilistic metric spaces on the space of data and the space of models. Our modelization of changes in databases is based on Markov chains and transition matrices. This modelization is used in the definition of distances. We provide examples of our definitions.


Sign in / Sign up

Export Citation Format

Share Document