Related papers: Throughput in inhomogeneous planar drainage networ…
Structures such as waves, jets, and vortices have a dramatic impact on the transport properties of a flow. Passive tracer transport in incompressible two-dimensional flows is described by Hamiltonian dynamics, and, for idealized structures,…
We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…
In this paper we study information flow paths in a data network, where traffic generated by servers (or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should…
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…
A classic network tomography problem is estimation of properties of the distribution of route traffic volumes based on counts taken on the network links. We consider inference for a general class of models for integer-valued traffic. Model…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
We study the information traffic in Barab\'asi-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order…
Complex network approaches have been successfully applied for studying transport processes in complex systems ranging from road, railway or airline infrastructure over industrial manufacturing to fluid dynamics. Here, we utilize a generic…
We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…
Understanding the nature of traffic heterogeneity is of major importance, given the widespread adoption of micromobility in cities. Based on massive field data and a nonequilibrium model, we demonstrate that heterogeneous, multispecies…
We present a study of exclusion process on a peculiar topology of network with two intersected lanes, competing for the particles in a reservoir with finite capacity. To provide a theoretical ground for our findings, we exploit mean-field…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
We introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the…
We introduce a model of percolation induced by disorder, where an initially homogeneous network with links of equal weight is disordered by the introduction of heterogeneous weights for the links. We consider a pair of nodes i and j to be…
We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…
Understanding the resilience of infrastructures such as transportation network has significant importance for our daily life. Recently, a homogeneous spatial network model was developed for studying spatial embedded networks with…