Related papers: The Last Passage Problem on Graphs

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…

We extend a result of Lyons (2016) from fractional tiling of finite graphs to a version for infinite random graphs. The most general result is as follows. Let $\bf P$ be a unimodular probability measure on rooted networks $(G, o)$ with…

We prove a conjecture of Lalley and Sellke [Ann. Probab. 15 (1987)] asserting that the empirical (time-averaged) distribution function of the maximum of branching Brownian motion converges almost surely to a double exponential, or Gumbel,…

The classical inverse first passage time problem asks whether, for a Brownian motion $(B_t)_{t\geq 0}$ and a positive random variable $\xi$, there exists a barrier $b:\mathbb{R}_+\to\mathbb{R}$ such that $\mathbb{P}\{B_s>b(s), 0\leq s \leq…

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…

We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…

The Laplace transform of the $d$-dimensional distribution of Brownian excursion is expressed as the Laplace transform of the $(d+1)$-dimensional distribution of an auxiliary Markov process, started from a $\sigma$-finite measure and with…

We consider an obliquely reflected Brownian motion $Z$ with positive drift in a quadrant stopped at time $T$, where $T:=\inf \{ t>0 : Z(t)=(0,0) \}$ is the first hitting time of the origin. Such a process can be defined even in the…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…

The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…

For a spectrally negative L\'evy process $X$, consider $g_t$, the last time $X$ is below the level zero before time $t\geq 0$. We use a perturbation method for L\'evy processes to derive an It\^o formula for the three-dimensional process…

We provide a new methodology to simulate the first exit times of a vector of Brownian motions from an orthant. This new approach can be used to simulate the first exit times of dimension higher than two. When at least one Brownian motion…

We consider Brownian last passage percolation evolving dynamically via a discrete resampling procedure. Using $\Gamma_{(0,0)}^{(n,n),r}$ to denote a geodesic from $(0,0)$ to $(n,n)$ at time $r$, we prove that the expected total number of…

We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…

Let $\{B(t), t \geq 0\}$ be a standard Brownian motion in $\mathbb{R}$. Let $T$ be the first return time to 0 after hitting 1, and $\{L(T,x), x \in \mathbb{R}\}$ be the local time process at time $T$ and level $x$. The distribution of…

We consider a last-passage directed percolation model in $Z_+^2$, with i.i.d. weights whose common distribution has a finite $(2+p)$th moment. We study the fluctuations of the passage time from the origin to the point $\big(n,n^{\lfloor a…