×

First and second moments of the size distribution of bond percolation clusters on rings, paths and stars. (English) Zbl 1440.60084

Summary: The main objective of this paper is to study the first and second moments of the size of a typical cluster of bond percolation on ring, path, and star graphs. These graphs are essential building blocks of graphs that represent hybrid local area networks (LANs). In our setting, the edges are independently open with probability \(p\), and the aim is to find the exact expressions for the first and second moments of the number of vertices in the cluster of open edges containing a vertex chosen uniformly at random. This work is motivated by a network science question of resilience as well as pricing of cyber risk in hybrid LANs.

MSC:

60K35 Interacting random processes; statistical mechanics type models; percolation theory
68M11 Internet topics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bicsi, B., Network Design Basics for Cabling Professionals (2002), McGraw-Hill Professional
[2] Broadbent, S. R.; Hammersley, J. M., Percolation processes. I. Crystals and mazes, Proc. Cambridge Philos. Soc., 53, 629-641 (1957) · Zbl 0091.13901
[3] Grimmett, G. R., Percolation, xii+296 (1989), Springer-Verlag: Springer-Verlag New York · Zbl 0691.60089
[4] Jevtić, P., Lanchier, N., Dynamic structural model of loss distribution for cyber risk of small or medium size enterprises for tree based LAN topology. Insurance: Math. Econ., in press. · Zbl 1435.91154
[5] Cyber Resilience of Systems and Networks (2019), Springer International Publishing
[6] The Linux Information Project, 2005. http://www.linfo.org/lan.html Local Area Network Definition.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.