On edge exchangeable random graphs
From MaRDI portal
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 .
Recommendations
Cites work
- Central limit theorems for infinite urn models
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Edge exchangeable models for interaction networks
- Exchangeable trait allocations
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Graph limits and exchangeable random graphs
- Graphons, cut norm and distance, couplings and rearrangements
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3248623 (Why is no real title available?)
- scientific article; zbMATH DE number 3320045 (Why is no real title available?)
- Large networks and graph limits
- Limit theorems for triangular urn schemes
- Local limit theorems for finite and infinite urn models
- Moments of two-variable functions and the uniqueness of graph limits
- On a random graph evolving by degrees
- Random graphs and complex networks. Volume 1
- Random graphs.
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse graphs using exchangeable random measures
- Stochastic branching processes with continuous state space
- Strong laws of large numbers for \(r\)-dimensional arrays of random variables
- The birth of the giant component
- The phase transition in inhomogeneous random graphs
- The ubiquitous Ewens sampling formula
Cited in
(15)- Renewal theory for asymmetric \(U\)-statistics
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- Nonexchangeable random partition models for microclustering
- Truncated simulation and inference in edge-exchangeable networks
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Preferential attachment without vertex growth: emergence of the giant component
- Universality for random surfaces in unconstrained genus
- Graph limits and exchangeable random graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse graphs using exchangeable random measures
- Model-Based Edge Clustering
- Exchangeable random networks
- Local exchangeability
- On sparsity, power-law, and clustering properties of graphex processes
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
This page was built for publication: On edge exchangeable random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633959)
