相关论文: Descents and nodal load in scale-free networks

The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function (pdf) of the distances may take various forms. Here we analyze these by considering…

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent $\gamma$. We define load at each vertex as the accumulated total number of data packets passing through that…

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…

A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment…

In this paper we model the tomography of scale free networks by studying the structure of layers around an arbitrary network node. We find, both analytically and empirically, that the distance distribution of all nodes from a specific…

Many real networks are complex and have power-law vertex degree distribution, short diameter, and high clustering. We analyze the network model based on thresholding of the summed vertex weights, which belongs to the class of networks…

In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of…

We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha}$, often with $2 < \alpha < 3$. However,…

Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…

This article addresses the degree distribution of subnetworks, namely the number of links between the nodes in each subnetwork and the remainder of the structure (cond-mat/0408076). The transformation from a subnetwork-partitioned model to…

The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…

We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k) ~ k^(-gamma), we show that the load is l(k) ~ k^eta with eta = gamma - 1,…

We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via…

Funnelling effect, in the context of searching on networks, precisely indicates that the search takes place through a few specific nodes. We define the funnelling capacity $f$ of a node as the fraction of successful dynamic paths through it…

Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and…

We introduce the notion of globally updating evolution for a class of weighted networks, in which the weight of a link is characterized by the amount of data packet transport flowing through it. By noting that the packet transport over the…

We study the transport properties of model networks such as scale-free and Erd\H{o}s-R\'{e}nyi networks as well as a real network. We consider the conductance $G$ between two arbitrarily chosen nodes where each link has the same unit…

This article describes a complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values assigned to the nodes. It is shown both analytically and experimentally that the strength…