Robustness and Vulnerability of Scale-Free Random Graphs
From MaRDI portal
Publication:4673812
DOI10.1080/15427951.2004.10129080zbMath1062.05080OpenAlexW1984495995MaRDI QIDQ4673812
Publication date: 9 May 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129080
Related Items
Randomized Reference Models for Temporal Networks, A preferential attachment model with random initial degrees, Preferential deletion in dynamic models of web-like networks, Efficient disintegration strategy in directed networks based on tabu search, The phase transition in inhomogeneous random graphs, Large communities in a scale-free network, Critical percolation on scale-free random graphs: new universality class for the configuration model, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, On anti-stochastic properties of unlabeled graphs, On Bollobás‐Riordan random pairing model of preferential attachment graph, Locality of random digraphs on expanders, Random networks with sublinear preferential attachment: the giant component, Cascading failures in interdependent directed networks under localized attacks, Network disruption and the common-enemy effect, Comparing eigenvector and degree dispersion with the principal ratio of a graph, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Asymptotic behavior and distributional limits of preferential attachment graphs, Subcritical Random Hypergraphs, High-Order Components, and Hypertrees, Degree correlations in growing networks with deletion of nodes, Relationship between degree-rank function and degree distribution of protein-protein interaction networks, Sparse random graphs with clustering, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size, Change point detection in network models: preferential attachment and long range dependence, Small subgraphs in preferential attachment networks, General results on preferential attachment and clustering coefficient, Security of scale-free networks, On the degree evolution of a fixed vertex in some growing networks, Preferential duplication graphs, Diameters in preferential attachment models, Supercritical percolation on large scale-free random trees, Rumor spreading in social networks, Robustness of Preferential Attachment Under Deletion of Edges, Unnamed Item, Recognizing linear structure in noisy matrices, How likely is an LLD degree sequence to be graphical?, Spectra of large random trees, Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks, A difference equation approach to statistical mechanics of complex networks, Universality for distances in power-law random graphs, Disparity of clustering coefficients in the Holme‒Kim network model, Twitter event networks and the superstar model, Modeling and Designing Real–World Networks, TheN-star network evolution model, Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity, Spatial preferential attachment networks: power laws and clustering coefficients, Clustering in preferential attachment random graphs with edge-step, On the mean distance in scale free graphs, Percolation on Random Graphs with a Fixed Degree Sequence
