Related papers: Load distribution in small world networks
This paper is concerned with the characterization of the relationship between topology and traffic dynamics. We use a model of network generation that allows the transition from random to scale free networks. Specifically, we consider three…
Mapping a complex network to an atomic cluster, the Anderson localization theory is used to obtain the load distribution on a complex network. Based upon an intelligence-limited model we consider the load distribution and the congestion and…
We analyse the so-called small-world network model (originally devised by Strogatz and Watts), treating it, among other things, as a case study of non-linear coupled difference or differential equations. We derive a system of evolution…
Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…
Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been…
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…
We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study non-clustered systems, we propose a modification of this measure on the local level. We apply this method to an…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
Link weight is crucial in weighted complex networks. It provides additional dimension for describing and adjusting the properties of networks. The topological role of weight is studied by the effects of random redistribution of link weights…
Weight distribution largely impacts the epidemic spreading taking place on top of networks. This paper studies a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation…
Small-world networks by Watts and Strogatz are a class of networks that are highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. These characteristics result in networks with unique…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…
The degree distribution, referred to as the delta-sequence of a network is studied. Using the non-normalized Lorenz curve, we apply a generalized form of the classical majorization partial order. Next, we introduce a new class of small…
Typically, contagion strength is modeled by a transmission rate $\lambda$, whereby all nodes in a network are treated uniformly in a mean-field approximation. However, local agents react differently to the same contagion based on their…
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index…
We study structural feature and evolution of the Internet at the autonomous systems level. Extracting relevant parameters for the growth dynamics of the Internet topology, we construct a toy model for the Internet evolution, which includes…
A distributed adaptive algorithm to estimate a time-varying signal, measured by a wireless sensor network, is designed and analyzed. One of the major features of the algorithm is that no central coordination among the nodes needs to be…
This paper focuses on the analytical probabilistic modeling of vehicular traffic. It formulates a stochastic node model. It then formulates a network model by coupling the node model with the link model of Lu and Osorio (2018), which is a…
We investigate algorithms to find short paths in spatial networks with stochastic edge weights. Our formulation of the problem of finding short paths differs from traditional formulations because we specifically do not make two of the usual…