Related papers: Rare events statistics for $\mathbb Z^d$ map latti…
We study map lattices coupled by collision and show how perturbations of transfer operators associated with the spatially periodic approximation of the model can be used to extract information about collisions per lattice unit. More…
We introduce a new coupled map lattice model in which the weak interaction takes place via rare "collisions". By "collision" we mean a strong (possibly discontinuous) change in the system. For such models we prove uniqueness of the SRB…
In this expository note, we give a short derivation of the expected number of collisions between two independent simple random walkers on integer lattices. Adapting a Poissonization technique introduced by Lange, we express the collision…
We develop two further numerical tests of parton cascade models: the ideal gas equation of state and the collision frequency tests. The equation of state test checks the initial momentum distribution generator and free expansion dynamics in…
Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…
We investigate first-passage percolation on the lattice $\Z^d$ for dimensions $d \geq 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\tau$. We only assume $\P[\tau=0]0$ is explicit) for the…
Due to the deterministic nature of chaotic systems, fluctuations in their trajectories arise solely from the choice of initial conditions. Some of these dynamical fluctuations may lead to extremely unlikely scenarios. Understanding the…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
Consider an urn model where at each step one of $q$ colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball.…
We study the distribution of the occurrence of rare patterns in sufficiently mixing Gibbs random fields on the lattice $\mathbb{Z}^d$, $d\geq 2$. A typical example is the high temperature Ising model. This distribution is shown to converge…
Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We…
We compare the behaviour of a small truncated coupled map lattice with random inputs at the boundaries with that of a large deterministic lattice essentially at the thermodynamic limit. We find exponential convergence for the probability…
We show that the probability of appearance of synchronisation in chaotic coupled map lattices is related to the distribution of the maximum of a certain observable evaluated along almost all orbit. We show that such distribution belongs to…
For a broad class of random walks with anisotropic scattering kernel and absorption, we derive explicit formulas that allow expressing the moments of the collision number $n_V$ performed in a volume $V$ as a function of the particle…
We propose a new model of one-dimensional traffic flow using a coupled map lattice. In the model, each vehicle is assigned a map and changes its velocity according to it. A single map is designed so as to represent the motion of a vehicle…
We give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…
Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…
A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…
Satellite conjunctions involving "near misses" of space objects are becoming increasingly likely. One approach to risk analysis for them involves the computation of the collision probability, but this has been regarded as having some…
Synchronization among globally coupled, chaotic map lattices can be related to stable periodic windows in isolated chaotic maps. This relation provides a simple predictive tool for the understanding of complicated behavior in coupled…