On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs
✍ Scribed by Ching-Lueh Chang, Chao-Hong Wang
- Book ID
- 118780953
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Weight
- 563 KB
- Volume
- 52
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter q c , as well as the critical exponents β/ν, γ /ν and 1/ν have been
## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that