Connectivity of random graphs after centrality-based vertex removal

DOI10.1017/JPR.2023.106MaRDI QIDQ6617606zbMATH OpenFDO

Authors Remco van der Hofstad, Manish K. Pandey

Publication date 11 October 2024

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/JPR.2023.106

zbMATH Keywords

centrality-based vertex removalconfiguration modelnumber of connected componentssize of giantstrictly local centrality measures

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Stochastic processes (60G99)

Recommendations

• On connectivity of conditional configuration graphs under destruction
• The effect of random edge removal on network degree sequence
• Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
• Vulnerability of robust preferential attachment networks

Cites work

• A critical point for random graphs with a given degree sequence
• A new approach to the giant component problem
• A Phase Transition for the Diameter of the Configuration Model
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• An old approach to the giant component problem
• Axioms for Centrality
• Distances in random graphs with finite mean and infinite variance degrees
• Distances in random graphs with finite variance degrees
• Generalized PageRank on directed configuration networks
• Generating simple random graphs with prescribed degree distribution
• scientific article; zbMATH DE number 2042286 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?
• Information ranking and power laws on trees
• Local weak convergence for PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Networks
• On percolation in random graphs with given vertex degrees
• Pagerank asymptotics on directed preferential attachment networks
• PageRank in Scale-Free Random Graphs
• PageRank of Scale-Free Growing Networks
• PageRank on inhomogeneous random digraphs
• Random graphs and complex networks. Volume 1
• Recurrence of distributional limits of finite planar graphs
• The impact of degree variability on connectivity properties of large networks
• The probability that a random multigraph is simple
• The probability that a random multigraph is simple. II
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The tail does not determine the size of the giant

This page was built for publication: Connectivity of random graphs after centrality-based vertex removal

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