Continuous Time Markov Processes on Graphs
From MaRDI portal
Abstract: 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 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.
Recommendations
- Markov processes on time-like graphs
- scientific article; zbMATH DE number 3907513
- Publication:4940356
- Continuous-time independent edge-Markovian random graph process
- scientific article; zbMATH DE number 6450685
- Markov chains on graphs and Brownian motion
- On a class of continuous-time Markov processes
- Markov Graphs
- On the Markov property of local time for Markov processes on graphs
Cites work
- Hitting times for random walks on vertex-transitive graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 417052 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- The coalescent
Cited in
(11)- Gaussian Markov distributions over finite graphs
- Modeling of an asymptotically central Markov process on 3D Young graph
- A historical perspective of Tian's evolution algebras
- Invitation to research of new mathematics from biology: Evolution algebras
- scientific article; zbMATH DE number 3907513 (Why is no real title available?)
- Mathematical tools for the future: graph theory and graphicable algebras
- Filtering Random Graph Processes Over Random Time-Varying Graphs
- IPA for continuous stochastic marked graphs
- scientific article; zbMATH DE number 6450685 (Why is no real title available?)
- Markov chains on graphs and Brownian motion
- Coalescent random walks on graphs
This page was built for publication: Continuous Time Markov Processes on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423721)