Similar Search Results

A congestion awareness routing strategy for scale-free networks with tunable clustering

Chen, Zhen Yi; Wang, Xiao Fan - In: Physica A: Statistical Mechanics and its Applications 364 (2006) C, pp. 595-602

By incorporating local traffic information into the basic shortest path routing policy, we propose a congestion …-free networks with different clustering coefficients and in different congestion phases. We find that there exists an optimal value … for the tunable parameter in the congestion awareness strategy. Though the optimal value increases slowly as the traffic …

Persistent link: https://www.econbiz.de/10010873007

Clustering coefficients of growing networks

Shi, Dinghua; Zhu, Stuart X.; Liu, Liming - In: Physica A: Statistical Mechanics and its Applications 381 (2007) C, pp. 515-524

In this paper, we develop a general analytical method to compute clustering coefficients of growing networks. This method can be applied to any network as long as we can construct and solve the dynamic equation for the degree of any node. We also verify the accuracy of the method through simulation.

Persistent link: https://www.econbiz.de/10010872433

Statistical properties of weighted complex networks characterized by metaweights

Furuya, Shuhei; Yakubo, Kousuke - In: Physica A: Statistical Mechanics and its Applications 389 (2010) 6, pp. 1265-1272

We propose several characterizations of weighted complex networks by incorporating the concept of metaweight into the clustering coefficient, degree correlation, and module decomposition. These incorporations make it possible to describe weighted networks depending on how strongly we emphasize...

Persistent link: https://www.econbiz.de/10010873130

Nonlinear Barabási–Albert network

Onody, Roberto N.; Castro, Paulo A. de - In: Physica A: Statistical Mechanics and its Applications 336 (2004) 3, pp. 491-502

In recent years there has been considerable interest in the structure and dynamics of complex networks. One of the most studied networks is the linear Barabási–Albert model. Here we investigate the nonlinear Barabási–Albert growing network. In this model, a new node connects to a vertex of...

Persistent link: https://www.econbiz.de/10011057151

Generating random graphs with tunable clustering coefficients

Heath, Lenwood S.; Parikh, Nidhi - In: Physica A: Statistical Mechanics and its Applications 390 (2011) 23, pp. 4577-4587

Most real-world networks exhibit a high clustering coefficient—the probability that two neighbors of a node are also neighbors of each other. We propose two algorithms, Conf and Throw, that take triangle and single edge degree sequences as input and generate a random graph with a target...

Persistent link: https://www.econbiz.de/10011060396

Abstract phase space networks describing reactive dynamics

Provata, A.; Panagakou, E. - In: Physica A: Statistical Mechanics and its Applications 414 (2014) C, pp. 181-193

An abstract network approach is proposed for the description of the dynamics in reactive processes. The phase space of the variables (concentrations in reactive systems) is partitioned into a finite number of segments, which constitute the nodes of the abstract network. Transitions between the...

Persistent link: https://www.econbiz.de/10011062719

Exploring the random genesis of co-occurrence networks

Gustedt, Jens; Raghavan, Hari K.; Schimit, Pedro - In: Physica A: Statistical Mechanics and its Applications 390 (2011) 9, pp. 1516-1528

Using the network random generation models from Gustedt (2009) [23], we simulate and analyze several characteristics (such as the number of components, the degree distribution and the clustering coefficient) of the generated networks. This is done for a variety of distributions (fixed value,...

Persistent link: https://www.econbiz.de/10011063085

On the formation of degree and cluster-degree correlations in scale-free networks

Yao, Xin; Zhang, Chang-shui; Chen, Jin-wen; Li, Yan-da - In: Physica A: Statistical Mechanics and its Applications 353 (2005) C, pp. 661-673

The cluster-degree of a vertex is the number of connections among the neighbors of this vertex. In this paper we study the cluster-degree of the generalized Barabási–Albert model (GBA model) whose exponent of degree distribution ranges from 2 to ∞. We present the mean-field rate equation...

Persistent link: https://www.econbiz.de/10011063281

Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient

Cui, Yaozu; Wang, Xingyuan; Li, Junqiu - In: Physica A: Statistical Mechanics and its Applications 405 (2014) C, pp. 85-91

In this paper, we present an alternate algorithm for detecting overlapping community structures in the complex network. Two concepts named the maximal sub-graph and the clustering coefficient between two neighboring communities are introduced. First, all the maximal sub-graphs are extracted from...

Persistent link: https://www.econbiz.de/10010931581

The Topology of Transportation Networks: A Comparison Between Different Economies

Blumenfeld-Lieberthal, Efrat - In: Networks and Spatial Economics 9 (2009) 3, pp. 427-458

Persistent link: https://www.econbiz.de/10005048563