Random Deletion in a Scale-Free Random Graph Process

From MaRDI portal
Publication:4672749

DOI10.1080/15427951.2004.10129095zbMath1080.60006OpenAlexW2106178197MaRDI QIDQ4672749

Colin Cooper, Juan Carlos Vera, Alan M. Frieze

Publication date: 3 May 2005

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2004.10129095



Related Items

Preferential deletion in dynamic models of web-like networks, A generalization of the Buckley-Osthus model for web graphs, Weights and degrees in a random graph model based on 3-interactions, Probabilistic Inductive Classes of Graphs, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Justifying the small-world phenomenon via random recursive trees, The three kinds of degree distributions and nash equilibrium on the limiting random network, On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness, Degree correlations in growing networks with deletion of nodes, A Geometric Preferential Attachment Model of Networks II, On the degree evolution of a fixed vertex in some growing networks, Robustness of Preferential Attachment Under Deletion of Edges, Phase transition on the degree sequence of a random graph process with vertex copying and deletion, Dynamic random networks in dynamic populations, An edge deletion model for complex networks, Scale‐free graphs of increasing degree, A web model with power law exponents less than 2, Random Networks with Preferential Growth and Vertex Death, Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, Transition of the Degree Sequence in the Random Graph Model of Cooper, Frieze, and Vera, Distance evolutions in growing preferential attachment graphs, On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities