Add to ORKGWe consider the cover time of a discrete-time homogenous Markov chain, that is the time needed by the Markov chain to visit all its states. We analyze both the distribution and the moments of the cover time and we are interested in exact results instead of asymptotic values of the mean cover time which are generally considered in the literature. We first obtain several general results on the hitting time and the cover time of a subset of the state space both in terms of distribution and moments. These results are then applied to particular graphs namely the generalized cycle graph, the complete graph and the generalized path graph. They lead to recurrence or analytic relations for the distribution and the mean value of their cover times
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
The cover time of a Markov chain on a finite state space is the expected time until all states are v...
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random...
We consider the cover time of a discrete-time homogenous Markov chain, that is the time needed by th...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to h...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
We consider a Markov chain on a finite state space and obtain an expression of the joint distributio...
AbstractA method is described for calculating the mean cover time for a particle performing a simple...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
AbstractFeige and Rabinovich, in [Feige and Rabinovich, Rand. Struct. Algorithms 23(1) (2003) 1–22],...
AbstractGiven a finite graph G=(V,E) and a probability distribution π=(πv)v∈V on V, Metropolis walks...
Eyal Lubetzky‡ We study the cover time of a random graph chosen uniformly at random from the set of ...
International audienceIn this paper we establish the cover time of a random graph $G(\textbf{d})$ ch...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
The cover time of a Markov chain on a finite state space is the expected time until all states are v...
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random...
We consider the cover time of a discrete-time homogenous Markov chain, that is the time needed by th...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to h...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
We consider a Markov chain on a finite state space and obtain an expression of the joint distributio...
AbstractA method is described for calculating the mean cover time for a particle performing a simple...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
AbstractFeige and Rabinovich, in [Feige and Rabinovich, Rand. Struct. Algorithms 23(1) (2003) 1–22],...
AbstractGiven a finite graph G=(V,E) and a probability distribution π=(πv)v∈V on V, Metropolis walks...
Eyal Lubetzky‡ We study the cover time of a random graph chosen uniformly at random from the set of ...
International audienceIn this paper we establish the cover time of a random graph $G(\textbf{d})$ ch...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
The cover time of a Markov chain on a finite state space is the expected time until all states are v...
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random...