Add to ORKGAbstract. We show a special feature for the cover time of trees that is not satisfied by those of other graphs. By using this property, we show the relationship between the cover times of a tree and its subdivision, and we compute exactly the distribution of the last vertex visited by a random walk, the expectation and the Laplace transform of cover times of spider graphs as integral representations. We also discuss some comparison results for spider graphs
Consider the following stochastic process on a graph: initially all vertices are uncovered and at ea...
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time...
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simula...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス･フォア･イ...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
AbstractFor simple random walk on a finite tree, the cover time is the time taken to visit every ver...
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to h...
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
Let r 3 be integer, and let G r denote the set of r-regular graphs with vertex set V = f1; 2; : : ...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
We consider the cover time Eu [G], the expected time it takes a random walk that starts at u to visi...
AbstractIt is shown that if G is any connected graph on n vertices, then the cover time for random w...
Consider the following stochastic process on a graph: initially all vertices are uncovered and at ea...
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time...
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simula...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス･フォア･イ...
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graph...
AbstractFor simple random walk on a finite tree, the cover time is the time taken to visit every ver...
The cover time of a random walk on a finite graph is defined to be the number of steps it takes to h...
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random...
A simple random walk on a graph is a sequence of movements from one vertex to another where at each ...
This thesis is a contribution to the covering times problems for random walks on graphs. By consider...
This thesis studies the cover time of random walks on finite connected graphs. Work contains the der...
Let r 3 be integer, and let G r denote the set of r-regular graphs with vertex set V = f1; 2; : : ...
ABSTRACT: Motivated by applications in Markov estimation and distributed computing, we define the bl...
We consider the cover time Eu [G], the expected time it takes a random walk that starts at u to visi...
AbstractIt is shown that if G is any connected graph on n vertices, then the cover time for random w...
Consider the following stochastic process on a graph: initially all vertices are uncovered and at ea...
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time...
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simula...