Sampling and estimation for (sparse) exchangeable graphs
From MaRDI portal
Publication:2284374
DOI10.1214/18-AOS1778zbMath1435.62128arXiv1611.00843OpenAlexW2982594517MaRDI QIDQ2284374
Publication date: 15 January 2020
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00843
Density estimation (62G07) Nonparametric estimation (62G05) Sampling theory, sample surveys (62D05) Nonparametric statistical resampling methods (62G09) Probabilistic graphical models (62H22)
Related Items
On convergence for graphexes ⋮ Asymptotic behavior of common connections in sparse random networks ⋮ Hierarchical Network Models for Exchangeable Structured Interaction Processes ⋮ On sparsity, power-law, and clustering properties of graphex processes ⋮ Bootstrap estimators for the tail-index and for the count statistics of graphex processes ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Identifiability for Graphexes and the Weak Kernel Metric ⋮ Sampling perspectives on sparse exchangeable graphs ⋮ Sampling and estimation for (sparse) exchangeable graphs ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ Limit theorems for distributions invariant under groups of transformations ⋮ Unnamed Item
Cites Work
- Rate-optimal graphon estimation
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- Exchangeable random measures in the plane
- Multivariate sampling and the estimation problem for exchangeable arrays
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- A statistical framework for modern network science
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- On convergence for graphexes
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Mixed membership stochastic blockmodels
- Metrics for sparse graphs
- Foundations of Modern Probability
- Estimation and Prediction for Stochastic Blockstructures
- Latent Space Approaches to Social Network Analysis
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- An Introduction to the Theory of Point Processes
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- The phase transition in inhomogeneous random graphs
- Probabilistic Symmetries and Invariance Principles
