Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities
From MaRDI portal
Publication:5232354
DOI10.1137/17M1127132zbMath1419.05194arXiv1709.03438OpenAlexW2966064431WikidataQ127393468 ScholiaQ127393468MaRDI QIDQ5232354
David F. Gleich, Arjun S. Ramani, Nicole Eikmeier
Publication date: 2 September 2019
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.03438
Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Matrix equations and identities (15A24)
Related Items (2)
Generating large scale‐free networks with the Chung–Lu random graph model ⋮ Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
Uses Software
Cites Work
- Connected components in random graphs with given expected degree sequences
- Euler and the partial sums of the prime harmonic series
- Permutation methods: a basis for exact inference
- A Scalable Generative Graph Model with Community Structure
- Efficient Generation of Networks with Given Expected Degrees
- A mathematical analysis of the R-MAT random graph generator
- Emergence of Scaling in Random Networks
- Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital Computers
- Direct Methods for Sparse Linear Systems
- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
- The phase transition in inhomogeneous random graphs
- An in-depth analysis of stochastic Kronecker graphs
- Random Graphs
- In-Degree and PageRank: Why Do They Follow Similar Power Laws?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities
