Timeline for Graph with Poisson Clock at each Vertex
Current License: CC BY-SA 3.0
36 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2017 at 8:26 | vote | accept | co.sine | ||
| S Apr 7, 2017 at 5:24 | history | bounty ended | co.sine | ||
| S Apr 7, 2017 at 5:24 | history | notice removed | co.sine | ||
| Apr 5, 2017 at 12:27 | answer | added | domotorp | timeline score: 5 | |
| Apr 5, 2017 at 12:17 | history | edited | domotorp | CC BY-SA 3.0 |
I've acknowledged myself
|
| Apr 2, 2017 at 10:18 | history | edited | co.sine | CC BY-SA 3.0 |
added 158 characters in body
|
| S Apr 1, 2017 at 13:36 | history | bounty started | co.sine | ||
| S Apr 1, 2017 at 13:36 | history | notice added | co.sine | Draw attention | |
| Mar 29, 2017 at 6:00 | comment | added | co.sine | @Todd: Apologize, totally my bad. Guess I got too enthusiastic about getting an answer. | |
| Mar 25, 2017 at 13:44 | comment | added | Todd Trimble | Okay, a flag was raised over the entirely unnecessary edits. Please don't do that, as this bumps other questions off the front page which also deserve consideration. | |
| Mar 25, 2017 at 12:46 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 25, 2017 at 6:07 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 25, 2017 at 4:52 | history | edited | co.sine | CC BY-SA 3.0 |
added 2 characters in body
|
| Mar 24, 2017 at 18:26 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 24, 2017 at 15:14 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 24, 2017 at 6:00 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 23, 2017 at 19:14 | history | edited | co.sine | CC BY-SA 3.0 |
added 2 characters in body
|
| Mar 23, 2017 at 6:22 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 21, 2017 at 9:30 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 20, 2017 at 10:37 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 20, 2017 at 1:55 | answer | added | Ryan O'Donnell | timeline score: 2 | |
| Mar 19, 2017 at 15:15 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 19, 2017 at 6:45 | history | edited | co.sine | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 18, 2017 at 18:20 | history | edited | co.sine | CC BY-SA 3.0 |
added 93 characters in body
|
| Mar 18, 2017 at 8:56 | history | edited | co.sine | CC BY-SA 3.0 |
added 13 characters in body
|
| Mar 18, 2017 at 7:09 | history | edited | co.sine | CC BY-SA 3.0 |
added 349 characters in body
|
| Dec 23, 2016 at 14:48 | comment | added | domotorp | Pick a vertex $v$ and let the value at each vertex equal $(-1)^d$ where $d$ is its distance from $v$. In phase $i$ all vertices at distance $i$ are updated, then all vertices at distance $i-1$ and so on, until $v$. | |
| Dec 23, 2016 at 10:13 | comment | added | co.sine | @domotorp: what is the example on an infinite $3$-regular tree, where a deterministic sequence of updates leads to infinitely many changes at a vertex? | |
| Dec 16, 2016 at 10:03 | comment | added | domotorp | @Kevin: It's easy to give such an example on an infinite $3$-regular tree. I don't know whether this is an example to the original question. In any frozen configuration each constant-valued component most be infinite. | |
| Dec 16, 2016 at 10:01 | comment | added | domotorp | This model seems to be very similar to the Glauber dynamics of the Ising model. | |
| Dec 16, 2016 at 9:34 | comment | added | domotorp | @Anthony: Why couldn't the system freeze in some other state? I think if everyone has a neighbor with whom it shares its value, then there are no more changes. | |
| Dec 16, 2016 at 8:51 | comment | added | Anthony Quas | This is an example of a voter model. I know that the answer is yes for the synchronous voter model (where all clocks tick once per second). Indeed: take $\mathbb Z$ with a uniform i.i.d. distribution of $\pm 1$ at the vertices. Then the set of configurations that converge to all 1's is invariant (so of measure 0 or 1); ditto for the configurations that converge to all $-1$'s. By symmetry, they are both of measure 0. From this, it follows that almost surely, each vertex oscillates infinitely often. | |
| Dec 16, 2016 at 7:36 | comment | added | Kevin P. Costello | Is there an easy example of a graph and a deterministic sequence of updates on it that would cause a vertex to change values infinitely often? | |
| Dec 16, 2016 at 7:26 | comment | added | user83457 | On a circle let plus and minus alternate. then no one will ever decide to change. | |
| Dec 16, 2016 at 6:55 | review | First posts | |||
| Dec 16, 2016 at 7:19 | |||||
| Dec 16, 2016 at 6:53 | history | asked | co.sine | CC BY-SA 3.0 |