Generating Random Regular Graphs Quickly
From MaRDI portal
Recommendations
Cited in
(65)- Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
- The evolution of the min-min random graph process
- The switch Markov chain for sampling irregular graphs and digraphs
- Generating regular directed graphs
- How likely is an LLD degree sequence to be graphical?
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Sandwiching random graphs: universality between random graph models
- A non-Markovian SIR network model with fixed infectious period and preventive rewiring
- The maximum happy induced subgraph problem: bounds and algorithms
- Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks
- Star-struck by fixed embeddings: modern crossing number heuristics
- The average distance and the diameter of dense random regular graphs
- Preferential attachment without vertex growth: emergence of the giant component
- Uniform generation of spanning regular subgraphs of a dense graph
- Bounds on the bisection width for random \(d\)-regular graphs
- Mixing time of the switch Markov chain and stable degree sequences
- Induced diffusion percolation model: examining the role of superactive nodes in the diffusion of innovations
- Randomized Δ-edge colouring via exchanges of complex colours
- Robustness of random graphs based on graph spectra
- A note on the practicality of maximal planar subgraph algorithms
- Uniform sampling of digraphs with a fixed degree sequence
- Connectivity of random regular graphs generated by the pegging algorithm
- scientific article; zbMATH DE number 459046 (Why is no real title available?)
- On the quantum spin glass transition on the Bethe lattice
- The many faces of graph dynamics
- 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
- Uniform generation of random regular graphs of moderate degree
- Generating 4-regular Hamiltonian plane graphs
- Implementing Huge Sparse Random Graphs
- Short cycle distribution in random regular graphs recursively generated by pegging
- Generating Random Unlabelled Graphs
- Araneola: a scalable reliable multicast system for dynamic environments
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- Moments of the inverse participation ratio for the Laplacian on finite regular graphs
- Generating random graphs with large girth
- The cook-book approach to the differential equation method
- Generating random networks without short cycles
- Uniform generation of random regular graphs
- Parallel Algorithm for Solving the Graph Isomorphism Problem
- scientific article; zbMATH DE number 7525513 (Why is no real title available?)
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
- Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time
- MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS
- Exact and efficient generation of geometric random variates and random graphs
- Universal characteristics of deep neural network loss surfaces from random matrix theory
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- Generating random regular graphs
- Generating random regular graphs
- Generating random regular graphs
- A sequential algorithm for generating random graphs
- A randomized construction of high girth regular graphs
- Fast uniform generation of random graphs with given degree sequences
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Majority vote in social networks
- A differentiable approach to the maximum independent set problem using dataless neural networks
- How network structure affects the dynamics of a network of stochastic spiking neurons
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Approximate sampling and counting of graphs with near-regular degree intervals
- Regular graphs with positive Ollivier-Ricci curvature
- Sequential stub matching for asymptotically uniform generation of directed graphs with a given degree sequence
- Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks
- Random Schreier graphs as expanders
- Bootstrapping on undirected binary networks via statistical mechanics
- Fast uniform generation of regular graphs
This page was built for publication: Generating Random Regular Graphs Quickly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719436)
