The effect of random edge removal on network degree sequence

MaRDI QIDQ426822zbMATH OpenFDO

Authors Thomas Dubois, Stephen Eubank, Aravind Srinivasan

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p51

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

degree distributionrandom graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Degree sequence of configuration model with vertex faults
• Effect of random edge failure on the average path length
• An edge deletion model for complex networks
• Random Deletion in a Scale-Free Random Graph Process
• On the degree sequence of an evolving random graph process and its critical phenomenon

Cites work

• plfit

Cited in

(6)

• Effect of random edge failure on the average path length
• The impact of degree variability on connectivity properties of large networks
• Edge removal in random contact networks and the basic reproduction number
• Degree polynomial for vertices in a graph and its behavior under graph operations
• Connectivity of random graphs after centrality-based vertex removal
• A sequence of polynomial pairs assigned to a graph

Describes a project that uses

Uses Software

• plfit

This page was built for publication: The effect of random edge removal on network degree sequence

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