Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
