Related papers: Homological Connectivity in Random \v{C}ech Comple…
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump type Markov processes, established under simple conditions on the Laplace…
Computation of persistent homology of simplicial representations such as the Rips and the C\v{e}ch complexes do not efficiently scale to large point clouds. It is, therefore, meaningful to devise approximate representations and evaluate the…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…
Motivated by constructions in topological data analysis and algebraic combinatorics, we study homotopy theory on the category of Cech closure spaces $\mathbf{Cl}$, the category whose objects are sets endowed with a Cech closure operator and…
We introduce the notion of a $\theta$-almost twisted Poisson structure on manifolds, which involves incorporating a closed $1$-form $\theta$ into twisted Poisson structures under specific conditions. We provide a characterization of this…
This paper investigates the propreties of the persistence diagrams stemming from almost surely continuous random processes on $[0,t]$. We focus our study on two variables which together characterize the barcode : the number of points of the…
We introduce a family of loop soup models on the hypercubic lattice. The models involve links on the edges, and random pairings of the link endpoints on the sites. We conjecture that loop correlations of distant points are given by…
In this paper we study the connection between the phenomenon of homological percolation (the formation of "giant" cycles in persistent homology), and the zeros of the expected Euler characteristic curve. We perform an experimental study…
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…
The hierarchical Dirichlet process is a discrete random measure used as a prior in Bayesian nonparametrics and motivated by the study of groups of clustered data. We study the asymptotic behavior of the power sum symmetric polynomials for…
Persistent homology theory is a relatively new but powerful method in data analysis. Using simplicial complexes, classical persistent homology is able to reveal high dimensional geometric structures of datasets, and represent them as…
Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two…
We characterise high-dimensional topology that arises from a random Cech complex constructed on the circle. Expected Euler characteristic curve is computed, where we observe limiting spikes. The spikes correspond to expected Betti numbers…
In this paper, homology of a contact CR-submanifold of a real hypersurface, which has naturally almost contact metric structure induced from the complex Euclidean space $\mathbb{C}^{m}$, is examined. More precisely, nonexistence of stable…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…
We consider a random geometric graph process where random points $(X_i)_{i \ge 1}$ are embedded consecutively in the $d$-dimensional unit torus $\mathbb{T}^d$, and every two points at distance at most $r$ form an edge. As $r\to 0$, we…
We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the l_p norm. We show…
A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase…