scientific article; zbMATH DE number 3760216
From MaRDI portal
Publication:3942995
Cited in
(15)- Exactly scale-free scale-free networks
- The switch Markov chain for sampling irregular graphs and digraphs
- The flip Markov chain for connected regular graphs
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
- Empirical spectral distributions of sparse random graphs
- A triangle process on regular graphs
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Approximating shortest connected graph transformation for trees
- Switchings Constrained to 2-Connectivity in Simple Graphs
- Firm-network characteristics and economic robustness to natural disasters
- Configuring random graph models with fixed degree sequences
- New classes of degree sequences with fast mixing swap Markov chain sampling
- Fast sequential creation of random realizations of degree sequences
- scientific article; zbMATH DE number 7535774 (Why is no real title available?)
- Switches in Eulerian graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942995)
