Related papers: Phase transition for parking blocks, Brownian excu…
Jamming transition in traffic flow (between free and jammed traffic) for homogeneous car following model has been investigated taking into account fluctuations of characteristic acceleration/braking time. These fluctuations are defined by…
We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the…
We apply the random-matrix theory to the car-parking problem. For this purpose, we adopt a Coulomb gas model that associates the coordinates of the gas particles with the eigenvalues of a random matrix. The nature of interaction between the…
The phase diagram of a system of monodispersed hard rectangles of size $m\times m k$ on a square lattice is numerically determined for $m=2,3$ and aspect ratio $k= 1,2,\ldots, 7$. We show the existence of a disordered phase, a nematic phase…
In this work, we investigate the localization properties of a paradigmatic model, coupled to a monitoring environment and possessing a many-body localized (MBL) phase. We focus on the post-selected no-click limit with quench random rates,…
The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…
For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval graph has a Hamilton cycle if and only if its scattering…
Motivated by nucleation and molecular aggregation in physical, chemical and biological settings, we present an extension to a thorough analysis of the stochastic self-assembly of a fixed number of identical particles in a finite volume. We…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
While volume violation of area law has been exhibited in several quantum spin chains, the construction of a corresponding ground state in higher dimensions, entangled in more than one direction, has been an open problem. Here we construct a…
Let $C \subseteq [r]^m$ be a code such that any two words of $C$ have Hamming distance at least $t$. It is not difficult to see that determining a code $C$ with the maximum number of words is equivalent to finding the largest $n$ such that…
Ranking over sets arise when users choose between groups of items. For example, a group may be of those movies deemed $5$ stars to them, or a customized tour package. It turns out, to model this data type properly, we need to investigate…
Consider a rooted tree on the top of which we let cars arrive on its vertices. Each car tries to park on its arriving vertex but if it is already occupied, it drives towards the root of the tree and parks as soon as possible. In this…
We study an one-dimensional stochastic model of vehicular traffic on open segments of a single-lane road of finite size $L$. The vehicles obey a stochastic discrete-time dynamics which is a limiting case of the generalized Totally…
Various aspects of time-dependent processes are studied within the large N approximation of O(N) vector models in three dimensions. These include the rolling of fields, the tunneling and decay of vacua. We present an exact solution for the…
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…
We study the effect of reaction times on the kinetics of relaxation to stationary states and on congestion transitions in heterogeneous traffic. Heterogeneity is modeled as quenched disorders in the parameters of the car following model and…
Traffic breakdown, as one of the most puzzling traffic flow phenomena, is characterized by sharply decreasing speed, abruptly increasing density and in particular suddenly plummeting capacity. In order to clarify its root mechanisms and…