Related papers: Degree correlations in directed scale-free network…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…
In a recursive way and by including a parameter, we introduce a family of deterministic scale-free networks. The resulting networks exhibit small-world effects. We calculate the exact results for the degree exponent, the clustering…
We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning…
Scale-free networks are characterized by a degree distribution with power-law behavior and have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks. Degree distributions of observed…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
The existence or not of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree…
We investigate the degree-degree correlations in the Erdos-Renyi networks, the growing exponential networks and the scale-free networks. We demonstrate that these correlations are the largest for the exponential networks. We calculate also…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…
We use the configuration model to generate networks having a degree distribution that follows a $q$-exponential, $P_q(k)=(2-q)\lambda[1-(1-q)\lambda k]^{1/(q-1)}$, for arbitrary values of the parameters $q$ and $\lambda$. We study the…
We derive mean-field equations that describe the dynamics of a general model of rumor spreading on complex networks, and use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model…
The paper orders certain important issues related to both uncorrelated and correlated networks with hidden variables. In particular, we show that networks being uncorrelated at the hidden level are also lacking in correlations between node…
Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative and neutral networks according to the behavior of the degree-degree correlation coefficient. Here we investigate the…
Many social networks exhibit assortative mixing so that the predictions of uncorrelated models might be inadequate. To analyze the role of assortativity we introduce an algorithm which changes correlations in a network and produces…
A general relation for the dependence of nearest neighbor degree correlations on degree is derived. Dependence of local clustering on degree is shown to be the sole determining factor of assortative versus disassortative mixing in networks.…
Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be…
The Japanese shareholding network at the end of March 2002 is studied. To understand the characteristics of this network intuitively, we visualize it as a directed graph and an adjacency matrix. Especially detailed features of networks…
We investigate the impact of degree-degree correlations on the spectra of networks. Even though density distributions exhibit drastic changes depending on the (dis)assortative mixing and the network architecture, the short range…
Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…