English
Related papers

Related papers: Nonamenable Poisson zoo

200 papers

Motivated, in part, by the desire to develop an information-theoretic foundation for compound Poisson approximation limit theorems (analogous to the corresponding developments for the central limit theorem and for simple Poisson…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Ioannis Kontoyiannis , Mokshay Madiman

Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…

Probability · Mathematics 2025-07-23 Michal Bassan , Serte Donderwinkel , Brett Kolesnik

The first passage statistics of a continuous time random walker with Poisson distributed jumps on one and two dimensional infinite lattices is investigated. An exact expression for the probability of first return to the origin in one…

Statistical Mechanics · Physics 2022-06-13 Stephy Jose

We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value,…

Networking and Internet Architecture · Computer Science 2008-07-18 Amitabha Bagchi , Sohit Bansal

We investigate the extremal process of four-dimensional membrane models as the size of the lattice $N$ tends to infinity. We prove the cluster-like geometry of the extreme points and the existence as well as the uniqueness of the extremal…

Probability · Mathematics 2025-07-29 Hao Ge , Xinyi Li , Jiaxi Zhao

Inspired by R. Speicher's multidimensional free central limit theorem and semicircle families, we prove an infinite dimensional compound Poisson limit theorem in free probability, and define infinite dimensional compound free Poisson…

Operator Algebras · Mathematics 2017-12-19 Guimei An , Mingchu Gao

Using Malliavin operators together with an interpolation technique inspired by Arratia, Goldstein and Gordon (1989), we prove a new inequality on the Poisson space, allowing one to measure the distance between the laws of a general random…

Probability · Mathematics 2014-09-05 Solesne Bourguin , Giovanni Peccati

In this work, we conduct a systematic study of Hamiltonian and quasi-Hamiltonian systems within the framework of nondecomposable generalized Poisson geometry. Our focus lies on the interplay between the algebraic structure of…

Mathematical Physics · Physics 2025-10-10 C. Sardón , X. Zhao

We show under weak hypotheses that $\partial X$, the Roller boundary of a finite dimensional CAT(0) cube complex $X$ is the Furstenberg-Poisson boundary of a sufficiently nice random walk on an acting group $\Gamma$. In particular, we show…

Group Theory · Mathematics 2015-07-21 Talia Fernós

We consider convergence properties of the long-term behaviors with respect to the coefficient of the stochastic term for a nonautonomous stochastic $p$-Laplacian lattice equation with multiplicative noise. First, the upper semi-continuity…

Probability · Mathematics 2024-12-16 Jintao Wang , Qinghai Peng , Chunqiu Li

Lattice gauge theories are a powerful language to theoretically describe a variety of strongly correlated systems, including frustrated magnets, high-$T_c$ superconductors, and topological phases. However, in many cases gauge fields couple…

Strongly Correlated Electrons · Physics 2017-11-07 Christian Prosko , Shu-Ping Lee , Joseph Maciejko

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

Probability · Mathematics 2016-11-15 Deepan Basu , Artem Sapozhnikov

We study Gaussian concentration inequalities for random fields obtained as finitary codings of i.i.d.\ fields, linking concentration properties to coding structure. A finitary coding represents a dependent field as a shift-equivariant image…

Probability · Mathematics 2026-03-27 J. -R. Chazottes , S. Gallo , D. Takahashi

We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…

Probability · Mathematics 2007-05-23 Ronald Meester

We construct a simple multicomponent lattice gas model in one dimension in which each site can either be empty or occupied by at most one particle of any one of $D$ species. Particles interact with a nearest neighbor interaction which…

High Energy Physics - Phenomenology · Physics 2009-10-22 T. Wettig , A. D. Jackson

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

We study harmonic functions and Poisson boundaries for Borel probability measures on general (i.e., not necessarily locally compact) topological groups, and we prove that a second-countable topological group is amenable if and only if it…

Functional Analysis · Mathematics 2020-12-23 Friedrich Martin Schneider , Andreas Thom

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…

Information Theory · Computer Science 2018-06-26 Antonio Campello , Daniel Dadush , Cong Ling

We consider pairs (X,Y) where X is a compact, locally CAT(-1) space, and Y is a totally geodesic subspace. The inclusion induces an embedding of the boundaries at infinity of the universal covers; we focus on the case where these are…

Geometric Topology · Mathematics 2008-11-10 F. T. Farrell , J. -F. Lafont

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

Probability · Mathematics 2022-04-26 Louigi Addario-Berry , Anna Brandenberger , Jad Hamdan , Céline Kerriou