𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Annihilating and coalescing random walks on ℤd

✍ Scribed by David Griffeath

Publisher
Springer
Year
1978
Tongue
English
Weight
553 KB
Volume
46
Category
Article
ISSN
1432-2064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random nearest neighbor and influence gr
Random nearest neighbor and influence graphs on Zd
✍ S. Nanda; C. M. Newman 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

Random nearest neighbor and influence graphs with vertex set Z d are defined and their percolation properties are studied. The nearest neighbor graph has (with probability 1) only finite connected components and a superexponentially decaying connectivity function. Influence graphs (which are related

Random walks on random simple graphs
Random walks on random simple graphs
✍ Martin Hildebrand 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 676 KB

This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou

Characters and Random Walks on Finite Cl
Characters and Random Walks on Finite Classical Groups
✍ David Gluck 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Let G be a finite group and E a generating set for G. Let P be a probability measure on G whose support is E. We define a random walk on G as follows. At the zeroth stage, we set w 0 =1. At the k th stage, we set w k =w k&1 x, where x # E is chosen with probability P(x). For g # G, the probability t