相关论文: Ollivier-Ricci Curvature for Hypergraphs: A Unifie…

Representational similarity analysis (RSA) is widely used to analyze the alignment between humans and neural networks; however, conclusions based on this approach can be misleading without considering the underlying representational…

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…

We define a notion of a measured length space X having nonnegative N-Ricci curvature, for N finite, or having infinity-Ricci curvature bounded below by K, for K a real number. The definitions are in terms of the displacement convexity of…

The connection between curvature and topology is a very well-studied theme in the subject of differential geometry. By suitably defining curvature on networks, the study of this theme has been extended into the domain of network analysis as…

In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…

Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

This survey describes some recent rigidity results obtained by the authors for the prescribed mean curvature problem on graphs $u : M \rightarrow \mathbb{R}$. Emphasis is put on minimal, CMC and capillary graphs, as well as on graphical…

Recently, an indicator for stock market fragility and crash size in terms of the Ollivier-Ricci curvature has been proposed. We study analytical and empirical properties of such indicator, test its elasticity with respect to different…

We show that, in discrete models of quantum gravity, emergent geometric space can be viewed as the entanglement pattern in a mixed quantum state of the "universe", characterized by a universal topological network entanglement. As a concrete…

Graph neural networks(GNNs) have been demonstrated to depend on whether the node effective information is sufficiently passing. Discrete curvature (Ricci curvature) is used to study graph connectivity and information propagation efficiency…

This paper presents a new look at the neural network (NN) robustness problem, from the point of view of graph theory analysis, specifically graph curvature. Graph curvature (e.g., Ricci curvature) has been used to analyze system dynamics…

We derive explicit formulas for the Lin-Lu-Yau curvature and the Ollivier-Ricci curvature in terms of graph parameters and an optimal assignment. Utilizing these precise expressions, we examine the relationship between the Lin-Lu-Yau…

Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…

We make a systematic investigation of quadrature properties for quadrics, namely integration of holomorphic functions over planar domains bounded by second degree curves. A full understanding requires extending traditional settings by…

Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and…

In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study the Ricci flow resulting from this curvature. We prove the…

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Temporal networks -- sequences of time-stamped contacts among nodes -- constitute the finest-grained representation of dynamic interaction data; however, geometric and topological analyses of such networks have remained largely confined to…

An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…