Graph limits and exchangeable random graphs
From MaRDI portal
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)- Optimal graphon estimation in cut distance
- Empirical Likelihood for Network Data
- Forcing generalised quasirandom graphs efficiently
- Motif-based tests for bipartite networks
- Computable de Finetti measures
- The Aldous-Hoover theorem in categorical probability
- Classification on large networks: a quantitative bound via motifs and graphons (research)
- A note on Fokker-Planck equations and graphons
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- A graphon counter example
- The large deviation principle for the Erdős-Rényi random graph
- Harmonic analysis of symmetric random graphs.
- On string graph limits and the structure of a typical string graph
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Rate-optimal graphon estimation
- Quasi-random graphs and graph limits
- Iterative Collaborative Filtering for Sparse Matrix Estimation
- Graphons and renormalization of large Feynman diagrams
- Exchangeable interval hypergraphs and limits of ordered discrete structures
- An analytic approach to sparse hypergraphs: hypergraph removal
- Goodness of Fit of Logistic Regression Models for Random Graphs
- Subsampling bootstrap of count features of networks
- A conversation with David J. Aldous
- Computational lower bounds for graphon estimation via low-degree polynomials
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- Linear embeddings of graphs and graph limits
- Replica symmetry breaking without replicas
- Interval graph limits
- A measure theoretic perspective on the space of Feynman diagrams
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- The cut metric, random graphs, and branching processes
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- The method of moments and degree distributions for network models
- From flip processes to dynamical systems on graphons
- On finite exchangeability and conditional independence
- Computable exchangeable sequences have computable de Finetti measures
- 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
- Exchangeable and sampling-consistent distributions on rooted binary trees
- The dimension of the region of feasible tournament profiles
- Limits of structures and the example of tree semi-lattices
- Concentration estimates for functions of finite high‐dimensional random arrays
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
- Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits
- The ``zero charge problem via graphon processes
- Tree limits and limits of random trees
- Sparse exchangeable graphs and their limits via graphon processes
- A nonparametric view of network models and Newman–Girvan and other modularities
- A representation of exchangeable hierarchies by sampling from random real trees
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Book Review: Probabilistic symmetries and invariance principles
- The grapheme-valued Wright-Fisher diffusion with mutation
- Limit theorems for distributions invariant under groups of transformations
- Random walks on dense graphs and graphons
- Poset limits and exchangeable random posets
- On the density of transitive tournaments
- Inference for High-Dimensional Exchangeable Arrays
- Another conversation with Persi Diaconis
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- No additional tournaments are quasirandom-forcing
- Consistency under sampling of exponential random graph models
- Maximum likelihood estimation in the -model
- Spin systems on Bethe lattices
- Sparse random graphs with clustering
- A limit theorem for scaled eigenvectors of random dot product graphs
- General erased-word processes: product-type filtrations, ergodic laws and Martin boundaries
- Hoeffding-type decomposition for U-statistics on bipartite networks
- Semantic limits of dense combinatorial objects
- Universally consistent vertex classification for latent positions graphs
- Decompositions of finite high-dimensional random arrays
- Random graphs with a given degree sequence
- Bethe states of random factor graphs
- On the maximum density of fixed strongly connected subtournaments
- Multiway empirical likelihood
- Decomposition of tournament limits
- Graphon-valued stochastic processes from population genetics
- Co-clustering separately exchangeable network data
- The dimension of the feasible region of pattern densities
- On convergence for graphexes
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
- Hypergraph limits: A regularity approach
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Impartial digraphs
- Exchangeability, prediction and predictive modeling in Bayesian statistics
- Bayesian consensus clustering in multiplex networks
- Sharp total variation bounds for finitely exchangeable arrays
- Quantum invariant families of matrices in free probability
- Matrix estimation by universal singular value thresholding
- Combinatorial Lévy processes
- From quasirandom graphs to graph limits and graphlets
- The cut metric for probability distributions
- Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
- Cut distance identifying graphon parameters over weak* limits
- 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} \)
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- The dimension of the feasible region of pattern densities (extended abstract)
- Sampling perspectives on sparse exchangeable graphs
- Random Simplicial Complexes: Models and Phenomena
- Edgeworth expansions for network moments
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)
