Related papers: A multi-lane TASEP model for crossing pedestrian t…
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this…
An infinite hierarchy of layering transitions exists for model polymers in solution under poor solvent or low temperatures and near an attractive surface. A flat histogram stochastic growth algorithm known as FlatPERM has been used on a…
As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets. For massive inputs, several…
In this paper, we consider the two phases macroscopic traffic model introduced in [P. Goatin, The Aw-Rascle vehicular traffic flow with phase transitions, Mathematical and Computer Modeling 44 (2006) 287-303]. We first apply the wave-front…
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we focus on the Adaptive Massively Parallel Computation (AMPC)…
We propose a microscopic traffic model where the update velocity is determined by the deceleration capacity and response time. It is found that there is a class of collisions that cannot be distinguished by simply comparing the stop…
We consider a random partition of the vertex set of an arbitrary graph that can be sampled using loop-erased random walks stopped at a random independent exponential time of parameter $q>0$, that we see as a tuning parameter.The related…
We investigate the totally asymmetric simple exclusion process (TASEP) in the presence of a bottleneck, i.e. a sequence of consecutive defect sites with reduced hopping rate. The influence of such a bottleneck on the phase diagram is…
We investigate traffic flows using the kinetic Boltzmann equations with a Maxwell collision integral. This approach allows analytical determination of the transient behavior and the size distributions. The relaxation of the car and cluster…
We obtain the exact solution of the facilitated totally asymmetric simple exclusion process (F-TASEP) in 1D. The model is closely related to the conserved lattice gas (CLG) model and to some cellular automaton traffic models. In the F-TASEP…
The jamming transition in the stochastic cellular automaton model (Nagel-Schreckenberg model) of highway traffic is analyzed in detail, by studying the relaxation time, a mapping to surface growth problems and the investigation of…
Traffic congestion is one of the most notable problems arising in worldwide urban areas, importantly compromising human mobility and air quality. Current technologies to sense real-time data about cities, and its open distribution for…
Traffic microsimulation is a crucial tool that uses microscopic traffic models, such as car-following and lane-change models, to simulate the trajectories of individual agents. This digital platform allows for the assessment of the impact…
Road traffic casualties represent a hidden global epidemic, demanding evidence-based interventions. This paper demonstrates a network lattice approach for identifying road segments of particular concern, based on a case study of a major…
We study the relation between the average traffic flow and the vehicle density on road networks that we call 2D-traffic fundamental diagram. We show that this diagram presents mainly four phases. We analyze different cases. First, the case…
We propose a model to implement and simulate different traffic-flow conditions in terms of quantum graphs hosting an ($N$+1)-level dot at each site, which allows us to keep track of the type and of the destination of each vehicle. By…
We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node…
In this paper we consider a model of particles jumping on a row of cells, called in physics the one dimensional totally asymmetric exclusion process (TASEP). More precisely we deal with the TASEP with open or periodic boundary conditions…
We introduce a new interacting (stochastic) particle system q-PushASEP which interpolates between the q-TASEP introduced by Borodin and Corwin (see arXiv:1111.4408, and also arXiv:1207.5035; arXiv:1305.2972; arXiv:1212.6716) and the…
Asymmetric exclusion processes for particles moving on parallel channels with inhomogeneous coupling are investigated theoretically. Particles interact with hard-core exclusion and move in the same direction on both lattices, while…