scientific article; zbMATH DE number 3435482
From MaRDI portal
Publication:4401944
Cited in
(23)- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Exactly solvable random graph ensemble with extensively many short cycles
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- Uniform generation of random regular graphs
- Edge removal in random contact networks and the basic reproduction number
- Optimal phase synchronization in networks of phase-coherent chaotic oscillators
- The asymptotic distribution of short cycles in random regular graphs
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Metric structure of random networks
- Configuring random graph models with fixed degree sequences
- Fast uniform generation of random graphs with given degree sequences
- On the number of contingency tables and the independence heuristic
- Effective degree household network disease model
- The number of satisfying assignments of random regular \(k\)-SAT formulas
- Synchronization of heterogeneous oscillators under network modifications: perturbation and optimization of the synchrony alignment function
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
- Model for disease dynamics of a waterborne pathogen on a random network
- Phase transition in random contingency tables with non-uniform margins
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Counting connected graphs inside-out
- On combinatorial rectangles with minimum \(\infty \)-discrepancy
- How big is too big? Critical shocks for systemic failure cascades
- Efficient importance sampling for binary contingency tables
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 Q4401944)
