Lipschitz embeddings of random sequences
From MaRDI portal
Abstract: We develop a new multi-scale framework flexible enough to solve a number of problems involving embedding random sequences into random sequences. Grimmett, Liggett and Richthammer asked whether there exists an increasing M-Lipschitz embedding from one i.i.d. Bernoulli sequences into an independent copy with positive probability. We give a positive answer for large enough M. A closely related problem is to show that two independent Poisson processes on R are roughly isometric (or quasi-isometric). Our approach also applies in this case answering a conjecture of Szegedy and of Peled. Our theorem also gives a new proof to Winkler's compatible sequences problem.
Recommendations
Cites work
- scientific article; zbMATH DE number 3732851 (Why is no real title available?)
- scientific article; zbMATH DE number 1416163 (Why is no real title available?)
- Almost all words are seen in critical site percolation on the triangular lattice
- Clairvoyant embedding in one dimension
- Clairvoyant scheduling of random walks
- Collisions Among Random Walks on a Graph
- Compatible Sequences and a Slow Winkler Percolation
- Dependent percolation in two dimensions
- Geometry of Lipschitz percolation
- Lattice embeddings in percolation
- Less than continuum many translates of a compact nullset may cover any infinite profinite group
- Lipschitz percolation
- On rough isometries of Poisson processes on the line
- On the Compatibility of Binary Sequences
- Oriented percolation in a random environment
- Percolation of Words on Zd with Long-Range Connections
- Percolation of arbitrary words in \(\{0, 1\}^ \mathbb{N}\)
- Percolation of arbitrary words in one dimension
- Percolation of arbitrary words on the close-packed graph of \(\mathbb{Z}^2\)
- Plaquettes, spheres, and entanglement
- Rough isometries, and combinatorial approximations of geometries of non- compact Riemannian manifolds
- Stochastic domination and comb percolation
- Three problems for the clairvoyant demon
Cited in
(11)- Dependent percolation on \(\mathbb{Z}^2\)
- On the Compatibility of Binary Sequences
- Random ε-nets and embeddings in lN∞
- Oriented percolation in a random environment
- Compatible sequences and a slow Winkler percolation
- Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)
- Lipschitz embeddings of random fields
- Harry Kesten's work in probability theory
- Clairvoyant embedding in one dimension
- Scheduling of non-colliding random walks
- Random embedding of \({\ell_p^n}\) into \({\ell_r^N}\)
This page was built for publication: Lipschitz embeddings of random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398782)