Connectivity of random graphs after centrality-based vertex removal

DOI10.1017/jpr.2023.106MaRDI QIDQ6617606

Remco van der Hofstad, Manish K. Pandey

Publication date: 11 October 2024

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

zbMATH Keywords

number of connected componentsconfiguration modelcentrality-based vertex removalsize of giantstrictly local centrality measures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The tail does not determine the size of the giant
• Recurrence of distributional limits of finite planar graphs
• PageRank on inhomogeneous random digraphs
• Pagerank asymptotics on directed preferential attachment networks
• Local weak convergence for PageRank
• An old approach to the giant component problem
• Distances in random graphs with finite mean and infinite variance degrees
• Random Graphs and Complex Networks
• PageRank in Scale-Free Random Graphs
• Information ranking and power laws on trees
• The Impact of Degree Variability on Connectivity Properties of Large Networks
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• A Phase Transition for the Diameter of the Configuration Model
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Networks
• A critical point for random graphs with a given degree sequence
• Axioms for Centrality
• The probability that a random multigraph is simple. II
• Distances in random graphs with finite variance degrees
• Generalized PageRank on directed configuration networks
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: Why Do They Follow Similar Power Laws?

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