Graph limits and exchangeable random graphs
From MaRDI portal
Publication:3597136
Abstract: We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory into more classical probability.
Recommendations
- Multigraph limits and exchangeability
- On edge exchangeable random graphs
- Quasi-random graphs and graph limits
- Sparse exchangeable graphs and their limits via graphon processes
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- From quasirandom graphs to graph limits and graphlets
- Limits of discrete distributions and Gibbs measures on random graphs
- Extremal results in random graphs
- On limits of sparse random graphs
- scientific article; zbMATH DE number 3997847
Cited in
(only showing first 100 items - show all)- On edge exchangeable random graphs
- On convergence for graphexes
- Limits of structures and the example of tree semi-lattices
- Quasi-random graphs and graph limits
- A limit theorem for scaled eigenvectors of random dot product graphs
- Sparse graphs using exchangeable random measures
- Multigraph limits and exchangeability
- An analytic approach to stability
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- Mixture models and networks: The stochastic blockmodel
- Relative exchangeability with equivalence relations
- From quasirandom graphs to graph limits and graphlets
- Estimating and understanding exponential random graph models
- The cut metric, random graphs, and branching processes
- An introduction to large deviations for random graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- Sharp total variation bounds for finitely exchangeable arrays
- The large deviation principle for the Erdős-Rényi random graph
- Tree limits and limits of random trees
- Computable de Finetti measures
- Exchangeable interval hypergraphs and limits of ordered discrete structures
- Random graphs with a given degree sequence
- Linear embeddings of graphs and graph limits
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Sparse random graphs with clustering
- Spin systems on Bethe lattices
- Consistency under sampling of exponential random graph models
- Quantum invariant families of matrices in free probability
- Matrix estimation by universal singular value thresholding
- On the typical structure of graphs in a monotone property
- Maximum likelihood estimation in the \(\beta\)-model
- Hypergraph limits: A regularity approach
- On the density of transitive tournaments
- The method of moments and degree distributions for network models
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
- Graphons and renormalization of large Feynman diagrams
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Book Review: Probabilistic symmetries and invariance principles
- A representation of exchangeable hierarchies by sampling from random real trees
- Invariant measures via inverse limits of finite structures
- Rate-optimal graphon estimation
- Interval graph limits
- Combinatorial Lévy processes
- Graph limits and hereditary properties
- A measure theoretic perspective on the space of Feynman diagrams
- Another conversation with Persi Diaconis
- Limit of a nonpreferential attachment multitype network model
- Poset limits can be totally ordered
- Random walks on dense graphs and graphons
- Computable exchangeable sequences have computable de Finetti measures
- Universally consistent vertex classification for latent positions graphs
- Poset limits and exchangeable random posets
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Differential calculus on graphon space
- Generating hierarchial scale-free graphs from fractals
- A note on Fokker-Planck equations and graphons
- On estimation and inference in latent structure random graphs
- Co-clustering separately exchangeable network data
- The geometry of continuous latent space models for network data
- General erased-word processes: product-type filtrations, ergodic laws and Martin boundaries
- On string graph limits and the structure of a typical string graph
- Limits of discrete distributions and Gibbs measures on random graphs
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Cycles of a given length in tournaments
- Relatively exchangeable structures
- Motif-based tests for bipartite networks
- Multivariate Hawkes processes on inhomogeneous random graphs
- Sparse exchangeable graphs and their limits via graphon processes
- σ-algebras for quasirandom hypergraphs
- A conversation with David J. Aldous
- Subsampling bootstrap of count features of networks
- Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
- Cut distance identifying graphon parameters over weak* limits
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- Localization in 1D non-parametric latent space models from pairwise affinities
- Bethe states of random factor graphs
- On the maximum density of fixed strongly connected subtournaments
- Asymptotic behavior of common connections in sparse random networks
- Projective, sparse and learnable latent position network models
- Exchangeable and sampling-consistent distributions on rooted binary trees
- Bayesian consensus clustering in multiplex networks
- Projective families of distributions revisited
- Computational lower bounds for graphon estimation via low-degree polynomials
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Harmonic analysis of symmetric random graphs.
- Iterative Collaborative Filtering for Sparse Matrix Estimation
- Impartial digraphs
- Replica symmetry breaking without replicas
- Matrix estimation, latent variable model and collaborative filtering
- On a question of Vera T. Sós about size forcing of graphons
- A de Finetti-type representation of joint hierarchically exchange
- The intransitive dice kernel: \( \frac{1\kern-2pt\mathrm{I}_{x\ge y}-1\kern-2pt\mathrm{I}_{x\le y}}{4} - \frac{3(x-y)(1+xy)}{8} \)
- Inference for High-Dimensional Exchangeable Arrays
- Goodness of Fit of Logistic Regression Models for Random Graphs
- The cut metric for probability distributions
- Higher-order fluctuations in dense random graph models
- A generalization of hierarchical exchangeability on trees to directed acyclic graphs
- On coprime percolation, the visibility graphon, and the local limit of the GCD profile
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
This page was built for publication: Graph limits and exchangeable random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597136)
