Lipschitz embeddings of random sequences

DOI10.1007/s00440-013-0519-7zbMath1327.60180arXiv1204.2931OpenAlexW1971206237MaRDI QIDQ398782

Allan Sly, Riddhipratim Basu

Publication date: 15 August 2014

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.2931

zbMATH Keywords

percolationrandom sequencesPoisson processesLipschitz embeddingBernoulli sequencecompatible sequencesrough isometry

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (7)

Lipschitz embeddings of random fields ⋮ Dependent percolation on \(\mathbb{Z}^2\) ⋮ Scheduling of Non-Colliding Random Walks ⋮ On the Compatibility of Binary Sequences ⋮ Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\) ⋮ Harry Kesten's work in probability theory ⋮ Oriented percolation in a random environment

Cites Work

• Unnamed Item
• Unnamed Item
• Geometry of Lipschitz percolation
• Plaquettes, spheres, and entanglement
• Lattice embeddings in percolation
• Rough isometries, and combinatorial approximations of geometries of non- compact Riemannian manifolds
• Lipschitz percolation
• On rough isometries of Poisson processes on the line
• Almost all words are seen in critical site percolation on the triangular lattice
• Dependent percolation in two dimensions
• Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
• Oriented percolation in a random environment
• Stochastic domination and comb percolation
• Percolation of arbitrary words in one dimension
• Three problems for the clairvoyant demon
• Percolation of Words on Z^d with Long-Range Connections
• Collisions Among Random Walks on a Graph
• Clairvoyant embedding in one dimension
• Less than continuum many translates of a compact nullset may cover any infinite profinite group
• Compatible Sequences and a Slow Winkler Percolation
• Clairvoyant scheduling of random walks
• On the Compatibility of Binary Sequences
• Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)

This page was built for publication: Lipschitz embeddings of random sequences