Timeline for Graphons and Graphs
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 16, 2019 at 18:42 | comment | added | alesia | you can at least in certain cases (and maybe always) define a limit graph, but in general it will forget a lot of information compared to the limit graphon | |
| Dec 16, 2019 at 5:17 | comment | added | Douglas W. | @DouglasW. So there is by no mean a possibility that the limit of a sequence of graphs is again a graph in the original definition? | |
| Dec 14, 2019 at 16:51 | comment | added | alesia | @DouglasW. If the limit has uniformly bounded vertex degree then the corresponding graphon is zero. I also think the infinite random graph produced by a non zero graphon cannot have locally finite degree, but I'm not sure | |
| Dec 14, 2019 at 15:45 | comment | added | Sam Hopkins | @DouglasW.: no, the Rado graph is far from locally finite. Every vertex has infinite degree. | |
| Dec 14, 2019 at 9:35 | comment | added | Douglas W. | And if you restrict yourself to locally finite graphs as limit objects of finite graphs? | |
| Dec 13, 2019 at 22:12 | history | edited | alesia | CC BY-SA 4.0 |
added 5 characters in body
|
| Dec 13, 2019 at 22:04 | history | edited | alesia | CC BY-SA 4.0 |
added 821 characters in body
|
| Dec 13, 2019 at 20:23 | comment | added | alesia | yes, indeed. right. (need at least 12 characters sry) | |
| Dec 13, 2019 at 20:22 | comment | added | Sam Hopkins | So you're talking about generating a random graph on countably infinitely-many vertices according to the probability distribution the graphon defines? | |
| Dec 13, 2019 at 20:20 | history | answered | alesia | CC BY-SA 4.0 |