Related papers: First Betti number of the path homology of random …
In this paper, we establish Betti number estimates for graphs with non-negative Ollivier curvature, and for graphs with non-negative Bakry-\'Emery curvature, providing a discrete analogue of a classical result by Bochner for manifolds.…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
We initiate the study of local topology of random graphs. The high level goal is to characterize local "motifs" in graphs. In this paper, we consider what we call the layer-$r$ subgraphs for an input graph $G = (V,E)$: Specifically, the…
We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…
We compute the Betti numbers of the edge rings of multi-path graphs using the \emph{induced-subgraph approach} introduced in \cite{WL1}. Here, a multi-path graph refers to a simple graph composed of several paths that have the same starting…
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…
We consider the multi-parameter random simplicial complex as a higher dimensional extension of the classical Erd\"os-R\'enyi graph. We investigate appearance of "unusual" topological structures in the complex from the point of view of large…
Constructing null models to test the significance of extracted information is a crucial step in data analysis. In this work, we provide a uniformly sampleable null model of directed graphs with the same (or similar) number of simplices in…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
In this paper we explore first passage percolation (FPP) on the Erd\H{o}s-R\'enyi random graph $G_n(p_n)$, where each edge is given an independent exponential edge weight with rate 1. In the sparse regime, i.e., when $np_n\to \lambda>1,$ we…
We investigate the higher-order connectivity of scale-free networks using algebraic topology. We model scale-free networks as preferential attachment graphs, and we study the algebraic-topological properties of their clique complexes. We…
The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. We study the higher-order connectivity of such a network by investigating the topological…
This study presents a numerical analysis of the topology of a set of cosmologically interesting three-dimensional Gaussian random fields in terms of their Betti numbers $\beta_0$, $\beta_1$ and $\beta_2$. We show that Betti numbers entail a…
We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs.…