Related papers: Random geometric complexes
We study the problem of detecting latent geometric structure in random graphs. To this end, we consider the soft high-dimensional random geometric graph $\mathcal{G}(n,p,d,q)$, where each of the $n$ vertices corresponds to an independent…
Persistence diagrams are useful displays that give a summary information regarding the topological features of some phenomenon. Usually, only one persistence diagram is available, and replicated persistence diagrams are needed for…
We investigate Ramsey properties of a random graph model in which random edges are added to a given dense graph. Specifically, we determine lower and upper bounds on the function $p=p(n)$ that ensures that for any dense graph $G_n$ a.a.s.…
We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
Bouc (1992) first studied the topological properties of $M_n$, the matching complex of the complete graph of order $n$, in connection with Brown complexes and Quillen complexes. Bj\"{o}rner et al. (1994) showed that $M_n$ is homotopically…
The efficiency of extracting topological information from point data depends largely on the complex that is built on top of the data points. From a computational viewpoint, the most favored complexes for this purpose have so far been…
Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…
Let $G$ be a group acting properly and by isometries on a metric space $X$; it follows that the quotient or orbit space $X/G$ is also a metric space. We study the Vietoris-Rips and \v{C}ech complexes of $X/G$. Whereas (co)homology theories…
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the \v{C}ech or Rips filtration are stable under small perturbations of the data, but highly sensitive to outliers.…
Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…
Detecting the dimension of a hidden manifold from a point sample has become an important problem in the current data-driven era. Indeed, estimating the shape dimension is often the first step in studying the processes or phenomena…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…
A recent trend in the context of graph theory is to bring theoretical analyses closer to empirical observations, by focusing the studies on random graph models that are used to represent practical instances. There, it was observed that…
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the higher-order structures formed by non-pairwise interactions…
Special generic maps are smooth maps at each singular point of which we can represent as $(x_1, \cdots, x_m) \mapsto (x_1,\cdots,x_{n-1},\sum_{k=n}^{m}{x_k}^2)$ for suitable coordinates. Morse functions with exactly two singular points on…