banner image
No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Robustness of random graphs based on graph spectra
Rent this article for
View: Figures


Image of FIG. 1.
FIG. 1.

Natural connectivity of ER random graphs: (a) vs. p with N = 100 (circles), 500 (triangles) and 1000 (diamonds); (b) vs. N with p = 0.1 (circles), 0.3 (triangles), 0.5 (diamonds). Each symbol corresponds to an average over 1000 realizations. The lines represent the corresponding analytical results according to Eq. (19).

Image of FIG. 2.
FIG. 2.

Natural connectivity of regular ring lattices (squares), random regular graphs (triangles) and ER random graphs (diamonds). From bottom to top, the symbols correspond to K = 3, 4, 5, respectively. For both the regular and ER random graphs, each symbol is obtained as an average over 1000 graph realizations. The lines are guides to the eye.

Image of FIG. 3.
FIG. 3.

The cross-over size given by Eq. (20) as a function of K, the density of edges.

Image of FIG. 4.
FIG. 4.

Natural connectivity during the process of random rewiring (diamonds) and random degree-preserving rewiring (triangles) starting from regular ring lattices with K = 5 for (a) N = 30 (a) and (b) N = 100 (b). The solid lines indicate the values of the natural connectivity for random regular graphs and the dashed lines represent the values for random graphs (Eq. (19)). Each symbol corresponds to an average over 1000 realizations.


Article metrics loading...


Full text loading...

This is a required field
Please enter a valid email address
752b84549af89a08dbdd7fdb8b9568b5 journal.articlezxybnytfddd
Scitation: Robustness of random graphs based on graph spectra