Continuous Time Markov Processes on Graphs

Details Continuous Time Markov Processes on Graphs Continuous Time Markov Processes on Graphs

2004-10-12

arxiv.org/abs/math/0410298v1

Mathematics

Probability

18 pages

Scientific paper

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study ``multi-person simple random walks'' on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this discrete time Markov process, we randomly pick up a person and move it to a random adjacent vertex. We give estimate on the expected number of steps for these $n$ persons to meet all together at a specific vertex, given that they are at different vertices at the begininng. For regular graphs, our estimate is exact.

Affiliated with

Also associated with

No associations

Rating

Continuous Time Markov Processes on Graphs 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 Continuous Time Markov Processes on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuous Time Markov Processes on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136683