Related papers: The oriented swap process and last passage percola…
In this paper we study stationary last passage percolation (LPP) in half-space geometry. We determine the limiting distribution of the last passage time in a critical window close to the origin. The result is a new two-parameter family of…
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
Many random growth models have the property that the set of discovered sites, scaled properly, converges to some deterministic set as time grows. Such results are known as shape theorems. Typically, not much is known about the shapes. For…
In exponential last passage percolation, we consider the rescaled Busemann process $x\mapsto N^{-1/3}B^\rho_{0,[xN^{2/3}]e_1} \,\, (x\in\mathbb{R})$, as a process parametrized by the scaled density $\rho=1/2+\frac{\mu}{4} N^{-1/3}$, and…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
We consider point to point last passage times to every vertex in a neighbourhood of size $\delta N^{\frac{2}{3}}$, distance $N$ away from the starting point. The increments of these last passage times in this neighbourhood are shown to be…
Let $\{X(v), v \in \Bbb Z^d \times \Bbb Z_+\}$ be an i.i.d. family of random variables such that $P\{X(v)= e^b\}=1-P\{X(v)= 1\} = p$ for some $b>0$. We consider paths $\pi \subset \Bbb Z^d \times \Bbb Z_+$ starting at the origin and with…
We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…
We survey some results and applications of last percolation models of which the limiting distribution can be evaluated.
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…
We study two different types of vector point processes with interacting components, introducing a migration-type effect. The first case concerns two groups which modify their states with rate functions depending on time only. This yields a…
We consider consistent particle systems, which include independent random walkers, the symmetric exclusion and inclusion processes, as well as the dual of the KMP model. Consistent systems are such that the distribution obtained by first…
Our work is motivated by Bourque and Pevzner's (2002) simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk on the group of…
Two-dimensional bin packing problems are highly relevant combinatorial optimization problems. They find a large number of applications, for example, in the context of transportation or warehousing, and for the cutting of different materials…
This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on two classes of traveling salesman problems. The algorithm shares main features of the famous Max-Min Ant System with iteration-best reinforcement. For simple…
Word order evolution has been hypothesized to be constrained by a word order permutation ring: transitions involving orders that are closer in the permutation ring are more likely. The hypothesis can be seen as a particular case of…
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…