Related papers: Stretched exponential decay for subcritical parkin…

In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…

Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…

We consider a one-dimensional traffic model with a slow-to-start rule. The initial position of the cars in $\mathbb R$ is a Poisson process of parameter $\lambda$. Cars have speed 0 or 1 and travel in the same direction. At time zero the…

Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…

In this article, we establish new results on the probabilistic parking model (introduced by Durm\'ic, Han, Harris, Ribeiro, and Yin) with $m$ cars and $n$ parking spots and probability parameter $p\in[0,1]$. For any $ m \leq n$ and $p \in…

We investigate parking in a one-dimensional lot, where cars enter at a rate $\lambda$ and each attempts to park close to a target at the origin. Parked cars also depart at rate 1. An entering driver cannot see beyond the parked cars for…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…

As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…

Consider a critical branching random walk on $\mathbb{Z}^d$, $d\geq 1$, started with a single particle at the origin, and let $L(x)$ be the total number of particles that ever visit a vertex $x$. We study the tail of $L(x)$ under suitable…

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$.…

The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ taking the steps $(1,0)$, $(-1,1)$ and $(0,-1)$ with probabilities $\lambda < (\mu_1\neq \mu_2)$; in particular, $X$ is assumed stable. Let $\tau_n$ be the first time $X$ hits…

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…

We consider self-avoiding walk and percolation in $\Zd$, oriented percolation in $\Zd\times\Zp$, and the contact process in $\Zd$, with $p D(\cdot)$ being the coupling function whose range is denoted by $L<\infty$. For percolation, for…

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly…

We study the distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the…

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…

In the unsplittable capacitated vehicle routing problem, we are given a metric space with a vertex called depot and a set of vertices called terminals. Each terminal is associated with a positive demand between 0 and 1. The goal is to find…