Definition 1 (Recurrence and Transience). A simple random walk {xn : n ≥ 0} on a graph X is said to be recurrent if almost surely it visits ...
確定！ 回上一頁
