Related papers: Core detection via Ricci curvature flows on weight…
Bridging geometry and topology, curvature is a powerful and expressive invariant. While the utility of curvature has been theoretically and empirically confirmed in the context of manifolds and graphs, its generalization to the emerging…
In this paper, we construct a set of new functionals of Ricci curvature on any Kaehler manifolds which are invariant under holomorphic transfermations in Kaehler Einstein manifolds and essentially decreasing under the Kaehler Ricci flow.…
Understanding body part geometry is crucial for precise medical diagnostics. Curves effectively describe anatomical structures and are widely used in medical imaging applications related to cardiovascular, respiratory, and skeletal…
Using Banchoff's discrete Morse Theory, in tandem with Bloch's result on the strong connection between the former and Forman's Morse Theory, and our own previous algorithm based on the later, we show that there exists a curvature-based,…
A graph is called Ricci-flat if its Ricci curvatures vanish on all edges, here the definition of Ricci curvature on graphs was given by Lin-Lu-Yau. The authors in arXiv:1301.0102 and arXiv:1802.02982 obtained a complete characterization for…
Two problems in the search of metric characteristics on weighted undirected graphs with non-negative edge weights are being considered. The first problem: a weighted undirected graph with non-negative edge weight is given. The radius,…
We establish a short-time existence theory for complete Ricci flows under scaling-invariant curvature bounds, starting from rotationally symmetric metrics on $\mathbb{R}^{n+1}$ that are noncollapsed at infinity, without assuming bounded…
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph $G$ and an integer $r_{uv}$ for every pair of vertices $u,v\in V(G)$. The objective is to construct a subgraph $H$ of minimum weight which contains…
We show for a non homogeneous boundary value problem for the Ricci flow on the disk that when the initial metric has positive curvature and the boundary is convex then the initial metric is deformed, via the normalized flow and along…
Background: Imagine a paper with n nodes on it where each pair undergoes a coin toss experiment; if heads we connect the pair with an undirected link, while tails maintain the disconnection. This procedure yields a random graph. Now…
We formalize the problem of detecting a community in a network into testing whether in a given (random) graph there is a subgraph that is unusually dense. We observe an undirected and unweighted graph on N nodes. Under the null hypothesis,…
Subgraph densities play a crucial role in network analysis, especially for the identification and interpretation of meaningful substructures in complex graphs. Localized subgraph densities, in particular, can provide valuable insights into…
There has been recent growing interest in graph theoretical properties known as r- and (r,s)-robustness. These properties serve as sufficient conditions guaranteeing the success of certain consensus algorithms in networks with misbehaving…
We elaborate the notion of a Ricci curvature lower bound for parametrized statistical models. Following the seminal ideas of Lott-Strum-Villani, we define this notion based on the geodesic convexity of the Kullback-Leibler divergence in a…
We present a new cycle flow based method for finding fuzzy partitions of weighted directed networks coming from time series data. We show that this method overcomes essential problems of most existing clustering approaches, which tend to…
In this paper, we consider the Ricci curvature of a directed graph, based on Lin-Lu-Yau's definition. We give some properties of the Ricci curvature, including conditions for a directed regular graph to be Ricci-flat. Moreover, we calculate…
In this paper we survey some results on Ricci flowing non-smooth initial data. Among other things, we give a non-exhaustive list of various weak initial data which can be evolved with the Ricci flow. We also survey results which show that…
As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive in scale and also fully dynamic (with insertions and…
We present a lightweight network that infers grouping and boundaries, including curves, corners and junctions. It operates in a bottom-up fashion, analogous to classical methods for sub-pixel edge localization and edge-linking, but with a…
In this work, we prove uniqueness for complete non-compact Ricci flow with scaling invariant curvature bound. This generalizes the earlier work of Chen-Zhu, Kotschwar and covers most of the example of Ricci flows with unbounded curvature.…