Quantitative modeling of degree-degree correlation in complex networks
نویسندگان
چکیده
منابع مشابه
Jamming in complex networks with degree correlation
We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport thr...
متن کاملAnalysis and perturbation of degree correlation in complex networks
Degree correlation is an important topological property common to many real-world networks such as such as the protein-protein interactions and the metabolic networks. In the letter, the statistical measures for characterizing the degree correlation in networks are investigated analytically. We give an exact proof of the consistency for the statistical measures, reveal the general linear relati...
متن کاملSynchronization in weighted scale free networks with degree-degree correlation
We study synchronization phenomena in scale-free networks of asymmetrically coupled dynamical systems featuring degree-degree correlation in the topology of the connection wiring. We show that when the interaction is dominant from the high-degree to the low-degree (from the low-degree to the high degree) nodes, synchronization is enhanced for assortative (disassortative) degree-degree correlati...
متن کاملWinner-Take-All Correlation-Based Complex Networks for Modeling Stock Market and Degree-Based Indexes
Complex networks are constructed to study correlations between the closing prices for all US stocks that were traded from July 1, 2005 to August 30, 2007. The nodes are the stocks, and the connections are determined by cross correlations of the variations of the stock prices and price returns within a chosen period of time. Specifically, a winner-take-all approach is used to determine if two no...
متن کاملDegree-dependent intervertex separation in complex networks.
We study the mean length (l)(k) of the shortest paths between a vertex of degree k and other vertices in growing networks, where correlations are essential. In a number of deterministic scale-free networks we observe a power-law correction to a logarithmic dependence, (l)(k) = A ln[N/k((gamma-1)/2)]-Ck(gamma-1)/N+ in a wide range of network sizes. Here N is the number of vertices in the network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.032805