Add to ORKGFor random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting times. Proofs exploit the complete monotonicity properties of the associated continuous-time walk. © 1989, Cambridge Philosophical Society. All rights reserved
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
We consider the activated random walk model on general vertextransitive graphs. A central question i...
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as th...
We find explicit values for the expected hitting times between neighboring vertices of random walks ...
Consider the random walk on graphs such that, at each step, the next visited vertex is a neighbor of...
International audienceConsider the random walk on graphs such that, at each step, the next visited v...
AbstractIt is known that for a random walk on a connected graph G on N vertices {xl,…,xN} satisfying...
AbstractStandard random walks on finite graphs select the vertex visited next to the adjacent vertic...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
We study random walks on trees, where we iteratively move from one vertex to a randomly chosen adjac...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
We derive a closed-form formula for the expected hitting times of general random walks on trees with...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
AbstractIn this paper, using the theory of matrix algebra, we obtain a new expression for the expect...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
We consider the activated random walk model on general vertextransitive graphs. A central question i...
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as th...
We find explicit values for the expected hitting times between neighboring vertices of random walks ...
Consider the random walk on graphs such that, at each step, the next visited vertex is a neighbor of...
International audienceConsider the random walk on graphs such that, at each step, the next visited v...
AbstractIt is known that for a random walk on a connected graph G on N vertices {xl,…,xN} satisfying...
AbstractStandard random walks on finite graphs select the vertex visited next to the adjacent vertic...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
We study random walks on trees, where we iteratively move from one vertex to a randomly chosen adjac...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
We derive a closed-form formula for the expected hitting times of general random walks on trees with...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
AbstractIn this paper, using the theory of matrix algebra, we obtain a new expression for the expect...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
We consider the activated random walk model on general vertextransitive graphs. A central question i...