Related papers: A Problem in Last-Passage Percolation
For two-dimensional percolation on a domain with the topology of a disc, we introduce a nested-path operator (NP) and thus a continuous family of one-point functions $W_k \equiv \langle \mathcal{R} \cdot k^\ell \rangle $, where $\ell$ is…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…
We show that the laws of scaling limits of nearcritical percolation exploration paths with different parameters are singular with respect to each other. This generalises a result of Nolin and Werner, using a similar technique. As a…
Last passage percolation (LPP) in an $n\times n$ lower triangular domain has nice connections with various generalizations of Schur measures. LPP along an anti-diagonal, from $(1,n)$ to $(n,1)$, gives a distribution of a highest column of a…
Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…
Motivated by an evolutionary biology question, we study the following problem: we consider the hypercube $\{0,1\}^L$ where each node carries an independent random variable uniformly distributed on $[0,1]$, except $(1,1,\ldots,1)$ which…
We consider a random walk in $\mathbb Z^d$ which jumps from a site $x$ to a nearest neighboring site $x+e$ (where $e\in V:=\{x\in\mathbb Z^d: |x|_1=1\}$) with probability $p_0(e)+\epsilon\xi(x,e)$. Here $\sum_e p_0(e)=1$, $p_0(e)> 0$,…
In independent bond percolation on $\mathbb{Z}^d$ with parameter $p$, if one removes the vertices of the infinite cluster (and incident edges), for which values of $p$ does the remaining graph contain an infinite cluster?…
This note establishes a universal directed landscape limit for last passage percolation models in an intermediate scaling regime. We find as a quick consequence the transversal fluctuations for geodesics taken near the axis. We extend the…
In this paper, we investigate statistics on alternating words under correspondence between ``possible reflection paths within several layers of glass'' and ``alternating words''. For $v=(v_1,v_2,\cdots,v_n)\in\mathbb{Z}^{n}$, we say $P$ is…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
Using limit linear series and a result controlling degeneration from separable maps to inseparable maps, we give a formula for the number of self-maps of the projective line with ramification to order e_i at general points P_i, in the case…
A graph $G$ is called $B_k$-VPG, for some constant $k\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the…
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…
Let $\{X_{i}, i\in J\}$ be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum $W=\sum_{i\in J}X_i$ and use Stein's method to establish general upper error…
We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge $(i,j), |i-j|\neq 1 \mod n$ with probability $\rho/n$ for some $\rho>0$ constant. In this paper we add i.i.d. exponential edge weights…
Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.
We investigate some simple and surprising properties of a one-dimensional Brownian trajectory with diffusion coefficient $D$ that starts at the origin and reaches $X$ either: (i) at time $T$ or (ii) for the first time at time $T$. We…