Generating Random Regular Graphs Quickly
From MaRDI portal
Publication:4719436
DOI10.1017/S0963548399003867zbMath0935.05082WikidataQ56621906 ScholiaQ56621906MaRDI QIDQ4719436
Angelika Steger, Nicholas C. Wormald
Publication date: 14 May 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics, Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks, Sandwiching random graphs: universality between random graph models, Bounds on the bisection width for random \(d\)-regular graphs, Parallel Algorithm for Solving the Graph Isomorphism Problem, Star-struck by fixed embeddings: modern crossing number heuristics, MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, Mixing time of the switch Markov chain and stable degree sequences, A sequential algorithm for generating random graphs, Robustness of random graphs based on graph spectra, Fast uniform generation of random graphs with given degree sequences, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, A Note on the Practicality of Maximal Planar Subgraph Algorithms, Majority vote in social networks, The average distance and the diameter of dense random regular graphs, The switch Markov chain for sampling irregular graphs and digraphs, Araneola: a scalable reliable multicast system for dynamic environments, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Induced diffusion percolation model: examining the role of superactive nodes in the diffusion of innovations, The cook-book approach to the differential equation method, Moments of the inverse participation ratio for the Laplacian on finite regular graphs, On the quantum spin glass transition on the Bethe lattice, The many faces of graph dynamics, Preferential attachment without vertex growth: emergence of the giant component, A non-Markovian SIR network model with fixed infectious period and preventive rewiring, Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time, Unnamed Item, How likely is an LLD degree sequence to be graphical?, Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks, The maximum happy induced subgraph problem: bounds and algorithms, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Bootstrapping on undirected binary networks via statistical mechanics, Generating Random Networks Without Short Cycles, Uniform Generation of Random Regular Graphs, Unnamed Item, The evolution of the min-min random graph process, Uniform generation of spanning regular subgraphs of a dense graph, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, Randomized Δ-edge colouring via exchanges of complex colours, Universal characteristics of deep neural network loss surfaces from random matrix theory
