相关论文: Simplicial Homology of Random Configurations
We consider the random clique complex process - the process of clique complexes induced by the complete graph with i.i.d. Uniform edge weights. We investigate the evolution of the Betti numbers of the clique complex process in the critical…
The objective of this study is to examine the asymptotic behavior of Betti numbers of \v{C}ech complexes treated as stochastic processes and formed from random points in the $d$-dimensional Euclidean space $\mathbb{R}^d$. We consider the…
The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…
In the 7-vertex triangulation of the torus, the 14 triangles can be partitioned as $T_{1} \sqcup T_{2}$, such that each $T_{i}$ represents the lines of a copy of the Fano plane $PG(2, \mathbb{F}_{2})$. We generalize this observation by…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
We are interested in estimating the location of what we call "smooth change-point" from $n$ independent observations of an inhomogeneous Poisson process. The smooth change-point is a transition of the intensity function of the process from…
We consider a random geometric graph obtained by placing a Poisson point process of intensity 1 in the d-dimensional torus of side length n^(1/d) and connecting two points by an edge if their distance is at most r. We consider the case of…
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
We consider the random interlacements process with intensity $u$ on ${\mathbb Z}^d$, $d\ge 5$ (call it $I^u$), built from a Poisson point process on the space of doubly infinite nearest neighbor trajectories on ${\mathbb Z}^d$. For $k\ge 3$…
As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied…
For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…
In the first part of the paper we introduce some geometric tools needed to describe slow-fast Hamiltonian systems on smooth manifolds. We start with a smooth Poisson bundle $p: M\to B$ of a regular (i.e. of constant rank) Poisson manifold…
A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…
We study point processes that consist of certain centers of point tuples of an underlying Poisson process. Such processes arise in stochastic geometry in the study of exceedances of various functionals describing geometric properties of the…
We prove that that the number p of positive eigenvalues of the connection Laplacian L of a finite abstract simplicial complex G matches the number b of even dimensional simplices in G and that the number n of negative eigenvalues matches…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
We consider a finite simplicial complex $K$ together with its successive barycentric subdivisions $Sd^d(K), d\geq0,$ and study the expected topology of a random subcomplex in $Sd^d(K), d\gg0$. We get asymptotic upper and lower bounds for…
Consider a 2-dimensional soft random geometric graph $G(\lambda,s,\phi)$, obtained by placing a Poisson($\lambda s^2$) number of vertices uniformly at random in a square of side $s$, with edges placed between each pair $x,y$ of vertices…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…