Related papers: Ordering of Random Walks: The Leader and the Lagga…
We consider N nearest neighbor random walks on the positive integers with a drift towards the origin. When one walk reaches the origin, it jumps to the position of one of the other N-1 walks, chosen uniformly at random. We show that this…
We investigate the first passage time t_{j,N} to a given chemical or Euclidean distance of the first j of a set of N>>1 independent random walkers all initially placed on a site of a disordered medium. To solve this order-statistics problem…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random…
We study the behaviour of the leftmost particle in a semi-infinite particle system on $\mathbb{Z}$, where each particle performs a continuous-time nearest-neighbour random walk, with particle-specific jump rates, subject to the exclusion…
We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…
In this paper we consider a telegraph equation with time-dependent coefficients, governing the persistent random walk of a particle moving on the line with a time-varying velocity $c(t)$ and changing direction at instants distributed…
We numerically estimate the leading asymptotic behavior of the length $L_{n}$ of the longest increasing subsequence of random walks with step increments following Student's $t$-distribution with parameter in the range $1/2 \leq \nu \leq 5$.…
We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader's aim is to optimize a linear objective function…
The kinetics of annihilating random walks in one dimension, with the half-line x>0 initially filled, is investigated. The survival probability of the nth particle from the interface exhibits power-law decay, S_n(t)~t^{-alpha_n}, with…
The parabolic N-membranes problem for the p-Laplacian and the complete order constraint on the components of the solution is studied in what concerns the approximation, the regularity and the stability of the variational solutions. We…
We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…
We have studied a random walk model based on majority rule. At a given instant, the moving direction of a cargo is determined by motor coordination mediated by a tug-of-war mechanism between two kinds of competing motor proteins. We have…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the "random assignment" model where the weights are assigned randomly to…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
The distribution of times $t_{j,N}$ elapsed until the first $j$ independent random walkers from a set of $N \gg 1$, all starting from the same site, are trapped by a quenched configuration of traps randomly placed on a disordered lattice is…
The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…
The $N$-particle branching random walk is a discrete time branching particle system with selection. We have $N$ particles located on the real line at all times. At every time step each particle is replaced by two offspring, and each…