Related papers: The Klee-Minty random edge chain moves with linear…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
The kinetics of the annihilation process, $A+A\to 0$, with ballistic particle motion is investigated when the distribution of particle velocities is {\it discrete}. This discreteness is the source of many intriguing phenomena. In the mean…
We present a Hamilton cycle in the $k$-sided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations $\pi = p_1p_2\cdots p_n$, where each $p_i$ has an associated colour in…
Dynamics of relativistic outflows along the rotation axis of a Kerr black hole is investigated using a simple model that takes into account the relativistic tidal force of the central source as well as the Lorentz force due to the…
We finely describe the speed of "coming down from infinity" for birth and death processes which eventually become extinct. Under general assumptions on the birth and death rates, we firstly determine the behavior of the successive hitting…
We consider a random trial-based telegraph process, which describes a motion on the real line with two constant velocities along opposite directions. At each epoch of the underlying counting process the new velocity is determined by the…
We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…
We study the properties of a relativistic model with logarithmic nonlinearity. We show that such model allows two types of solutions: topologically trivial (gaussons) and topologically non-trivial (kinks), depending on a sign of the…
Let $G$ be any graph of minimum degree at least $k$, and let $G_p$ be the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. Recently, Krivelevich, Lee and Sudakov showed that if $pk\to\infty$ then with…
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…
Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width.…
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…
A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be…
We propose a minimal nonlinear model of brittle crack propagation by considering only the motion of the crack-tip atom. The model captures many essential features of steady-state crack velocity and is in excellent quantitative agreement…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We…
Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…