Robustness of power-law networks: its assessment and optimization

DOI10.1007/s10878-015-9893-7zbMath1354.90030OpenAlexW2110844331MaRDI QIDQ326464

Huiling Zhang, Yilin Shen, My T. Thai

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9893-7

zbMATH Keywords

optimizationrobustnessprobabilistic analysispower-law networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Bound and exact methods for assessing link vulnerability in complex networks
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Edge vulnerability in neural and metabolic networks
• Connected components in random graphs with given expected degree sequences
• Quality of future internet services. COST Action 263 final report
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• A random graph model for massive graphs
• Concentration Inequalities and Martingale Inequalities: A Survey
• Cluster-based service discovery for heterogeneous wireless sensor networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence