Related papers: The Last Passage Problem on Graphs

We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and…

We study the exit time $\tau=\tau_{(0,\infty)}$ for 1-dimensional strictly stable processes and express its Laplace transform at $t^\alpha$ as the Laplace transform of a positive random variable with explicit density. Consequently, $\tau$…

We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…

We consider a particle which moves on the x axis and is subject to a constant force, such as gravity, plus a random force in the form of Gaussian white noise. We analyze the statistics of first arrival at point $x_1$ of a particle which…

We establish a general formula for the Laplace transform of the hitting times of a Gaussian process. Some consequences are derived, and particular cases like the fractional Brownian motion are discussed.

In this paper we consider an equilibrium last-passage percolation model on an environment given by a compound two-dimensional Poisson process. We prove an $\LL^2$-formula relating the initial measure with the last-passage percolation time.…

Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately,…

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

We consider an outward degenerate drifted Brownian motion in the quarter plane with oblique reflections on the boundaries. In this article, we explicitly compute the Laplace transforms of the Green's functions associated with the process.…

A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…

A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

Let X_t be a subordinate Brownian motion, and suppose that the Levy measure of the underlying subordinator has completely monotone density. Under very mild conditions, we find integral formulae for the tail distribution P(\tau_x > t) of…

The global first passage time density of a network is the probability that a random walker released at a random site arrives at an absorbing trap at time T. We find simple expressions for the mean global first passage time <T> for five…

We consider a run-and-tumble particle on a finite interval $[a,b]$ with two absorbing end points. The particle has an internal velocity state that switches between three values $v,0,-v$ at exponential times, thus incorporating positive…

Consider a Poisson process on $\mathbb{R}$ with intensity $f$ where $0 \leq f(x)<\infty$ for ${x}\geq 0$ and ${f(x)}=0$ for $x<0$. The "points" of the process represent sleeping frogs. In addition, there is one active frog initially located…

Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are…

As a first step toward a characterization of the limiting extremal process of branching Brownian motion, we proved in a recent work [Comm. Pure Appl. Math. 64 (2011) 1647-1676] that, in the limit of large time $t$, extremal particles…

A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…

This paper studies Brownian motion subject to the occurrence of a minimal length excursion below a given excursion level. The law of this process is determined. The characterization is explicit and shows by a layer construction how the law…