Abstract
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown probability that a graph is disconnected after stochastic node removal. To establish a mean-field approximation for the model, we propose the cavity method for finite systems. The analysis enables us to obtain an approximation formula for random graphs with any number of nodes and an arbitrary degree distribution. In addition, its asymptotic analysis reveals that the phase transition occurs in semidense random graphs whose average degree grows logarithmically. These results, which are supported by numerical simulations, coincide with the mathematical results, indicating successful predictions by the mean-field approximation for unbounded but not dense random graphs.
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.
