| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20230042 Slide.16
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
From combination of the graphs which are robustness of レ vs S on the slide no.13 and レ vs E{K} on the slide no.14, a graph "Mean number of connected peer groups E{K} vs. Connectivity S" can be constructed. We clarify that even if ル and レ are not known, connectivity S can be obtained from the mean number of connected peer groups E{K}. The graph shows that connectivity S is almost 100% when a peer participates in three peer groups simultaneously in average. | |
| [Go to Next Slide] |