scholarly journals A Simple proof of a Known Result in Random Walk Theory

1974 ◽  
Vol 2 (2) ◽  
pp. 347-348
Author(s):  
Austin J. Lemoine
Keyword(s):  
Random Walk ◽  
Simple Proof ◽  
Random Walk Theory

Electrochemical random-walk theory

2011 ◽  
Vol 655 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Ian J. Cutress ◽  
Edmund J.F. Dickinson ◽  
Richard G. Compton
Keyword(s):  
Random Walk ◽  
Random Walk Theory

On a Result of Aleliunas et al. Concerning Random Walks on Graphs

1990 ◽  
Vol 4 (4) ◽  
pp. 489-492 ◽  
Author(s):  
José Luis Palacios
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Simple Proof ◽  
Hitting Times ◽  
Initial State ◽  
Random Walks On Graphs ◽  
Minimum Number

Aleliunas et al. [3] proved that for a random walk on a connected raph G = (V, E) on N vertices, the expected minimum number of steps to visit all vertices is bounded by 2|E|(N - 1), regardless of the initial state. We give here a simple proof of that result through an equality involving hitting times of vertices that can be extended to an inequality for hitting times of edges, thus obtaining a bound for the expected minimum number of steps to visit all edges exactly once in each direction.

A novel identity from random walk theory

1998 ◽  
Vol 260 (3-4) ◽  
pp. 425-429
Author(s):  
D.R. Franceschetti ◽  
J.W. Hanneken
Keyword(s):  
Random Walk ◽  
Random Walk Theory
Sign in / Sign up

Export Citation Format

Share Document