How to determine if a random graph with a fixed degree sequence has a giant component - Archive ouverte HAL Access content directly
Journal Articles Probability Theory and Related Fields Year : 2017

Dates and versions

hal-01641473 , version 1 (20-11-2017)

Identifiers

Cite

Bruce Reed, Felix Joos, Guillem Perarnau, Dieter Rautenbach. How to determine if a random graph with a fixed degree sequence has a giant component. Probability Theory and Related Fields, 2017, ⟨10.1007/s00440-017-0757-1⟩. ⟨hal-01641473⟩
162 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More