Related papers: Greedy lattice paths with general weights

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…

For a random walk $S_n$ on $\mathbb{R}^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove…

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…

Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one dimensional integer lattice with zero mean, infinite variance and i.i.d. increments $X_n$. We obtain an upper and lower bounds of the potential function, $a(x)$, of…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

Consider the continuous greedy paths model: given a $d$-dimensional Poisson point process with positive marks interpreted as masses, let $\mathrm P(\ell)$ denote the maximum mass gathered by a path of length $\ell$ starting from the origin.…

This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…

This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…

We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded and bounded away from zero weights. We show that the rescaled passage time $\widetilde{\mathbf T}_{n,X}$ restricted to a compact set $X$ satisfies a…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed…

In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\lambda^{\# \mbox{edges}} n^{\# \mbox{loops}},}$$ where $\lambda, n \in…