Greedy Random Walk

Details Greedy Random Walk Greedy Random Walk

2011-01-29

arxiv.org/abs/1101.5711v3

Mathematics

Probability

Major revision in the presentation of the results

Scientific paper

In this paper we consider a discrete time self interacting random process,
called greedy random walk. For certain natural families of finite graphs it is
shown that the expected edge cover time of the greedy random walk is
asymptotically smaller than that of the simple random walk. For infinite graphs
some results regarding transience are presented.

Affiliated with

Also associated with

No associations

Rating

Greedy Random Walk does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy Random Walk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Random Walk will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573560