June 12, 2024
Existing studies on the degree correlation of evolving networks typically rely on differential equations and statistical analysis, resulting in only approximate solutions due to inherent randomness. To address this limitation, we propose an improved Markov chain method for modeling degree correlation in evolving networks. By redesigning the network evolution rules to reflect actual network dynamics more accurately, we achieve a topological structure that closely matches real-world network evolution. Our method models the degree correlation evolution process for both directed and undirected networks and provides theoretical results that are verified through simulations. This work offers the first theoretical solution for the steady-state degree correlation in evolving network models and is applicable to more complex evolution mechanisms and networks with directional attributes. Additionally, it supports the study of dynamic characteristic control based on network structure at any given time, offering a new tool for researchers in the field.
Similar papers 1
January 11, 2009
In this paper, we study a class of stochastic processes, called evolving network Markov chains, in evolving networks. Our approach is to transform the degree distribution problem of an evolving network to a corresponding problem of evolving network Markov chains. We investigate the evolving network Markov chains, thereby obtaining some exact formulas as well as a precise criterion for determining whether the steady degree distribution of the evolving network is a power-law or...
June 9, 2005
Using a simple model with link removals as well as link additions, we show that an evolving network is scale free with a degree exponent in the range of (2, 4]. We then establish a relation between the network evolution and a set of non-homogeneous birth-and-death processes, and, with which, we capture the process by which the network connectivity evolves. We develop an effective algorithm to compute the network degree distribution accurately. Comparing analytical and numeric...
September 22, 2013
Network topology and nodal dynamics are two fundamental stones of adaptive networks. Detailed and accurate knowledge of these two ingredients is crucial for understanding the evolution and mechanism of adaptive networks. In this paper, by adopting the framework of the adaptive SIS model proposed by Gross et al. [Phys. Rev. Lett. 96, 208701 (2006)] and carefully utilizing the information of degree correlation of the network, we propose a link-based formalism for describing the...
August 27, 2008
In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various ...
April 3, 2007
The ever-increasing knowledge of the structure of various real-world networks has uncovered their complex multi-mechanism-governed evolution processes. Therefore, a better understanding of the structure and evolution of these networked complex systems requires us to describe such processes in a more detailed and realistic manner. In this paper, we introduce a new type of network growth rule which comprises addition and deletion of nodes, and propose an evolving network model ...
September 30, 2004
This paper establishes a relation between scale-free networks and Markov chains, and proposes a computation framework for degree distributions of scale-free networks. We first find that, under the BA model, the degree evolution of individual nodes in a scale-free network follows some non-homogeneous Markov chains. Exploring the special structure of these Markov chains, we are able to develop an efficient algorithm to compute the degree distribution numerically. The complexity...
February 20, 2009
Reciprocal arcs represent the lowest order cycle possible to find in directed graphs without self-loops. Representing also a measure of feed-back between vertices, it is interesting to understand how reciprocal arcs influence other properties of complex networks. In this paper we focus on influence of reciprocal arcs on vertex degree distribution and degree correlations. We show that there is a fundamental difference between properties observed on the static network compared ...
August 4, 2008
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as generic models for studying the impacts of degree distributions and clustering on dynamical processes as well as null models for detecting other structural properties in empirical networks.
March 29, 2016
We study the importance of local structural properties in networks which have been evolved for a power-law scaling in their Laplacian spectrum. To this end, the degree distribution, two-point degree correlations, and degree-dependent clustering are extracted from the evolved networks and used to construct random networks with the prescribed distributions. In the analysis of these reconstructed networks it turns out that the degree distribution alone is not sufficient to gener...
November 6, 2023
Although the origin of the fat-tail characteristic of the degree distribution in complex networks has been extensively researched, the underlying cause of the degree distribution characteristic across the complete range of degrees remains obscure. Here, we propose an evolution model that incorporates only two factors: the node's weight, reflecting its innate attractiveness (nature), and the node's degree, reflecting the external influences (nurture). The proposed model provid...