Simple Random Walk
A Simple Random Walk is a stochastic process on a graph or lattice in which each step is determined by a random transition to one of the adjacent vertices, with all allowable directions having equal probability, thus distinguishing it from other random walks by its uniform step distribution and lack of memory.
521
Publications
29.5K
Citations
797
Authors
441
Institutions
Publications per year
2017–2026
74
Parents
521
Elliott W. Montroll, George H. Weiss · Journal of Mathematical Physics · 1965 · 2.8K citations
A Test for Superior Predictive Ability
Peter Reinhard Hansen · Journal of Business and Economic Statistics · 2005 · 1.2K citations · Full text
Random walks, universal traversal sequences, and the complexity of maze problems
Romas Aleliunas, Richard M. Karp, Richard J. Lipton et al. · 1979 · 705 citations
MCMC Using Hamiltonian Dynamics
Radford M. Neal · 2011 · 542 citations · Full text
1–5 of 521
797
15
h-index
11
h-index
11
h-index
8
h-index
7
h-index
1–5 of 797
441

Weizmann Institute of Science
Rehovot, Israel
15 h-index
33 publications
1.7K citations
University of California, Berkeley
Berkeley, United States
15 h-index
30 publications
3K citations

University of British Columbia
Vancouver, Canada
14 h-index
27 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
13 h-index
31 publications
972 citations
University of Cambridge
Cambridge, United Kingdom
13 h-index
25 publications
901 citations
Université Paris Cité
Paris, France
11 h-index
18 publications
448 citations

Cornell University
Ithaca, United States
11 h-index
16 publications
1.3K citations

Sorbonne Université
Paris, France
11 h-index
14 publications
270 citations
1–8 of 441
58 publications · 3.2K citations
29
h-index
EJP · 35 publications · 1.2K citations
23
h-index
17 publications · 1K citations
14
h-index
JAP · 13 publications · 813 citations
12
h-index
11 publications · 1.4K citations
11
h-index
1–5