Related papers: The Last Passage Problem on Graphs
We study the statistics of random functionals $\mathcal{Z}=\int_{0}^{\mathcal{T}}[x(t)]^{\gamma-2}dt$, where $x(t)$ is the trajectory of a one-dimensional Brownian motion with diffusion constant $D$ under the effect of a logarithmic…
Starting from the hyperbolic Brownian motion as a time-changed Brownian motion, we explore a set of probabilistic models--related to the SABR model in mathematical finance--which can be obtained by geometry-preserving transformations, and…
Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…
Let $G=(V,E)$ be a graph on $n$ vertices, and let $\lambda_1(L(G))\ge \cdots\ge \lambda_{n-1}(L(G))\ge \lambda_n(L(G))=0$ be the eigenvalues of its Laplacian matrix $L(G)$. Brouwer conjectured that for every $1\le k\le n$, $\sum_{i=1}^k…
We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…
This survey is a collection of various results and formulas by different authors on the areas (integrals) of five related processes, viz.\spacefactor =1000 Brownian motion, bridge, excursion, meander and double meander; for the Brownian…
We study the extreme value statistics of first-passage trajectories generating from a one-dimensional drifted Brownian motion subject to stochastic resetting to the starting point with a constant rate $r$. Each stochastic trajectory starts…
Let $\Gamma$ be a graph and $P$ be a reversible random walk on $\Gamma$. From the $L^2$ analyticity of the Markov operator $P$, we deduce that an iterate of odd exponent of $P$ is `lazy', that is there exists an integer $k$ such that the…
Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for…
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
We discuss the order of the variance on a lattice analogue of the Hammersley process with boundaries, for which the environment on each site has independent, Bernoulli distributed values. The last passage time is the maximum number of…
A regime-switching geometric Brownian motion is used to model a geometric Brownian motion with its coefficients changing randomly according to a Markov chain. In this work, we give a complete characterization of the recurrent property of…
In this paper, a study of random times on filtered probability spaces is undertaken. The main message is that, as long as distributional properties of optional processes up to the random time are involved, there is no loss of generality in…
We consider issues associated with the Lagrangian characterisation of flow structures arising in aperiodically time-dependent vector fields that are only known on a finite time interval. A major motivation for the consideration of this…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
We study the statistical properties of the physical action $S$ for random graphs, by treating the number of neighbors at each vertex of the graph (degree), as a scalar field. For each configuration (run) of the graph we calculate the…
We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
Let $G = (V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say that $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A…