Configuring Random Graph Models with Fixed Degree Sequences
From MaRDI portal
Publication:4641712
DOI10.1137/16M1087175zbMath1387.05235arXiv1608.00607OpenAlexW2964035435MaRDI QIDQ4641712
Daniel B. Larremore, Johan Ugander, Joel Nishimura, Bailey K. Fosdick
Publication date: 18 May 2018
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00607
Markov chain Monte Carlopermutation testsgraph enumerationcomplex networksconfiguration modelgraph sampling
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Monte Carlo methods (65C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Contingency tables (62H17)
Related Items
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Networks beyond pairwise interactions: structure and dynamics, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Randomized Reference Models for Temporal Networks, Genetic networks encode secrets of their past, A Laplacian approach to stubborn agents and their role in opinion formation on influence networks, Modeling Memory Effects in Activity-Driven Networks, Making multigraphs simple by a sequence of double edge swaps, Random walks and diffusion on networks, Effective and efficient aggregation on uncertain graphs, What Are Higher-Order Networks?, Improved baselines for causal structure learning on interventional data, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Unnamed Item, Stochastic block models are a discrete surface tension, Reconstructing and stress testing credit networks, Weighted Minimum-Length Rearrangement Scenarios., Stability of inverter-interfaced power systems with multi-scale-free properties, Limitations of Chung Lu random graph generation, A multilayer network model of the coevolution of the spread of a disease and competing opinions, Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 159: An Efficient Method of Generating Random R × C Tables with Given Row and Column Totals
- Exponential-family random graph models for valued networks
- On realizations of a joint degree matrix
- A sequential algorithm for generating random graphs
- Mixing time of exponential random graphs
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- Fast uniform generation of regular graphs
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- A survey of algorithms for exact distributions of test statistics in r\(\times c\) contingency tables with fixed margins
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A note on the graph isomorphism counting problem
- The asymptotic number of labeled graphs with given degree sequences
- A survey of exact inference for contingency tables. With comments and a rejoinder by the author
- Connected realizations of joint-degree matrices
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Estimating and understanding exponential random graph models
- Algorithms for constructing graphs and digraphs with given valences and factors
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A Scalable Generative Graph Model with Community Structure
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Combinatorial Properties of Matrices of Zeros and Ones
- Snowball Sampling
- Uniform generation of random regular graphs of moderate degree
- Synchronization in large directed networks of coupled phase oscillators
- Power-Law Distributions in Empirical Data
- On a General Class of Models for Interaction
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Counting the Number of r × c Contingency Tables with Fixed Margins
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- A degree sequence problem related to network design
- Sparsification—a technique for speeding up dynamic graph algorithms
- Community structure in social and biological networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A critical point for random graphs with a given degree sequence
- Generalized Monte Carlo significance tests
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
- Switching edges to randomize networks: what goes wrong and how to fix it
- Exact sampling of graphs with prescribed degree correlations
- Graph isomorphism in quasipolynomial time [extended abstract]
- The switch Markov chain for sampling irregular graphs (Extended Abstract)
- Generating constrained random graphs using multiple edge switches
- Constructing and sampling graphs with a prescribed joint degree distribution
- Sampling Regular Graphs and a Peer-to-Peer Network
- The average distances in random graphs with given expected degrees
- Computing and Combinatorics
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Networks
