Sampling for conditional inference on network data
From MaRDI portal
Recommendations
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Uniform sampling of bipartite graphs with degrees in prescribed intervals
- Using the bootstrap for statistical inference on random graphs
- Fast sequential creation of random realizations of degree sequences
- Uniform sampling of directed and undirected graphs conditional on vertex connectivity
Cites work
- scientific article; zbMATH DE number 3984308 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- A sequential algorithm for generating random graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A survey of statistical network models
- Algebraic algorithms for sampling from conditional distributions
- Asymptotic enumeration by degree sequence of graphs of high degree
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Efficient importance sampling for binary contingency tables
- Enumeration and simulation methods for 0-1 matrices with given marginals
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- The Structure and Function of Complex Networks
- The asymptotic number of labeled graphs with given degree sequences
- Threshold graphs and related topics
- Weighted finite population sampling to maximize entropy
Cited in
(21)- Inference using noisy degrees: differentially private -model and synthetic graphs
- Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence
- Random-walk models of network formation and sequential Monte Carlo methods for graphs
- Markov Bases: A 25 Year Update
- Network quantile autoregression
- Configuring random graph models with fixed degree sequences
- Chain-referral sampling on stochastic block models
- scientific article; zbMATH DE number 5547867 (Why is no real title available?)
- Discussion of “A Tale of Two Datasets: Representativeness and Generalisability of Inference for Samples of Networks”
- Using the bootstrap for statistical inference on random graphs
- Uniform sampling of directed and undirected graphs conditional on vertex connectivity
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- Graph sampling
- Sampling strategies for conditional inference on multigraphs
- Unbiased sampling of network ensembles
- Node sampling for protein complex estimation in bait-prey graphs
- Subsampling bootstrap of count features of networks
- Directed Networks with a Differentially Private Bi-degree Sequence
- State-Dependent Kernel Selection for Conditional Sampling of Graphs
- An Efficient Sampling Algorithm for Network Motif Detection
- Adaptive importance sampling for network growth models
This page was built for publication: Sampling for conditional inference on network data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406358)
