Transactions of KarRC RAS :: Scientific publications
Transactions of KarRC RAS :: Scientific publications

Transactions of KarRC RAS :: Scientific publications
Karelian Research Centre of RAS
ISSN (print): 1997-3217
ISSN (online): 2312-4504
Transactions of KarRC RAS :: Scientific publications
Background Editorial committee Editorial Office For authors For reviewer Russian version
Transactions of KarRC RAS :: Scientific publications

Electronic Journal OJS



Series

Biogeography

Experimental Biology

Mathematical Modeling and Information Technologies

Precambrian Geology

Ecological Studies

Limnology and Oceanology

Research in the Humanities (2010-2015)

Region: Economy and Management (2012-2015)



Issues

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

1999-2008


SCIENTIFIC PUBLICATIONS
Ю.Л. Павлов.
О максимальной модулярности случайных конфигурационных графов
Yu.L. Pavlov. On the maximum of the modularity of random configuration graphs // Transactions of Karelian Research Centre of Russian Academy of Science. No 7. Mathematical Modeling and Information Technologies. 2019. Pp. 36-41
Keywords: configuration random graph; modularity; limit theorem
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 can be used to adequately describe the topology of transport, electricity, social networks and the Internet. An important characteristic of the structure of a graph is its modularity. It is a measure for graph clustering in the case vertices are divided into groups (clusters). Graphs with high modularity have dense edges between the vertices within clusters but sparse connections between vertices of different clusters. The notion of modularity and its properties in random configuration graphs are discussed. The maximum modularity of a graph is used to describe the level of graph clustering and to find the best division of vertices. The limit theorem for the maximum modularity as the number of vertices tends to infinity is proved.
Indexed at RSCI


  Last modified: July 1, 2019