Related papers: Throughput in inhomogeneous planar drainage networ…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We study an asymmetric simple exclusion process in a strip in the presence of a solid impenetrable barrier. We focus on the effect of the barrier on the residence time of the particles, namely, the typical time needed by the particles to…
Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…
This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
We study the dynamics of flow-networks in porous media using a pore-network model. First, we consider a class of erosion dynamics assuming a constitutive law depending on flow rate, local velocities, or shear stress at the walls. We show…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
The procedure of the holonomy-flux algebra construction along a piecewise linear path, which consists of a countably infinite number of pieces, is described in this article. The related construction approximates the continuous distribution…
Density fluctuations in traffic current are studied by computer simulations using the deterministic coupled map lattice model on a closed single-lane circuit. By calculating a power spectral density of temporal density fluctuations at a…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…
In this study, we start from a Follow-the-Leaders model for traffic flow that is based on a weighted harmonic mean (in Lagrangian coordinates) of the downstream car density. This results in a nonlocal Lagrangian partial differential…
We consider the exclusion process on a ring with time-dependent defective bonds at which the hoping rate periodically switches between zero and one. This system models main roads in city traffics, intersecting with perpendicular streets. We…
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either well-structured regular subgraphs or those with many triangles. We observe a superdiffusion for the highly connected nodes while it is…
We develop a model in which interactions between nodes of a dynamic network are counted by non homogeneous Poisson processes. In a block modelling perspective, nodes belong to hidden clusters (whose number is unknown) and the intensity…
In this paper we study finite velocity planar random motions with an infinite number of possible directions, where the number of changes of direction is randomized by means of an inhomogeneous fractional Poisson distribution. We first…
We propose a consistency model based on the optimal-transport flow. A physics-informed design of partially input-convex neural networks (PICNN) plays a central role in constructing the flow field that emulates the displacement…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…