Sampling and estimation for (sparse) exchangeable graphs
From MaRDI portal
Publication:2284374
Abstract: Sparse exchangeable graphs on , and the associated graphex framework for sparse graphs, generalize exchangeable graphs on , and the associated graphon framework for dense graphs. We develop the graphex framework as a tool for statistical network analysis by identifying the sampling scheme that is naturally associated with the models of the framework, and by introducing a general consistent estimator for the parameter (the graphex) underlying these models. The sampling scheme is a modification of independent vertex sampling that throws away vertices that are isolated in the sampled subgraph. The estimator is a dilation of the empirical graphon estimator, which is known to be a consistent estimator for dense exchangeable graphs; both can be understood as graph analogues to the empirical distribution in the i.i.d. sequence setting. Our results may be viewed as a generalization of consistent estimation via the empirical graphon from the dense graph regime to also include sparse graphs.
Recommendations
- Sampling perspectives on sparse exchangeable graphs
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Sparse graphs using exchangeable random measures
- Bootstrap estimators for the tail-index and for the count statistics of graphex processes
- Network representation using graph root distributions
Cites work
- A statistical framework for modern network science
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- An Introduction to the Theory of Point Processes
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Estimation and Prediction for Stochastic Blockstructures
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Exchangeable random measures in the plane
- Foundations of Modern Probability
- Latent Space Approaches to Social Network Analysis
- Metrics for sparse graphs
- Mixed membership stochastic blockmodels
- Multivariate sampling and the estimation problem for exchangeable arrays
- On convergence for graphexes
- Probabilistic Symmetries and Invariance Principles
- Rate-optimal graphon estimation
- Sampling and estimation for (sparse) exchangeable graphs
- Sampling perspectives on sparse exchangeable graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse graphs using exchangeable random measures
- The phase transition in inhomogeneous random graphs
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
Cited in
(28)- Graph sampling
- Sampling strategies for conditional inference on multigraphs
- Network representation using graph root distributions
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Limit theorems for distributions invariant under groups of transformations
- On convergence for graphexes
- Asymptotic behavior of common connections in sparse random networks
- Extrapolation and sampling for processes on spatial graphs
- 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
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Identifiability for graphexes and the weak kernel metric
- Sparse graphs using exchangeable random measures
- A perfect sampling method for exponential family random graph models
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Nonparametric modeling of higher-order interactions via hypergraphons
- On exchangeability in network models
- Hierarchical Network Models for Exchangeable Structured Interaction Processes
- Weighting estimation under bipartite incidence graph sampling
- On sparsity, power-law, and clustering properties of graphex processes
- Asymptotic analysis of statistical estimators related to multigraphex processes under misspecification
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Tractably modelling dependence in networks beyond exchangeability
- Multiway empirical likelihood
- Next waves in veridical network embedding*
- Spatially adaptive neighborhood smoothing for directed sparse graphons
This page was built for publication: Sampling and estimation for (sparse) exchangeable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284374)
