How to determine if a random graph with a fixed degree sequence has a giant component (Q681521)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to determine if a random graph with a fixed degree sequence has a giant component |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to determine if a random graph with a fixed degree sequence has a giant component |
scientific article |
Statements
How to determine if a random graph with a fixed degree sequence has a giant component (English)
0 references
12 February 2018
0 references
random network
0 references
0 references
0 references
0.9269561
0 references
0.9125322
0 references
0.8886539
0 references
0.8857067
0 references
0.88430756
0 references
0.88047755
0 references
0 references
0.8728913
0 references
0.8715354
0 references
