✦ LIBER ✦

Discrete Greenʼs functions and random walks on graphs

✍ Scribed by Xu, Hao; Yau, Shing-Tung

Book ID: 118271628
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 246 KB
Volume: 120
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2012.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Note on discrete random walks

✍ S. Foldes; G. Gabor 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Random walks on discrete cylinders and r

Random walks on discrete cylinders and random interlacements

✍ Alain-Sol Sznitman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 403 KB

Combinatorial Greenʼs function of a grap

Combinatorial Greenʼs function of a graph and applications to networks

✍ Woong Kook 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Random walks on highly symmetric graphs

✍ Luc Devroye; Amine Sbihi 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 620 KB

Random walks on diestel-leader graphs

✍ D. Bertacchi 📂 Article 📅 2001 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 825 KB