Random Walks
Simple and biased walks, hitting times, and Green's functions.
Random Walks. Simple and biased walks, hitting times, and Green’s functions. This page collects canonical references that organise the subject and provide entry points to its main techniques.
Foundations and canonical references
The standard treatments of random walks approach the subject from complementary angles. Doyle, Random Walks and Electric Networks (1984) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to.
Open methodological questions for random walks include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 1984Random Walks and Electric Networksdoyle-1984, snell-1984
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.