Sign in
Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities.
Arjun S. Ramani
Nicole Eikmeier
David F. Gleich
Published in:
SIAM Rev. (2019)
Keyphrases
</>
random graphs
undirected graph
graph theoretic
learning curves
edge detection
phase transition
probability distribution
spanning tree
small world
minimum cost
complex networks
graph structure
image processing
np hard
connected components