Related papers: Load distribution in small world networks
Understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information. In this work, we propose a new…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
A model for the spread of an infection is analyzed for different population structures. The interactions within the population are described by small world networks, ranging from ordered lattices to random graphs. For the more ordered…
We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic…
We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time…
We model the spread of a SIS infection on Small World and random networks using weighted graphs. The entry $w_{ij}$ in the weight matrix W holds information about the transmission probability along the edge joining node $v_i$ and node…
We study two kinds of weighted networks, weighted small-world (WSW) and weighted scale-free (WSF). The weight $w_{ij}$ of a link between nodes $i$ and $j$ in the network is defined as the product of endpoint node degrees; that is…
Given a directed network $ G $, we are interested in studying the qualitative features of $ G $ which govern how perturbations propagate across $ G $. Various classical centrality measures have been already developed and proven useful to…
Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…
We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
Recently Watts and Strogatz have given an interesting model of small-world networks. Here we concretise the concept of a ``far away'' connection in a network by defining a {\it far edge}. Our definition is algorithmic and independent of…
This paper proposes a generalised framework for density estimation in large networks with measurable spatiotemporal variance in edge weights. We solve the stochastic shortest path problem for a large network by estimating the density of the…
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such…
We have proposed two new dynamic networks where two node are swapped each other, and showed that the both networks behave as a small world like in the average path length but can not make any effective discussions on the clustering…
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…
The design of robust supply and distribution systems is one of the fundamental challenges at the interface of network science and logistics. Given the multitude of performance criteria, real-world constraints, and external influences acting…
The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely average path length, degree distribution and clustering coefficient. Although the…
Identification of influential nodes is an important step in understanding and controlling the dynamics of information, traffic and spreading processes in networks. As a result, a number of centrality measures have been proposed and used…