scientific article; zbMATH DE number 1416163

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(200001)16:1<58::AID-RSA5>3.0.CO;2-E" /><58::AID-RSA5>3.0.CO;2-E 10.1002/(SICI)1098-2418(200001)16:1<58::AID-RSA5>3.0.CO;2-EzbMath0947.60056MaRDI QIDQ4943354

Peter M. Winkler

Publication date: 1 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random walkcollisionfinite-state Markov chainword percolation

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (18)

Lipschitz embeddings of random fields ⋮ Strict inequality for bond percolation on a dilute lattice with columnar disorder ⋮ Clairvoyant embedding in one dimension ⋮ Clairvoyant scheduling of random walks ⋮ Lipschitz embeddings of random sequences ⋮ Avoidance couplings on non‐complete graphs ⋮ Dependent percolation on \(\mathbb{Z}^2\) ⋮ Scheduling of Non-Colliding Random Walks ⋮ Bernoulli hyperplane percolation ⋮ Corner percolation on \(\mathbb Z^{2}\) and the square root of 17 ⋮ On the Compatibility of Binary Sequences ⋮ Random walks on a complete graph: a model for infection ⋮ Percolation of arbitrary words in one dimension ⋮ Bernoulli line percolation ⋮ Percolation of Words on Z^d with Long-Range Connections ⋮ Oriented percolation in a random environment ⋮ Phase transition in dependent percolation ⋮ Percolation and disorder-resistance in cellular automata

Cites Work

• Collisions Among Random Walks on a Graph
• An Extension of Foster's Network Theorem
• Unnamed Item

This page was built for publication: