Timeline for 2 Random Walkers on 2d square lattice, Torus
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 20, 2016 at 16:46 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Nov 21, 2016 at 3:51 | comment | added | alezok | Note that you may need some additional assumptions depending on the sizes of the toric square lattice. For instance, on the 2d discrete $2n$x$2m$ torus, which is a bipartite graph, the two random walkers can meet only if they start on vertices of the same parity (or if they have a non-zero probability of not jumping). | |
Nov 20, 2016 at 15:53 | history | edited | Manfred Weis | CC BY-SA 3.0 |
fixed a typo in the title
|
Nov 20, 2016 at 15:48 | answer | added | Salsifis | timeline score: 1 | |
Nov 15, 2016 at 18:38 | comment | added | Klara.D | Thank You for your question. Be at the same location at time t. | |
Nov 15, 2016 at 18:10 | comment | added | Serguei Popov | Just to be sure: you mean "meet for the first time at time $t$", or "be at the same location at time $t$"? | |
Nov 15, 2016 at 16:43 | comment | added | Klara.D | I am supposing that they start at (x1,y1) and (x2,y2) on my square lattice. They do a discrete time random walk. and they are doing a simple random walk so they hop to their neighboring sites with equal probabilities. | |
Nov 15, 2016 at 9:20 | comment | added | Liviu Nicolaescu | Like @znt said, you need to give more details if you expect a precise answer. Is is a discrete time random walk, or is it a continuous time random walk. In either case you need to give more details about the transition probabilities. | |
Nov 15, 2016 at 7:38 | comment | added | znt | Surely you need to say the initial probability distribution of where they start, if you want to work out the probability of when something else (that depends on where they start) happens. | |
Nov 15, 2016 at 7:31 | history | asked | Klara.D | CC BY-SA 3.0 |