Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities.
Arjun S. RamaniNicole EikmeierDavid F. GleichPublished in: CoRR (2017)
Keyphrases
- random graphs
- undirected graph
- graph theoretic
- learning curves
- edge detection
- phase transition
- image processing
- singular value decomposition
- directed graph
- directed acyclic graph
- spanning tree
- small world
- special case
- probability distribution
- complex networks
- attributed graphs
- weighted graph
- connected components
- bayesian networks