Timeline for First hit time in a graph setting
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2013 at 20:03 | comment | added | Anthony Quas | Oops... didn't see the $\mu_i$'s... | |
| Feb 4, 2013 at 19:45 | comment | added | Ori Gurel-Gurevich | First passage percolation is when $\mu_i=0$, i.e. when there's no 1 to 0 transition. The process described in the question is called the contact process. | |
| Feb 4, 2013 at 19:28 | comment | added | Anthony Quas | Your setting just is exactly a reformulation of first passage percolation (not just percolation). If the graph has a regular structure (like $\mathbb Z^d$), lots of asymptotic information is known about the expected hitting time. If you just want a number for a less regular graph, I've no idea about how to actually compute the hitting time, other than brute force. You might also look up the Richardson model. | |
| Feb 4, 2013 at 17:07 | comment | added | Bravo | Thanks Anthony. I did look into percolation problems which had a similar structure with the $\lambda$s on the edges, but the concept of nodes going from 1 to 0 at $\mu$s seemed to be absent in that formulation. Could you please lead me to a more specific setting? | |
| Feb 4, 2013 at 17:01 | history | answered | Anthony Quas | CC BY-SA 3.0 |