Timeline for Generating spatially-aware degree-preserving random graphs?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 20, 2012 at 1:40 | history | edited | Anthony Quas | CC BY-SA 3.0 |
expansion to suggest Gibbs measures
|
| Dec 19, 2012 at 2:39 | comment | added | Anthony Quas | I guess you could do what I'm doing (putting weights on edges) and then minimize over configurations that satisfy the degree constraints. My guess is the difficulty with this kind of thing is that you might get mathematically intractable models (although it's probably reasonably easy for computers to simulate it). | |
| Dec 19, 2012 at 2:27 | comment | added | Douglas S. Stones | Hmmm, thanks for that. I see what you're doing there, but this wouldn't preserve vertex in-degrees, which would be a disadvantage. (I'll have to think about whether this would be a significant disadvantage for the application I have in mind.) | |
| Dec 19, 2012 at 1:50 | history | answered | Anthony Quas | CC BY-SA 3.0 |