Sciweavers

15 search results - page 1 / 3
» Stationary distribution and cover time of random walks on ra...
Sort
View
CORR
2011
Springer
184views Education» more  CORR 2011»
12 years 11 months ago
Stationary distribution and cover time of random walks on random digraphs
We study properties of a simple random walk on the random digraph Dn,p when
Colin Cooper, Alan M. Frieze
APPROX
2007
Springer
141views Algorithms» more  APPROX 2007»
13 years 10 months ago
The Cover Time of Random Digraphs
We study the cover time of a random walk on the random digraph Dn,p when np =
Colin Cooper, Alan M. Frieze
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
13 years 10 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
ISTCS
1993
Springer
13 years 8 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 6 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...