Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Networks with given two-point correlations: hidden correlations from degree correlations  [PDF]
Agata Fronczak,Piotr Fronczak
Physics , 2005, DOI: 10.1103/PhysRevE.74.026121
Abstract: 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 degrees. The observation supported by the depoissonization idea allows to extract distribution of hidden variables from a given node degree distribution. It completes the algorithm for generating uncorrelated networks that was suggested by other authors. In this paper we also carefully analyze the interplay between hidden attributes and node degrees. We show how to extract hidden correlations from degree correlations. Our derivations provide mathematical background for the algorithm for generating correlated networks that was proposed by Boguna and Pastor-Satorras.
Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations  [PDF]
Alexei Vazquez
Physics , 2002, DOI: 10.1103/PhysRevE.67.056104
Abstract: The linear preferential attachment hypothesis has been shown to be quite successful to explain the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a general principle based on local rules. In this work it is claimed that an effective linear preferential attachment is the natural outcome of growing network models based on local rules. It is also shown that the local models offer an explanation to other properties like the clustering hierarchy and degree correlations recently observed in complex networks. These conclusions are based on both analytical and numerical results of different local rules, including some models already proposed in the literature.
Clustering coefficient without degree correlations biases  [PDF]
Sara Nadiv Soffer,Alexei Vazquez
Physics , 2004,
Abstract: The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a signature of the network hierarchical structure. Here we show that this signature of hierarchical structure is a consequence of degree correlation biases in the clustering coefficient definition. We introduce a new definition in which the degree correlation biases are filtered out, and provide evidence that in real networks the clustering coefficient is constant or decays logarithmically with vertex degree.
Parallel Algorithms for Generating Random Networks with Given Degree Sequences  [PDF]
Maksudul Alam,Maleq Khan
Computer Science , 2014,
Abstract: Random networks are widely used for modeling and analyzing complex processes. Many mathematical models have been proposed to capture diverse real-world networks. One of the most important aspects of these models is degree distribution. Chung--Lu (CL) model is a random network model, which can produce networks with any given arbitrary degree distribution. The complex systems we deal with nowadays are growing larger and more diverse than ever. Generating random networks with any given degree distribution consisting of billions of nodes and edges or more has become a necessity, which requires efficient and parallel algorithms. We present an MPI-based distributed memory parallel algorithm for generating massive random networks using CL model, which takes $O(\frac{m+n}{P}+P)$ time with high probability and $O(n)$ space per processor, where $n$, $m$, and $P$ are the number of nodes, edges and processors, respectively. The time efficiency is achieved by using a novel load-balancing algorithm. Our algorithms scale very well to a large number of processors and can generate massive power--law networks with one billion nodes and $250$ billion edges in one minute using $1024$ processors.
Random Networks with Tunable Degree Distribution and Clustering  [PDF]
Erik Volz
Physics , 2004, DOI: 10.1103/PhysRevE.70.056115
Abstract: We present an algorithm for generating random networks with arbitrary degree distribution and Clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and poisson degree distributions with variable levels of clustering. Such networks may be used as models of social networks and as a testable null hypothesis about network structure. Finally, we explore the effects of clustering on the point of the phase transition where a giant component forms in a random network, and on the size of the giant component. Some analysis of these effects is presented.
Tuning clustering in random networks with arbitrary degree distributions  [PDF]
M. Angeles Serrano,Marian Boguna
Physics , 2005, DOI: 10.1103/PhysRevE.72.036133
Abstract: We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree $k$ are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and secondly the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.
Expansion of the conditional probability function in a network with nearest-neighbour degree correlations  [PDF]
Murray E. Alexander,Randy Kobes
Physics , 2010,
Abstract: A useful property of a network that can be used to characterize many systems is the degree distribution. However, many complex networks exhibit higher--order degree correlations that must be studied through other means, such as clustering coefficients, the Newman r factor, and the average nearest neighbour degree (ANND). In this paper we develop an expansion of the conditional probability that can be used to parameterize such degree correlations. The measures of degree correlations associated with this expansion can be used to signal the presence of non--linear correlations.
Clustering of correlated networks  [PDF]
S. N. Dorogovtsev
Physics , 2003, DOI: 10.1103/PhysRevE.69.027104
Abstract: We obtain the clustering coefficient, the degree-dependent local clustering, and the mean clustering of networks with arbitrary correlations between the degrees of the nearest-neighbor vertices. The resulting formulas allow one to determine the nature of the clustering of a network.
Cavity-based robustness analysis of interdependent networks: Influences of intranetwork and internetwork degree-degree correlations  [PDF]
Shunsuke Watanabe,Yoshiyuki Kabashima
Physics , 2013, DOI: 10.1103/PhysRevE.89.012808
Abstract: We develop a methodology for analyzing the percolation phenomena of two mutually coupled (interdependent) networks based on the cavity method of statistical mechanics. In particular, we take into account the influence of degree-degree correlations inside and between the networks on the network robustness against targeted attacks and random failures. We show that the developed methodology is reduced to the well-known generating function formalism in the absence of degree-degree correlations. The validity of the developed methodology is confirmed by a comparison with the results of numerical experiments. Our analytical results imply that the robustness of the interdependent networks depends considerably on both the intra- and internetwork degree-degree correlations in the case of targeted attacks, whereas the significance of the degree-degree correlations is relatively low for random failures.
Degree correlations in directed scale-free networks  [PDF]
Oliver Williams,Charo I. Del Genio
Physics , 2014, DOI: 10.1371/journal.pone.0110121
Abstract: Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a network and the dynamics of the processes supported thereon, including the resilience to damage, the spread of information and epidemics, and the efficiency of defence mechanisms. Nonetheless, while many studies focus on undirected scale-free networks, the interactions in real-world systems often have a directionality. Here, we investigate the dependence of the degree correlations on the power-law exponents in directed scale-free networks. To perform our study, we consider the problem of building directed networks with a prescribed degree distribution, providing a method for proper generation of power-law-distributed directed degree sequences. Applying this new method, we perform extensive numerical simulations, generating ensembles of directed scale-free networks with exponents between~2 and~3, and measuring ensemble averages of the Pearson correlation coefficients. Our results show that scale-free networks are on average uncorrelated across directed links for three of the four possible degree-degree correlations, namely in-degree to in-degree, in-degree to out-degree, and out-degree to out-degree. However, they exhibit anticorrelation between the number of outgoing connections and the number of incoming ones. The findings are consistent with an entropic origin for the observed disassortativity in biological and technological networks.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.