Sparse exchangeable graphs and their limits via graphon processes
From MaRDI portal
Publication:4558542
zbMath1469.60158arXiv1601.07134MaRDI QIDQ4558542
Henry Cohn, Nina Holden, Jennifer T. Chayes, Christian Borgs
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1601.07134
graph convergencegraphonsexchangeable graph modelsmodelling of sparse networkssparse graph convergence
Multivariate analysis (62H99) Applications of graph theory (05C90) Random measures (60G57) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Exchangeability for stochastic processes (60G09)
Related Items
On edge exchangeable random graphs, On convergence for graphexes, Iterative Collaborative Filtering for Sparse Matrix Estimation, Asymptotic behavior of common connections in sparse random networks, Exchangeable trait allocations, Non-perturbative graph languages, halting problem and complexity, Local 2-separators, A statistical mechanical model for non-perturbative regimes, Local exchangeability, Pattern Formation in Random Networks Using Graphons, Graph polynomials associated with Dyson-Schwinger equations, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, Kontsevich Graphons, Projective, sparse and learnable latent position network models, Subgraph densities in Markov spaces, From Dyson-Schwinger equations to quantum entanglement, On sparsity, power-law, and clustering properties of graphex processes, Graph theory. Abstracts from the workshop held January 2--8, 2022, Bootstrap estimators for the tail-index and for the count statistics of graphex processes, Identifiability for Graphexes and the Weak Kernel Metric, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, The dynamics of non-perturbative phases via Banach bundles, The complexities of nonperturbative computations, Random Walks on Dense Graphs and Graphons, Sparse maximum-entropy random graphs with a given power-law degree distribution, Sampling perspectives on sparse exchangeable graphs, Sampling and estimation for (sparse) exchangeable graphs, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, A statistical framework for modern network science, The analytic evolution of Dyson-Schwinger equations via homomorphism densities, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Truncated simulation and inference in edge-exchangeable networks, Higher-order fluctuations in dense random graph models, The Cut Metric for Probability Distributions, Remarks on power-law random graphs, Limit theorems for distributions invariant under groups of transformations, Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rate-optimal graphon estimation
- Oracle inequalities for network models and sparse graphon estimation
- Spectral clustering and the high-dimensional stochastic blockmodel
- The method of moments and degree distributions for network models
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Representations for partially exchangeable arrays of random variables
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Matrix estimation by universal singular value thresholding
- Moments of two-variable functions and the uniqueness of graph limits
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Essentials of Integration Theory for Analysis
- Probability and Stochastics
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Latent Space Approaches to Social Network Analysis
- Sparse Graphs Using Exchangeable Random Measures
- Left and right convergence of graphs with bounded degree
- Graphons, cut norm and distance, couplings and rearrangements
- The phase transition in inhomogeneous random graphs
- Probabilistic Symmetries and Invariance Principles
- Probability Theory
