Related papers: Nonamenable Poisson zoo

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of…

We consider free multiple stochastic measures in the combinatorial framework of the lattice of all diagonals of an n-dimensional space. In this free case, one can restrict the analysis to only the noncrossing diagonals. We give definitions…

We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that…

The Poisson gauge theory is a semi-classical limit of full non-commutative gauge theory. In this work we construct an L$_\infty^{full}$ algebra which governs both the action of gauge symmetries and the dynamics of the Poisson gauge theory.…

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is…

Let $Y$ be a nonnegative random variable with mean $\mu$ and finite positive variance $\sigma^2$, and let $Y^s$, defined on the same space as $Y$, have the $Y$ size biased distribution, that is, the distribution characterized by…

Estimating the size of an elusive target population is of prominent interest in many areas in the life and social sciences. Our aim is to provide an efficient and workable method to estimate the unknown population size, given the frequency…

We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birth-and-death processes. Examples include area- and…

We study first-passage percolation (FPP) on the square lattice. The model is defined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the nearest neighbor edges of $\mathbb{Z}^2$. The passage time between vertices $x$ and…

Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…

We show that the random point measures induced by vertices in the convex hull of a Poisson sample on the unit ball, when properly scaled and centered, converge to those of a mean zero Gaussian field. We establish limiting variance and…

We consider general classes of lattice clusters, including various kinds of animals and trees on different lattices. We prove that if a given local configuration ("pattern") of sites and bonds can occur in large clusters, then it occurs at…

This work considers the distribution of inertial particles in turbulence using the point-particle approximation. We demonstrate that the random point process formed by the positions of particles in space is a Poisson point process with…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

We demonstrate, with a concrete example, how the combinatorial approach to a general system of particles, which was introduced in detail in the earlier paper arXiv:1205.4986, works and where it enters to provide a genuine extension of…

We examine the percolation model on $\mathbb{Z}^d$ by an approach involving lattice animals and their surface-area-to-volume ratio. For $\beta \in [0,2(d-1))$, let $f(\beta)$ be the asymptotic exponential rate in the number of edges of the…

We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the…

A random field $X = (X_v)_{v \in G}$ on a quasi-transitive graph $G$ is a factor of i.i.d. if it can be written as $X=\varphi(Y)$ for some i.i.d. process $Y= (Y_v)_{v \in G}$ and equivariant map $\varphi$. Such a map, also called a coding,…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…