DOE OSTI · 22787918
On Edge Exchangeable Random Graphs
Abstract
We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Janson, Svante. 2018-11-15. On Edge Exchangeable Random Graphs. https://doi.org/10.1007/s10955-017-1832-9. https://engineeringpapers.com/record/osti%3A22787918/on-edge-exchangeable-random-graphs
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.