Related papers: Traffic on complex networks: Towards understanding…
Traffic waves can rise even from single lane car-following behaviour. To better understand and mitigate traffic waves, it is necessary to use analytical tools like mathematical models, data analysis, and micro-simulations that can capture…
We study several deterministic one-dimensional traffic models. For integer positions and velocities we find the typical high and low density phases separated by a simple transition. If positions and velocities are continuous variables the…
The dynamics of string junctions and their influence on the evolution of cosmic superstring networks are studied in full detail. We review kinematic constraints for colliding strings in a Friedmann-Lema\^itre-Robertson-Walker background and…
We found that models of evolving random networks exhibit dynamic scaling similar to scaling of growing surfaces. It is demonstrated by numerical simulations of two variants of the model in which nodes are added as well as removed [Phys.…
This paper studies and analyses the behavior of the Long-Range Dependence in network traffic after classifying traffic flows in aggregated time series. Following Differentiated Services architecture principles, the generic Quality of…
Internet traffic on a network link can be modeled as a stochastic process. After detecting and quantifying the properties of this process, using statistical tools, a series of mathematical models is developed, culminating in one that is…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
In order to develop a toy model for car's traffic in cities, in this paper we analyze, by means of numerical simulations, the transition among fluid regimes and a congested jammed phase of the flow of "kinetically constrained" hard spheres…
We study the role of finiteness and fluctuations about average quantities for basic structural properties of growing networks. We first determine the exact degree distribution of finite networks by generating function approaches. The…
We propose a minority route choice game to investigate the effect of the network structure on traffic network performance under the assumption of drivers' bounded rationality. We investigate ring-and-hub topologies to capture the nature of…
The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $x$ requests to transmit, then it receives a fraction of the capacity proportional to…
We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to…
We present large scale and detailed analysis of the microscopic empirical data of the traffic flow, focusing on the non-linear interactions between the vehicles when the traffic is congested. By implementing a "renormalisation" procedure…
In the so-called "microscopic" models of vehicular traffic, attention is paid explicitly to each individual vehicle each of which is represented by a "particle"; the nature of the "interactions" among these particles is determined by the…
Power grids, road maps, and river streams are examples of infrastructural networks which are highly vulnerable to external perturbations. An abrupt local change of load (voltage, traffic density, or water level) might propagate in a…
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…
We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging…
We consider fluctuations of the time-averaged current in the one-dimensional weakly-asymmetric exclusion process on a ring. The optimal density profile which sustains a given fluctuation exhibits an instability for low enough currents,…
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains…
We study cascading failures in networks using a dynamical flow model based on simple conservation and distribution laws to investigate the impact of transient dynamics caused by the rebalancing of loads after an initial network failure…