ON THE MAXIMUM OF THE MODULARITY OF RANDOM CONFIGURATION GRAPHS
Configuration graphs with random independent identically distributed vertex degrees are considered. The degrees are equal to the number of vertex semiedges that are numbered in an arbitrary order. The graph is constructed by joining all of semiedges pairwise equiprobably to form edges. Such models c...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Karelian Research Centre of the Russian Academy of Sciences
2019-06-01
|
| Series: | Transactions of the Karelian Research Centre of the Russian Academy of Sciences |
| Subjects: | |
| Online Access: | http://journals.krc.karelia.ru/index.php/mathem/article/view/960 |