Stochastic Process-based Method for Degree-Degree Correlation of Evolving Networks

Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured with a dynamic evolution including network reduction in addition to network growth. In this paper, we propose a novel mechanism for evolving networks from the perspective of vertex degree. We construct a queueing system to describe the increas...

This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to graphically depict assortative and disassortative variations within networks. To quantify degree correlation variations, the joint probability distribution between nodes with arbitrary degrees, P(k', k), is used. Introduction of the end-degree p...

From the perspective of probability, the stability of growing network is studied in the present paper. Using the DMS model as an example, we establish a relation between the growing network and Markov process. Based on the concept and technique of first-passage probability in Markov theory, we provide a rigorous proof for existence of the steady-state degree distribution, mathematically re-deriving the exact formula of the distribution. The approach based on Markov chain theo...

Real-world networks evolve over time via additions or removals of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models ([Nature Physics 2021, DOI: 10.1038/s41567-021-01417-7]). Despite its degree preserving property, the DPG model is able ...

In the paper, we present an incremental approach in the construction of scale free networks with hidden variables. The work arises from the necessity to generate that type of networks with a given number of links instead of obtaining a random configurations for a given set of parameters as in the usual literature. I propose an analytical approach of network evolution models gathering information along time based on the construction of a stochastic process on the space of poss...

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 d...

In this paper, we show the evaluation of the spectral radius for node degree as the basis to analyze the variation in the node degrees during the evolution of scale-free networks and small-world networks. Spectral radius is the principal eigenvalue of the adjacency matrix of a network graph and spectral radius ratio for node degree is the ratio of the spectral radius and the average node degree. We observe a very high positive correlation between the spectral radius ratio for...

Degree correlation plays a crucial role in studying network structures; however, its varied forms pose challenges to understanding its impact on network dynamics. This study devised a method that uses eigenvalue decomposition to characterize degree correlations. Additionally, the applicability of this method was demonstrated by approximating the basic and type reproduction numbers in an epidemic network model. The findings elucidate the interplay between degree correlations a...

Random networks are widely used to model complex networks and research their properties. In order to get a good approximation of complex networks encountered in various disciplines of science, the ability to tune various statistical properties of random networks is very important. In this manuscript we present an algorithm which is able to construct arbitrarily degree-degree correlated networks with adjustable degree-dependent clustering. We verify the algorithm by using empi...

Network science provides an indispensable theoretical framework for studying the structure and function of real complex systems. Different network models are often used for finding the rules that govern their evolution, whereby the correct choice of model details is crucial for obtaining relevant insights. We here study how the structure of networks generated with the aging nodes model depends on the properties of the growth signal. We use different fluctuating signals and co...