Timeline for Locally randomizing a path on a graph
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2017 at 15:04 | vote | accept | aellab | ||
| May 10, 2017 at 12:11 | answer | added | Szabolcs | timeline score: 4 | |
| May 10, 2017 at 8:39 | history | edited | aellab | CC BY-SA 3.0 |
added 318 characters in body
|
| May 10, 2017 at 8:38 | comment | added | aellab | Dear @Szabolcs, I don't think that is the main issue; you can find an algorithm for all shortest paths here mathematica.stackexchange.com/questions/4128/…. The issue I am struggling with is integration, since I am not familiar withe Mathematica's syntax. I am not sure how to utilize the algorithm in e.g. the linked answer to randomly choose one of these paths! (In retrospect I will edit my post to include this helpful link.) | |
| May 10, 2017 at 8:36 | comment | added | Szabolcs |
I suggest to rewrite your question and focus on the main issue: How to find all shortest paths between two vertices? Show an example graph with multiple shortest paths between the same two vertices (but something more complex than CycleGraph[4])
|
|
| May 10, 2017 at 7:33 | comment | added | aellab | I have a walk $v_1 \ldots v_i v_{i+1} \ldots v_j \ldots v_n$. I want to generate a new walk, $v_1 \ldots v_i u_{i+1} u_{i+2} \ldots u_{j-1} v_j \ldots v_n$, where $u_{i+1} \ldots u_{j-1}$ is the shortest path from $v_i$ to $v_j$, chosen uniformly at random among all such shortest paths. | |
| May 10, 2017 at 0:20 | answer | added | David G. Stork | timeline score: 1 | |
| May 9, 2017 at 23:42 | comment | added | David G. Stork | Your question is unclear. To "replace" the sub-path means replacing vertexes and edges, but the sub-path already exists. Draw by hand (if necessary) exactly what you're seeking. | |
| May 9, 2017 at 22:15 | comment | added | aellab | I'm a Mathematica newbie, so I guess I am stuck "everywhere". In particular I have a problem generating all relevant shortest paths and choosing from them at random. | |
| May 9, 2017 at 22:09 | review | First posts | |||
| May 10, 2017 at 3:40 | |||||
| May 9, 2017 at 22:08 | history | asked | aellab | CC BY-SA 3.0 |