The following pages link to (Q4365843):
Displaying 19 items.
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- Firm-network characteristics and economic robustness to natural disasters (Q428032) (← links)
- An efficient MCMC algorithm to sample binary matrices with fixed marginals (Q998842) (← links)
- Using contrastive divergence to seed Monte Carlo MLE for exponential-family random graph models (Q1658490) (← links)
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- Searchability of central nodes in networks (Q1953104) (← links)
- The relative fit measure for evaluating a blockmodel (Q2066713) (← links)
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins (Q2180075) (← links)
- Exact tests for the Rasch model via sequential importance sampling (Q2260062) (← links)
- A tutorial on methods for the modeling and analysis of social network data (Q2637081) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- Configuring Random Graph Models with Fixed Degree Sequences (Q4641712) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- (Q5009531) (← links)
- State-Dependent Kernel Selection for Conditional Sampling of Graphs (Q5066753) (← links)
- Exact sampling of graphs with prescribed degree correlations (Q5151598) (← links)
- Enumerating Steiner triple systems (Q6064438) (← links)
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
- Linear-time uniform generation of random sparse contingency tables with specified marginals (Q6590451) (← links)
