Related papers: Throughput in inhomogeneous planar drainage networ…

Film flow through networks of corners and capillary bridges can establish connections between seemingly isolated clusters during drainage in porous media. Coupled with drainage through the bulk of pores and throats, the flow through these…

Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…

We study a single-lane traffic model that is based on human driving behavior. The outflow from a traffic jam self-organizes to a critical state of maximum throughput. Small perturbations of the outflow far downstream create emergent traffic…

This paper is concerned with a fluidodynamic model for traffic flow. More precisely, we consider a single conservation law, deduced from conservation of the number of cars, defined on a road network that is a collection of roads with…

The Brownian motion of a particle in a harmonic potential, which is simultaneously exposed either to a linear shear flow or to a plane Poiseuille flow is investigated. In the shear plane of both flows the probability distribution of the…

We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have…

The simulation of traffic flow on networks requires knowledge on the behavior across traffic intersections. For macroscopic models based on hyperbolic conservation laws there exist nowadays many ad-hoc models describing this behavior. Based…

We consider traffic flows described by conservation laws. We study a 2:1 junction (with two incoming roads and one outgoing road) or a 1:2 junction (with one incoming road and two outgoing roads). At the mesoscopic level, the priority law…

We consider the Hamiltonian flow on complex complete intersection surfaces with isolated singularities, equipped with the Jacobian Poisson structure. More generally we consider complete intersections of arbitrary dimension equipped with…

We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formulated as open-loop optimal control problems for general…

We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by applying round-off to planar rotations. All orbits of these maps are conjectured to be periodic. We let the angle of rotation approach pi/2, and…

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very…

Traffic jams are an everyday hindrance to transport, and typically arise when many vehicles have the same or a similar destination. We show, however, that even when uniformly distributed in space and uncorrelated, targets have a crucial…

We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…

If the nodes of a graph are considered to be identical barrels - featuring different water levels - and the edges to be (locked) water-filled pipes in between the barrels, consider the optimization problem of how much the water level in a…

We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…

In a recent work, we proved that under diffusive scaling, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2 converges in distribution to the Brownian web. In…

With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this literature explores a large…

Droplets with different Weber numbers We impacting meshes at various inclination angles were investigated using high-speed photography. It was found that the droplet mesh penetration can be completely suppressed by inclining the mesh. The…