How to determine if a random graph with a fixed degree sequence has a giant component.

Felix Joos Guillem Perarnau Dieter Rautenbach Bruce A. Reed

Published in: CoRR (2016)

Keyphrases

random graphs
graph theoretic
phase transition
small world
connected components
community structure
power law
computational complexity
ranking algorithm
undirected graph