Pages that link to "Item:Q2885317"
From MaRDI portal
The following pages link to A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees (Q2885317):
Displaying 50 items.
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- Maximum likelihood estimation in the \(\beta\)-model (Q366958) (← links)
- Estimating the number of zero-one multi-way tables via sequential importance sampling (Q379986) (← links)
- An equation-free approach to coarse-graining the dynamics of networks (Q482712) (← links)
- Stochastic enumeration method for counting trees (Q518856) (← links)
- On the number of non-zero elements of joint degree vectors (Q521382) (← links)
- A sequential algorithm for generating random graphs (Q603928) (← links)
- Random graphs with a given degree sequence (Q640061) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- Sequential importance sampling of binary sequences (Q746178) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- Detection thresholds for the \(\beta\)-model on sparse graphs (Q1650079) (← links)
- The sample size required in importance sampling (Q1650098) (← links)
- Testing goodness of fit of random graph models (Q1736535) (← links)
- Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
- Stochastic enumeration with importance sampling (Q1739341) (← links)
- Graver basis for an undirected graph and its application to testing the beta model of random graphs (Q1934480) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- A note on asymptotic distributions in maximum entropy models for networks (Q2018609) (← links)
- Statistics of the two star ERGM (Q2108470) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Affiliation weighted networks with a differentially private degree sequence (Q2122819) (← links)
- Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence (Q2153141) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- Asymptotic in the ordered networks with a noisy degree sequence (Q2165451) (← links)
- Large deviation for uniform graphs with given degrees (Q2170378) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- Nonparametric identification in index models of link formation (Q2182134) (← links)
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting (Q2194460) (← links)
- Large-scale network motif analysis using compression (Q2212516) (← links)
- The geometry of synchronization problems and learning group actions (Q2223632) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- Degree-based moment estimation for ordered networks (Q2398853) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Motifs, coherent configurations and second order network generation (Q2670211) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- A survey of discrete methods in (algebraic) statistics for networks (Q2979659) (← links)
- Approximation of bounds on mixed-level orthogonal arrays (Q3021243) (← links)
- Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci (Q3295267) (← links)
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros (Q3295936) (← links)
- Unbiased sampling of network ensembles (Q3387646) (← links)
- An Efficient Sampling Algorithm for Network Motif Detection (Q3391081) (← links)
- Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (Q3466783) (← links)
- Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)
- Asymptotic distributions in affiliation networks with an increasing sequence (Q4638710) (← links)
