Connectivity threshold and recovery time in rank-based models for complex networks (Q536217): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5888517 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random graphs | |||
Property / zbMATH Keywords: random graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
protean graphs | |||
Property / zbMATH Keywords: protean graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
power law graphs | |||
Property / zbMATH Keywords: power law graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scale-free networks | |||
Property / zbMATH Keywords: scale-free networks / rank | |||
Normal rank |
Revision as of 09:06, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connectivity threshold and recovery time in rank-based models for complex networks |
scientific article |
Statements
Connectivity threshold and recovery time in rank-based models for complex networks (English)
0 references
16 May 2011
0 references
random graphs
0 references
protean graphs
0 references
power law graphs
0 references
scale-free networks
0 references