相关论文: Simplicial Homology of Random Configurations

We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between two…

We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…

Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random \v{C}ech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…

Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…

In this chapter we review some examples, methods, and recent results involving comparison of clustering properties of point processes. Our approach is founded on some basic observations allowing us to consider void probabilities and moment…

We discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of…

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

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.…

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$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

We show that the chaos representation of some Compound Poisson Type processes displays an underlying intrinsic combinatorial structure, partly independent of the chosen process. From the computational viewpoint, we solve the arising…

A $U$-statistic of a Poisson point process is defined as the sum $\sum f(x_1,\ldots,x_k)$ over all (possibly infinitely many) $k$-tuples of distinct points of the point process. Using the Malliavin calculus, the Wiener-It\^{o} chaos…

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…

This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions…

We compute the moment of order n of the Poisson stochastic integral of a random process u over a metric space X as a sum that runs over all partitions of {1,...,n} and involves the addition of points to Poisson configurations. This formula…

We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

Let T be the homogeneous tree with degree and G a finitely generated group whose Cayley graph is T. The associated lamplighter group is the wreath product of the cyclic group of order r with G. For a large class of random walks on this…