{"title":"An Information Theory Approach to Network Evolution Models","authors":"Amirmohammad Farzaneh, J. Coon","doi":"10.1093/comnet/cnac020","DOIUrl":null,"url":null,"abstract":"\n A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called network evolution chain, is a stationary and ergodic stochastic process. Therefore, the asymptotic equipartition property can be applied to it. The model’s entropy rate and typical sequences are also explored. Extracting particular information from the network and methods to simulate network evolution in the continuous time domain are discussed. Additionally, the Erdős–Rényi network evolution chain is introduced as a subset of our model with the additional property of its stationary distribution matching the Erdős–Rényi random graph model. The stationary distributions of nodes and graphs are calculated for this subset alongside its entropy rate. The simulation results at the end of the article back up the proved theorems and calculated values.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"37 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2022-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of complex networks","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1093/comnet/cnac020","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1
Abstract
A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called network evolution chain, is a stationary and ergodic stochastic process. Therefore, the asymptotic equipartition property can be applied to it. The model’s entropy rate and typical sequences are also explored. Extracting particular information from the network and methods to simulate network evolution in the continuous time domain are discussed. Additionally, the Erdős–Rényi network evolution chain is introduced as a subset of our model with the additional property of its stationary distribution matching the Erdős–Rényi random graph model. The stationary distributions of nodes and graphs are calculated for this subset alongside its entropy rate. The simulation results at the end of the article back up the proved theorems and calculated values.
期刊介绍:
Journal of Complex Networks publishes original articles and reviews with a significant contribution to the analysis and understanding of complex networks and its applications in diverse fields. Complex networks are loosely defined as networks with nontrivial topology and dynamics, which appear as the skeletons of complex systems in the real-world. The journal covers everything from the basic mathematical, physical and computational principles needed for studying complex networks to their applications leading to predictive models in molecular, biological, ecological, informational, engineering, social, technological and other systems. It includes, but is not limited to, the following topics: - Mathematical and numerical analysis of networks - Network theory and computer sciences - Structural analysis of networks - Dynamics on networks - Physical models on networks - Networks and epidemiology - Social, socio-economic and political networks - Ecological networks - Technological and infrastructural networks - Brain and tissue networks - Biological and molecular networks - Spatial networks - Techno-social networks i.e. online social networks, social networking sites, social media - Other applications of networks - Evolving networks - Multilayer networks - Game theory on networks - Biomedicine related networks - Animal social networks - Climate networks - Cognitive, language and informational network