A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
From MaRDI portal
Publication:2885317
DOI10.1080/15427951.2010.557277zbMath1238.60084OpenAlexW1978479505MaRDI QIDQ2885317
Joseph K. Blitzstein, Persi Diaconis
Publication date: 22 May 2012
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1318514519
Computational methods in Markov chains (60J22) Software, source code, etc. for problems pertaining to statistics (62-04) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Reliability and life testing (62N05) Vertex degrees (05C07)
Related Items
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, Affiliation weighted networks with a differentially private degree sequence, Power analysis of independence testing for three-way contingency tables of small sizes, Some contributions to practice of 2 × 2 contingency tables, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Sequential Monte Carlo for counting vertex covers in general graphs, Reduced word enumeration, complexity, and randomization, Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence, State-Dependent Kernel Selection for Conditional Sampling of Graphs, Vertex-weighted graphs: realizable and unrealizable domains, Detection thresholds for the \(\beta\)-model on sparse graphs, The sample size required in importance sampling, Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra, Efficient importance sampling for binary contingency tables, Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence, Asymptotics in theβ-model for networks with a differentially private degree sequence, Asymptotic in the ordered networks with a noisy degree sequence, Degree-based moment estimation for ordered networks, A note on undirected random graph models parameterized by the strengths of vertices, Asymptotic in undirected random graph models with a noisy degree sequence, Asymptotics in a probit model for directed networks, Large deviation for uniform graphs with given degrees, Maximum likelihood estimation in the \(\beta\)-model, A sequential algorithm for generating random graphs, Estimating the number of zero-one multi-way tables via sequential importance sampling, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Motifs, coherent configurations and second order network generation, Nonparametric identification in index models of link formation, On vertex-weighted realizations of acyclic and general graphs, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Graver basis for an undirected graph and its application to testing the beta model of random graphs, Hierarchical models for independence structures of networks, A proof of Tomescu's graph coloring conjecture, Graph realizations: maximum degree in vertex neighborhoods, Sequential importance sampling for estimating expectations over the space of perfect matchings, Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Logical differencing in dyadic network formation models with nontransferable utilities, Unnamed Item, Improved baselines for causal structure learning on interventional data, Negative examples for sequential importance sampling of binary contingency tables, On vertex-weighted graph realizations, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Random graphs with a given degree sequence, Large-scale network motif analysis using compression, A survey of discrete methods in (algebraic) statistics for networks, Constructing and sampling directed graphs with given degree sequences, The geometry of synchronization problems and learning group actions, Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci, Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros, An equation-free approach to coarse-graining the dynamics of networks, Testing goodness of fit of random graph models, Rejection sampling of bipartite graphs with given degree sequence, Asymptotic distributions in affiliation networks with an increasing sequence, Stochastic enumeration with importance sampling, Exact sampling of graphs with prescribed degree correlations, Configuring Random Graph Models with Fixed Degree Sequences, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Sampling for Conditional Inference on Network Data, Stochastic enumeration method for counting trees, On the number of non-zero elements of joint degree vectors, Approximation of bounds on mixed-level orthogonal arrays, Generation of networks with prescribed degree-dependent clustering, A note on asymptotic distributions in maximum entropy models for networks, Vertex-weighted realizations of graphs, Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs, Sequential importance sampling of binary sequences, Generating Random Networks Without Short Cycles, Unbiased sampling of network ensembles, An Efficient Sampling Algorithm for Network Motif Detection, Directed random graphs with given degree distributions, Sampling \(k\)-partite graphs with a given degree sequence, Random sampling of contingency tables via probabilistic divide-and-conquer, Fast Sequential Creation of Random Realizations of Degree Sequences, Statistics of the two star ERGM, Relaxed and approximate graph realizations
Uses Software
