Author:
Fazekas István,Barta Attila
Abstract
A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles. The evolution of the edges and triangles is governed by a multi-type continuous-time branching process. The limiting behaviour of the network is studied by mathematical methods. We prove that the number of triangles and edges have the same magnitude on the event of non-extinction, and it is eαt, where α is the Malthusian parameter. The probability of the extinction and the degree process of a fixed vertex are also studied. The results are illustrated by simulations.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference24 articles.
1. Network Science;Barabási,2018
2. Random Graphs and Complex Networks. Vol. 1.;van der Hofstad,2017
3. Emergence of Scaling in Random Networks
4. A random graph model based on 3-interactions;Backhausz;Ann. Univ. Sci. Budapest. Sect. Comput.,2012
5. Scale-Free Property for Degrees and Weights in an N-Interactions Random Graph Model*
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献