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

Authors

797

  1. YP
    Yuval Peres

    Microsoft (United States), United States

    16 publications · 1K citations

    15

    h-index

  2. IB
    Itaï Benjamini

    Weizmann Institute of Science, Israel

    13 publications · 545 citations

    11

    h-index

  3. GF
    Gregory F. Lawler

    Duke University, United States

    11 publications · 423 citations

    11

    h-index

  4. WW
    Wolfgang Woess

    Graz University of Technology, Austria

    8 publications · 324 citations

    8

    h-index

  5. AS
    Allan Sly

    University of California, Berkeley, United States

    7 publications · 289 citations

    7

    h-index

1–5 of 797

Venues

  1. The Annals of Probability

    58 publications · 3.2K citations

    29

    h-index

  2. Electronic Journal of Probability

    EJP · 35 publications · 1.2K citations

    23

    h-index

  3. Journal of Physics A Mathematical and General

    17 publications · 1K citations

    14

    h-index

  4. Journal of Applied Probability

    JAP · 13 publications · 813 citations

    12

    h-index

  5. The Journal of Chemical Physics

    11 publications · 1.4K citations

    11

    h-index

1–5