Related papers: On (Multi)-Collision Times
Distributed delay equations have been used to model situations in which there is some sort of delay whose duration is uncertain. However, the interpretation of a distributed delay equation is actually very different from that of a delay…
We generalize a wide class of time-continuous microscopic traffic models to include essential aspects of driver behaviour not captured by these models. Specifically, we consider (i) finite reaction times, (ii) estimation errors, (iii)…
The status of flow in heavy-ion collisions and of inference of hadronic-matter properties is reviewed.
Many features of multiparticle production in ultra-relativistic nuclear collisions reflect the collision geometry and other collision characteristics determining the initial conditions. As the initial conditions affect to a different degree…
The theoretical expectations for the supersymmetric particle spectrum is reviewed and a brief overview on present constraints on supersymmetric models from collider experiments is presented. Finally, we discuss the discovery potential of…
We study the influence of quantum interference and colour flow on three point correlations described by asymmetric cumulants in high multiplicity events in pp collisions. We use the model previously developed for the study of the…
We investigate chaos synchronization between Josephson junctions coupled uni-directionally with time-delay. We demonstrate the possibility of high quality synchronization with numerical simulations of such systems. The results are of…
The drawdown process of an one-dimensional regular diffusion process $X$ is given by $X$ reflected at its running maximum. The drawup process is given by $X$ reflected at its running minimum. We calculate the probability that a drawdown…
The physics of high-energy collider experiments asks for delicate comparisons between theoretical predictions and experimental data. Signals and potential backgrounds for new physics have to be predicted at sufficient accuracy. The accuracy…
We study intersection access control for autonomous vehicles. Platoon forming algorithms, which aim to organize individual vehicles in platoons, are very promising. To create those platoons, we slow down vehicles before the actual arrival…
Analysis of collisions is standardly included in the introductory physics course. In one dimension (1D), there do not seem to be any unusual issues: Typically, the initial velocities of the two colliding objects are specified, and the…
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
The purpose of this review is to analyze the physics at play in particle resuspension in order to bring insights into the rich complexity of this common but challenging concern. Following the more-is-different vision, this is performed by…
This thesis considers the problem of scheduling autonomous vehicles at intersections. A new system is proposed which is more efficient and could replace the recently introduced Autonomous Intersection Management (AIM) model. The proposed…
We investigate a microscopical structure in a chain of cars waiting at a red signal on signal-controlled crossroads. Presented is an one-dimensional space-continuous thermodynamical model leading to an excellent agreement with the data…
We show that a simple piecewise-linear system with time delay and periodic forcing gives rise to a rich bifurcation structure of torus bifurcations and Arnold tongues, as well as multistability across a significant portion of the parameter…
Scenarios are developed for runs at a Linear Collider, in the case that there is a rich program of new physics.
Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of…
Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.