Related Experiment Video
Updated: Jan 23, 2026

Stereoacuity Improvement using Random-Dot Video Games
Published on: January 14, 2020
Fault tolerance of random graphs with respect to connectivity: Mean-field approximation for semidense random graphs
Satoshi Takabe1, Takafumi Nakano1, Tadashi Wadayama1
1Department of Computer Science, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya, Aichi 466-8555, Japan.
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.
Related Concept Videos
Ogive Graph
Graphing Antiderivatives
Bar Graph
Time-Series Graph
Multiple Bar Graph
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
Random Error

