✦ LIBER ✦

Centers for Random Walks on Trees

✍ Scribed by Beveridge, Andrew

Book ID: 118196984
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 272 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/070687402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks on trees

✍ Lynn Hauser Pearce 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 267 KB

The classical gambler's ruin problem, i.e., a random walk along a line may be viewed q raph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an i0vestigation of the natural generalization of this problem to that of a particle walking randomly on a tre

Branching random walks on trees

✍ Neal Madras; Rinaldo Schinazi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 757 KB

Biased random walks on directed trees

✍ Christiane Takacs 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 250 KB

The type problem for random walks on tre

The type problem for random walks on trees

✍ Mokhtar Konsowa; Joanna Mitro 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 692 KB

Extremal cover times for random walks on

Extremal cover times for random walks on trees

✍ Graham Brightwell; Peter Winkler 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract Let __C~ν~__(__T__) denote the “cover time” of the tree __T__ from the vertex __v__, that is, the expected number of steps before a random walk starting at __v__ hits every vertex of __T.__ Asymptotic lower bounds for __C~ν~__(__T__) (for __T__ a tree on __n__ vertices) have been obtain

Anisotropic branching random walks on ho

Anisotropic branching random walks on homogeneous trees

✍ Irene Hueter; Steven P. Lalley 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 188 KB