Related papers: Parking on the infinite binary tree
Many studies suggest that searching for parking is associated with significant direct and indirect costs. Therefore, it is appealing to reduce the time which car drivers spend on finding an available parking lot, especially in urban areas…
An optimal finite-time process drives a given initial distribution to a given final one in a given time at the lowest cost as quantified by total entropy production. We prove that for system with discrete states this optimal process…
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…
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…
Motivated by applications of the Erlang-B blocking model and the extended $M/M/k/k+N$ model that allows for some queueing, beyond communication networks to sizing and pricing in production, messaging, and app-based parking systems, we study…
The Krauss-model is a stochastic model for traffic flow which is continuous in space. For periodic boundary conditions it is well understood and known to display a non-unique flow-density relation (fundamental diagram) for certain…
We introduce and study a deterministic lattice model describing the motion of an infinite system of oppositely charged particles under the action of a constant electric field. As an application this model represents a traffic flow of cars…
In this paper, based on results of exact learning and test theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined…
A granular system confined in a quasi two-dimensional box that is vertically vibrated can transit to an absorbing state in which all particles bounce vertically in phase with the box, with no horizontal motion. In principle, this state can…
It has been hypothesized that the rather small number of crossings in real syntactic dependency trees is a side-effect of pressure for dependency length minimization. Here we answer a related important research question: what would be the…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
It is well known that a binary system of non-active disks that experience driving in opposite directions exhibits jammed, phase separated, disordered, and laning states. In active matter systems, such as a crowd of pedestrians, driving in…
We consider infinite particle system on the positive half-line moving independently of each other. When a particle hits the boundary it immediately disappears, and the boundary moves to the right on some fixed quantity (particle size). We…
We study a double-ended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the system, they immediately transact a trade and leave. Thus there cannot be non-zero number of buyers and sellers…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
This paper considers an unsignalized intersection used by two traffic streams. A stream of cars is using a primary road, and has priority over the other stream. Cars belonging to the latter stream cross the primary road if the gaps between…
We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision…
The development of driverless vehicles has spurred the need to predict human driving behavior to facilitate interaction between driverless and human-driven vehicles. Predicting human driving movements can be challenging, and poor prediction…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
We have studied the phase transition of the contact process near a multiple junction of $M$ semi-infinite chains by Monte Carlo simulations. As opposed to the continuous transitions of the translationally invariant ($M=2$) and semi-infinite…