Sampling perspectives on sparse exchangeable graphs
From MaRDI portal
Publication:2280538
DOI10.1214/18-AOP1320zbMath1448.60025arXiv1708.03237MaRDI QIDQ2280538
Victor Veitch, Henry Cohn, Christian Borgs, Jennifer T. Chayes
Publication date: 18 December 2019
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03237
Nonparametric estimation (62G05) Sampling theory, sample surveys (62D05) Nonparametric statistical resampling methods (62G09) Combinatorial probability (60C05)
Related Items
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, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Sampling and estimation for (sparse) exchangeable graphs, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Exchangeable random measures in the plane
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Representations for partially exchangeable arrays of random variables
- Multivariate sampling and the estimation problem for exchangeable arrays
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Recurrence of distributional limits of finite planar graphs
- A statistical framework for modern network science
- On convergence for graphexes
- Sampling and estimation for (sparse) exchangeable graphs
- More Uses of Exchangeability: Representations of Complex Random Structures
- Mixed membership stochastic blockmodels
- Graph limits and exchangeable random graphs
- 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
- Probabilistic Symmetries and Invariance Principles
