Exponential random graph models for networks resilient to targeted attacks

DOI10.4310/SII.2015.V8.N3.A2MaRDI QIDQ1747451zbMATH OpenFDO

Authors Jingfei Zhang, Yuguo Chen

Publication date 8 May 2018

Published in Statistics and Its Interface (Search for Journal in Brave)

zbMATH Keywords

Markov chain Monte Carlomaximum likelihood estimationrandom graphsnetwork robustnessexponential random graph modelglobal efficiency

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• Attack resistance of power-law random graphs in the finite-mean, infinite-variance region
• OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
• Estimating and understanding exponential random graph models
• Exponential-family random graph models for multi-layer networks
• Exponential Random Graphs as Models of Overlay Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• scientific article; zbMATH DE number 7754051
• The vertex attack tolerance of complex networks

Cited in

(2)

• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• A motif building process for simulating random networks

This page was built for publication: Exponential random graph models for networks resilient to targeted attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747451)