Related papers: Infinitely exchangeable random graphs generated fr…
Consider the random graph $G({\mathcal P}_{n},r)$ whose vertex set ${\mathcal P}_{n}$ is a Poisson point process of intensity $n$ on $(- \frac{1}{2}, \frac{1}{2}]^d$, $d \geq 2$. Any two vertices $X_i,X_j \in {\mathcal P}_{n}$ are connected…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
Let $\eta_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Y^k$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $\eta_t$ generates a…
We generalize the Poisson limit theorem to binary functions of random objects whose law is invariant under the action of an amenable group. Examples include stationary random fields, exchangeable sequences, and exchangeable graphs. A…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
Define the scaled empirical point process on an independent and identically distributed sequence $\{Y_i: i\le n\}$ as the random point measure with masses at $a_n^{-1} Y_i$. For suitable $a_n$ we obtain the weak limit of these point…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
We prove that the size of the e-core of a partition taken under the Poissonised Plancherel measure converges in distribution to, as the Poisson parameter goes to infinity and after a suitable renormalisation, a sum of e-1 mutually…
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…
We introduce a noncommutative Poisson random measure on a von Neumann algebra. This is a noncommutative generalization of the classical Poisson random measure. We call this construction Poissonization. Poissonization is a functor from the…
Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…
We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…
We present a new approach to study measures on ensembles of contours, polymers or other objects interacting by some sort of exclusion condition. For concreteness we develop it here for the case of Peierls contours. Unlike existing methods,…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
The problem of finding the expected value of a statistic of a locally stable point process in a bounded region is addressed. We propose an adaptive importance sampling for solving the problem. In our proposal, we restrict the importance…
We define a general class of random systems of horizontal and vertical weighted broken lines on the quarter plane whose distribution are proved to be translation invariant. This invariance stems from a reversibility property of the model.…
There is currently a gap in theory for point patterns that lie on the surface of objects, with researchers focusing on patterns that lie in a Euclidean space, typically planar and spatial data. Methodology for planar and spatial data thus…
A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of $[n]=\{1,...,n\}$ at time $\theta \ge 0$ is governed by the Ewens sampling formula with parameter $\theta$. These…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…