We consider correlation decay in the hard-core model with fugacity $λ$ on a rooted tree $T$ in which the arity of each vertex is independently Poisson distributed with mean $d$. Specifically, we investigate the question of which parameter settings $(d, λ)$ result in strong spatial mixing, weak spatial mixing, or neither. (In our context, weak spatial mixing is equivalent to Gibbs uniqueness.) For finite fugacity, a zero-one law implies that these spatial mixing properties hold either almost surely or almost never, once we have conditioned on whether $T$ is finite or infinite.
We provide a partial answer to this question, which implies in particular that
1. As $d \to \infty$, weak spatial mixing on the Poisson tree occurs whenever $λ< f(d) - o(1)$ but not when $λ$ is slightly above $f(d)$, where $f(d)$ is the threshold for WSM (and SSM) on the $d$-regular tree. This suggests that, in most cases, Poisson trees have similar spatial mixing behavior to regular trees.
2. When $1 < d \le 1.179$, there is weak spatial mixing on the Poisson($d$) tree for all values of $λ$. However, strong spatial mixing does not hold for sufficiently large $λ$. This is in contrast to regular trees, for which strong spatial mixing and weak spatial mixing always coincide.
For infinite fugacity SSM holds only when the tree is finite, and hence almost surely fails on the Poisson($d$) tree when $d>1$. We show that WSM almost surely holds on the Poisson($d$) tree for $d < \mathbf{e}^{1/\sqrt{2}}/\sqrt{2} =1.434...$, but that it fails with positive probability if $d>\mathbf{e}$.
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several classes of random trees growing in discrete time and their poissonized counterparts have the same limiting degree Gini index. The classes that we consider include binary search trees, binary pyramids and random caterpillars.
This paper focuses on the problem of modeling for small world effect on complex networks. Let's consider the supercritical Poisson continuous percolation on $d$-dimensional torus $T^d_n$ with volume $n^d$. By adding "long edges (short cuts)" randomly to the largest percolation cluster, we obtain a random graph $\mathscr G_n$. In the present paper, we first prove that the diameter of $\mathscr G_n$ grows at most polynomially fast in $\ln n$ and we call it the Poisson Geometry Small World. Secondly, we prove that the random walk on $\mathscr G_n$ possesses the rapid mixing property, namely, the …
We construct a tree-based dependence structure for the representation of binomial, Poisson and Gaussian random vectors having a given covariance matrix, using sums of independent random variables. This construction allows us to characterize the supermodular ordering of such random vectors via the componentwise ordering of their covariance matrices. Our method relies on the representation of dependent components using binary trees on the discrete $d$-dimensional hypercube $C_d$, and on Möbius inversion techniques. In the case of Poisson random vectors this approach involves Lévy measures on $C_…
Continuous time branching models are used to create random fractals in a Euclidean space, whose Hausdorff dimension is controlled by an input parameter. Finite realizations are applied in modelling the set of sites visited in models of human and animal mobility.
It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all Lévy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new procedure for recovering the tree distance from the graphical spanning trees that works simultaneously for stable trees and inhomogeneous continuum random trees.
We derive sufficient conditions for the mixing of all orders of interacting transformations of a spatial Poisson point process, under a zero-type condition in probability and a generalized adaptedness condition. This extends a classical result in the case of deterministic transformations of Poisson measures. The approach relies on moment and covariance identities for Poisson stochastic integrals with random integrands.
Let $T_λ$ be a Galton--Watson tree with Poisson($λ$) offspring, and let $A$ be a tree property. In this paper, are concerned with the regularity of the function $\mathbb{P}_λ(A):= \mathbb{P}(T_λ\vdash A)$. We show that if a property $A$ can be uniformly approximated by a sequence of properties $A_k$, depending only on the first $k$ vertices in the breadth first exploration of the tree, with a bound in probability of $\mathbb{P}_λ(A\triangle A_k) \le Ce^{-ck}$ over an interval $I = (λ_0, λ_1)$, then $\mathbb{P}_λ(A)$ is real analytic in $λ$ for $λ\in I$. We also present some applications of our…
Stacy distribution defined for the first time in 1961 provides a flexible framework for modelling of a wide range of real-life behaviours. It appears under different names in the scientific literature and contains many useful particular cases. Homogeneous Poisson processes are appropriate apriori models for the number of renewals up to a given time $t>0$. This paper mixes them and considers a Mixed Poisson process with Stacy mixing variable. We call it a Poisson-Stacy process. The resulting counting process is one of the Generalised Negative Binomial processes, and the distribution of its time…
The Brownian web can be roughly described as a family of coalescing one-dimensional Brownian motions starting at all times in $\R$ and at all points of $\R$. It was introduced by Arratia; a variant was then studied by Toth and Werner; another variant was analyzed recently by Fontes, Isopi, Newman and Ravishankar. The two-dimensional \emph{Poisson tree} is a family of continuous time one-dimensional random walks with uniform jumps in a bounded interval. The walks start at the space-time points of a homogeneous Poisson process in $\R^2$ and are in fact constructed as a function of the point proc…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the continuum tree which we identified in a previous article as a distributional scaling limit of Ford's trees. In general, the Markov branching trees induced by the two-parameter growth rule are not sampling consistent, so the existence of compact limiting trees cannot be deduced from previous work on the sampling consistent case. We develop here a new approach to es…
We give conditions for the exactness of Rokhlin endomorphisms, apply these to random walks on locally compact, second countable topological groups and obtain that the action on the Poisson boundary of an adapted random walk on such a group is weakly mixing.
Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake perform simple random walks, awakening any sleeping particles they encounter. We prove that there is a phase transition between transience and recurrence as the initial density of particles increases, and we give the order of the transition up to a logarithmic factor.
We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments to analyze local functionals of the random tree such as the distribution of the length of the edges or the mean degree of the vertices. Far away from the origin, these local properties are shown to be close to those of a variant of the directed spanning tree introduced by Bhatt and Roy. We then use the theory of continuous state space Markov chains to analyz…
On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on $\mathbb{R}^d$. We examine the local weak convergence of the navigation tree, the asymptotic average of a functional along a path, the shape of the navigation tree and its topological ends. We illustrate our work in the small-world graphs where new results are established.
Under mild assumptions the equivalence of the mixed Poisson process with mixing parameter a real-valued random variable to the one with mixing distribution as well as to the mixed Poisson process in the sense of Huang is obtained, and a characterization of each one of the above mixed Poisson processes in terms of disintegrations is provided. Moreover, some examples of "canonical" probability spaces admitting counting processes satisfying the equivalence of all above statements are given. Finally, it is shown that our assumptions are essential for the characterization of mixed Poisson processes…
We investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary search tree. Using a representation in terms of mixed and compounded standard distributions, we derive approximations by Poisson and mixed Poisson distributions; these lead to asymptotic normality results. We are particularly interested in the influence of the key value on the distribution of the node depth. Methodologically our message is that the explicit representation may provide additional insight if compared to…
This paper deals with the construction of a correlation decay tree (hypertree) for interacting systems modeled using graphs (hypergraphs) that can be used to compute the marginal probability of any vertex of interest. Local message passing equations have been used for some time to approximate the marginal probabilities in graphs but it is known that these equations are incorrect for graphs with loops. In this paper we construct, for any finite graph and a fixed vertex, a finite tree with appropriately defined boundary conditions so that the marginal probability on the tree at the vertex matche…
Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point process with its nearest neighbour that is closer to the origin. For increasing intensity of the underlying Poisson point process the paper provides expectation and variance asymptotics as well as central limit theorems with rates of convergence for a class of edge functionals including the total edge length.
We derive mixing properties for a broad class of Poisson count time series satisfying a certain contraction condition. Using specific coupling techniques, we prove absolute regularity at a geometric rate not only for stationary Poisson-GARCH processes but also for models with an explosive trend. We provide easily verifiable sufficient conditions for absolute regularity for a variety of models including classical (log-)linear models. Finally, we illustrate the practical use of our results for hypothesis testing.
We consider the stable matching of two independent Poisson processes in $\mathbb{R}^d$ under an asymmetric color restriction. Blue points can only match to red points, while red points can match to points of either color. It is unknown whether there exists a choice of intensities of the red and blue processes under which all points are matched. We prove that for any fixed intensities, there are unmatched blue points in sufficiently high dimension. Indeed, if the ratio of red to blue intensities is $ρ$ then the intensity of unmatched blue points converges to $e^{-ρ}/(1+ρ)$ as $d\to\infty$. We a…
The genealogy at a single locus of a constant size $N$ population in equilibrium is given by the well-known Kingman's coalescent. When considering multiple loci under recombination, the ancestral recombination graph encodes the genealogies at all loci in one graph. For a continuous genome $G$, we study the tree-valued process $(T^N_u)_{u\in G}$ of genealogies along the genome in the limit $N\to\infty$. Encoding trees as metric measure spaces, we show convergence to a tree-valued process with cadlag paths. In addition, we study mixing properties of the resulting process for loci which are far a…
We prove existence and uniqueness of the invariant measure and exponential mixing in the total-variation norm for a class of stochastic differential equations driven by degenerate compound Poisson processes. In addition to mild assumptions on the distribution of the jumps for the driving process, the hypotheses for our main result are that the corresponding control system is dissipative, approximately controllable and solidly controllable. The solid controllability assumption is weaker than the well-known parabolic Hörmander condition and is only required from a single point to which the syste…
Using the Chen-Stein method, we show that the spatial distribution of large finite clusters in the supercritical FK model approximates a Poisson process when the ratio weak mixing property holds.
We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of Poisson boundaries by means of a topological compactification as developed by Kaimanovich. All the groups studied here share the property of admitting a sufficiently complicated action on some real tree.
We determine, to within O(1), the expected minimal position at level n in certain branching random walks. The walks under consideration have displacement vector (v_1,v_2,...), where each v_j is the sum of j independent Exponential(1) random variables and the different v_i need not be independent. In particular, our analysis applies to the Poisson-Dirichlet branching random walk and to the Poisson-weighted infinite tree. As a corollary, we also determine the expected height of a random recursive tree to within O(1).
We study invasion percolation on Aldous' Poisson-weighted infinite tree, and derive two distinct Markovian representations of the resulting process. One of these is the $σ\to\infty$ limit of a representation discovered by Angel et al. [Ann. Appl. Probab. 36 (2008) 420-466]. We also introduce an exploration process of a randomly weighted Poisson incipient infinite cluster. The dynamics of the new process are much more straightforward to describe than those of invasion percolation, but it turns out that the two processes have extremely similar behavior. Finally, we introduce two new "stationary"…
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 group, we prove almost sure convergence to a natural geometric boundary. If the probability law governing the random walk has finite first moment, then the probability space formed by this geometric boundary together with the limit distribution of the random walk is proved to be maximal, that is, the Poisson boundary. We also prove that the Dirichlet problem at …
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree and the random recursive tree (of total size $ n $) asymptotically has a Poisson distribution if $ k\rightarrow\infty $, and that the distribution is asymptotically normal for $ k=o(\sqrt{n}) $. Furthermore, we prove similar results for the number of subtrees of size $ k $ with some required property $ P $, for example the number of copies of a certain fixed s…
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n^2 steps are necessary and suffice for convergence to the stationary distribution.
We show that for all $ψ$-mixing shifts distributions of the numbers of multiple recurrencies to shrinking cylindrical neighborhoods of all points are close either to Poisson or to compound Poisson distributions. We also describe completely the asymptotic behavior of these distributions.
For a measure mu supported on a compact connected subset of a Euclidean space which satisfies a uniform d-dimensional decay of the volume of balls we show that the maximal edge in the minimum spanning tree of n indepndent samples from mu is, with high probability (log n/n)^(1/d).
Fast Mixing for Low-Temperature Potts Models via Poisson Trees
School of Computer Science, Georgia Institute of Technology（佐治亚理工学院计算机学院）；Department of Computer Science, University of Oxford（牛津大学计算机系）；Department of Computer Science, Durham University（杜伦大学计算机系）
Is there a constant $r_0$ such that, in any invariant tree network linking rate-$1$ Poisson points in the plane, the mean within-network distance between points at Euclidean distance $r$ is infinite for $r > r_0$? We prove a slightly weaker result. This is a continuum analog of a result of Benjamini et al (2001) on invariant spanning trees of the integer lattice.
We introduce a Poissonization method to study the coalescent structure of uniform samples from branching processes. This method relies on the simple observation that a uniform sample of size $k$ taken from a random set with positive Lebesgue measure may be represented as a mixture of Poisson samples with rate $λ$ and mixing measure $k \mathrm{d} λ/ λ$. We develop a multitype analogue of this mixture representation, and use it to characterise the coalescent structure of multitype continuous-state branching processes in terms of random multitype forests. Thereafter we study the small time asympt…
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 random measured $\R$-trees satisfying a natural scale invariance property. This has connections to exchangeable partially ordered sets, real-valued self-similar increasing processes and quasi-stationary distributions of Galton--Watson processes.
We investigate a basic immigration process where colonies grow, during a random time, according to a general counting process until collapse. Upon collapse a random amount of individuals survive. These survivors try independently establishing new colonies at neighbour sites. Here we consider this general process subject to two schemes, Poisson growth with geometric catastrophe and Yule growth with binomial catastrophe. Independent of everything else colonies growth, during an exponential time, as a Poisson (or Yule) process and right after that exponential time their size is reduced according …
The mixing time of the Glauber dynamics for spin systems on trees is closely related to reconstruction problem. Martinelli, Sinclair and Weitz established this correspondence for a class of spin systems with soft constraints bounding the log-Sobolev constant by a comparison with the block dynamics. However, when there are hard constraints, the block dynamics may be reducible. We introduce a variant of the block dynamics extending these results to a wide class of spin systems with hard constraints. This applies for essentially any spin system that has non-reconstruction provided that on average…
We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of trees we compute the mixing time, the relaxation time and the cutoff window.
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The genealogy of such a fragmentation is encoded by the so-called cut-tree, which was introduced by Bertoin and Miermont for a fragmentation of the Brownian continuum random tree. The cut-tree was generalised by Dieuleveut to a fragmentation of the $α$-stable trees, $α\in (1, 2)$, and by Broutin and Wang to the inhomogeneous continuum random trees of Aldous and Pitm…
We use a Voronoi-type tessellation based on a compound Poisson point process to construct a polynomially mixing stationary random smooth planar vector field with bounded nonnegative components such that, with probability one, none of the associated integral curves possess an asymptotic direction.
In this article we survey properties of mixed Poisson distributions and probabilistic aspects of the Stirling transform: given a non-negative random variable $X$ with moment sequence $(μ_s)_{s\in\mathbb{N}}$ we determine a discrete random variable $Y$, whose moment sequence is given by the Stirling transform of the sequence $(μ_s)_{s\in\mathbb{N}}$, and identify the distribution as a mixed Poisson distribution. We discuss properties of this family of distributions and present a simple limit theorem based on expansions of factorial moments instead of power moments. Moreover, we present several …
We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random matrices have real entries which are i.i.d. up to symmetry. The distributions may depend on N, however, the sums of rows must converge in distribution; it is then well-known that the limiting distributions are infinitely divisible. We show that a limiting empirical spectral distribution (LSD) exists, and via local weak convergence of associated graphs, the L…
