Related papers: Forman-Ricci flow for change detection in large dy…
We introduce Forman-Ricci curvature and its corresponding flow as characteristics for complex networks attempting to extend the common approach of node-based network analysis by edge-based characteristics. Following a theoretical…
Many complex networks in the real world have community structures -- groups of well-connected nodes with important functional roles. It has been well recognized that the identification of communities bears numerous practical applications.…
Motivated by the methods and results of manifold sampling based on Ricci curvature, we propose a similar approach for networks. To this end we make appeal to three types of discrete curvature, namely the graph Forman-, full Forman- and…
Ricci curvature and Ricci flow have proven to be powerful tools for analyzing the geometry of discrete structures, particularly on undirected graphs, where they have been applied to tasks ranging from community detection to graph…
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…
Ricci curvature and its associated flow offer powerful geometric methods for analyzing complex networks. While existing research heavily focuses on applications for undirected graphs such as community detection and core extraction, there…
A goal in network science is the geometrical characterization of complex networks. In this direction, we have recently introduced Forman's discretization of Ricci curvature to the realm of undirected networks. Investigation of this…
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge…
Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the…
Graph Ricci curvature is crucial as it geometrically quantifies network structure. It pinpoints bottlenecks via negative curvature, identifies cohesive communities with positive curvature, and highlights robust hubs. This guides network…
We adapt Forman's discretization of Ricci curvature to the case of undirected networks, both weighted and unweighted, and investigate the measure in a variety of model and real-world networks. We find that most nodes and edges in model and…
The notion of curvature on graphs has recently gained traction in the networks community, with the Ollivier-Ricci curvature (ORC) in particular being used for several tasks in network analysis, such as community detection. In this work, we…
Community detection is an important problem in graph neural networks. Recently, algorithms based on Ricci curvature flows have gained significant attention. It was suggested by Ollivier (2009), and applied to community detection by Ni et al…
In this paper, we introduce a novel method for extending Ricci flow to hypergraphs by defining probability measures on the edges and transporting them on the line expansion. This approach yields a new weighting on the edges, which proves…
We have recently introduced Forman's discretization of Ricci curvature to the realm of complex networks. Forman curvature is an edge-based measure whose mathematical definition elegantly encapsulates the weights of nodes and edges in a…
Community detection in hypergraphs is both instrumental for functional module identification and intricate due to higher-order interactions among nodes. We define a hypergraph Ricci flow that directly operates on higher-order interactions…
A goal in network science is the geometrical characterization of complex networks. In this direction, we (arXiv:1603.00386; J. Stat. Mech. (2016) P063206) have recently introduced the Forman's discretization of Ricci curvature to the realm…
Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We…
We present the application of topological data analysis (TDA) to study unweighted complex networks via their persistent homology. By endowing appropriate weights that capture the inherent topological characteristics of such a network, we…
We study the existence of solutions of Ricci flow equations of Ollivier-Lin-Lu-Yau curvature defined on weighted graphs. Our work is motivated by\cite{NLLG} in which the discrete time Ricci flow algorithm has been applied successfully as a…