Related papers: The Klee-Minty random edge chain moves with linear…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
Let $F$ be a strictly $k$-balanced $k$-uniform hypergraph with $e(F)\geq |F|-k+1$ and maximum co-degree at least two. The random greedy $F$-free process constructs a maximal $F$-free hypergraph as follows. Consider a random ordering of the…
We consider a supercritical symmetric continuous-time branching random walk on a multidimensional lattice with a finite number of particle generation sources of varying positive intensities without any restrictions on the variance of jumps…
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques, as well as…
We consider biased random walk on supercritical percolation clusters in $\Z^2$. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias…
Consider the process which starts with $N\ge 3$ distinct points on ${\mathbb R}^d$, and fix a positive integer~$K<N$. Of the total $N$ points keep those $N-K$ which minimize the energy (defined as the sum of all pairwise distances squared)…
We study statistical properties of a one dimensional infinite system of coalescing particles. Each particle moves with constant velocity $\pm v$ towards its closest neighbor and merges with it upon collision. We propose a mean-field theory…
A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…
Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…
For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…
We study the height of the maximal particle at time $t$ of a one dimensional branching Brownian motion with a space-dependent branching rate. The branching rate is set to zero in finitely many intervals (obstacles) of order $t$. We obtain…
A cyclic random motion at finite velocity with orthogonal directions is considered in the plane and in $\mathbb{R}^3$. We obtain in both cases the explicit conditional distributions of the position of the moving particle when the number of…
We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…
We consider a random walk in a stationary ergodic environment in $\mathbb Z$, with unbounded jumps. In addition to uniform ellipticity and a bound on the tails of the possible jumps, we assume a condition of strong transience to the right…
Let $Q^d$ be the $d$-dimensional binary hypercube. We say that $P=\{v_1,\ldots, v_k\}$ is an increasing path of length $k-1$ in $Q^d$, if for every $i\in [k-1]$ the edge $v_iv_{i+1}$ is obtained by switching some zero coordinate in $v_i$ to…
We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $\mathbb{P}[X \geq…
We prove that for sufficiently large k, there exist $0\le\sigma_k\le\eps_k\to 0$ as $k\to\infty$, such that asymptotically almost surely the first k-regular subgraph appeared in the random graph process where one edge is added at a time has…
We study a random walk that has a drift $\frac{\beta}{d}$ to the right when located at a previously unvisited vertex and a drift $\frac{\mu}{d}$ to the left otherwise. We prove that in high dimensions, for every $\mu$, the drift to the…
The nested Kingman coalescent describes the ancestral tree of a population undergoing neutral evolution at the level of individuals and at the level of species, simultaneously. We study the speed at which the number of lineages descends…
We consider $N$ counters taking integer values which are subject to the following dynamics. At every time, a pair of distinct counters is chosen uniformly at random and their states are updated according to the following rule. If the states…