Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model

Authors:
R. Criado;B. Hernández-Bermejo;J. Marco-Blanco;M. Romance
Affiliations:
Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Mostoles (Madrid), Spain;Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Mostoles (Madrid), Spain;Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Mostoles (Madrid), Spain;Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Mostoles (Madrid), Spain
Venue:
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Year:
2008

Citing 3
Cited 0

Regular Article: The Diameter of Sparse Random Graphs

Advances in Applied Mathematics
Network robustness and graph topology

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Asymptotic estimates for efficiency, vulnerability and cost for random networks

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

New analytic estimates for efficiency and vulnerability in the Erdös-Rénji model are presented using probabilistic properties and diameter bounds that are specific for this model and its topology. These estimates for random networks improve the known deterministic lower estimates for efficiency and vulnerability. The probabilistic technique provides a sharper approach to parametric analysis of random networks and allows us to report some new results concerning the efficiency-vulnerability relationship. Several numerical tests are presented to compare the lower estimates obtained with the empirical Erdös-Rénji random networks. These estimates illustrate how the new probabilistic estimates improve on the generic estimates reported in the literature.