Scientific publications

Configuration graphs with node degrees being independent identically distributed random variables following the power-law distribution with a shift are studied. We consider conditional graphs that consist of only one connected component. Computer simulations are used to study how the connectivity of such graphs changes under the two types of destruction processes: the “target attack” and the “random breakdown”. We propose models for the dependence of the probability of graph connectivity destruction on the graph size, the node degree distribution parameter, and the number of deleted nodes.