相关论文: The Last Passage Problem on Graphs

A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…

In this paper, we construct scaling limits of some branching random walks in random environment whose off-spring distributions have infinite variance. The Laplace functional of the obtained random measure is given by a non-linear PAM, whose…

We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…

We study the dynamical aspects of the top rank statistics of particles, performing Brownian motions on a half-line, which are ranked by their distance from the origin. For this purpose, we introduce an observable that we call the overlap…

We use a first-passage time approach to study the statistics of the trapping times induced by persistent motion of active particles colliding with flat boundaries. The angular first-passage time distribution and mean first-passage time is…

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…

We consider a run-and-tumble particle on a half-line with an absorbing target at the origin. The particle has an internal velocity state that switches between two opposite values at Poisson-distributed times. The position of the particle…

Given a graph $G$, we consider a game where two players, $A$ and $B$, alternatingly color edges of $G$ in red and in blue respectively. Let $l(G)$ be the maximum number of moves in which $B$ is able to keep the red and the blue subgraphs…

We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…

Let C(n,k) denote the number of connected graphs with n labeled vertices and n+k-1 edges. For any sequence (k_n), the limit of C(n,k_n) as n tends to infinity is known. It has been observed that, if k_n=o(\sqrt{n}), this limit is…

In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We reformulate the Generalized Proudman--Johnson (GPJ) equation with parameter a in Lagrangian variables, where it takes the form of an inhomogeneous Liouville equation. This allows us to provide an explicitformula for the flow map, up to…

We consider a Lindley process with Laplace distributed space increments. We obtain closed form recursive expressions for the density function of the position of the process and for its first exit time distribution from the domain $[0,h]$.…

We study the gap processes in a degenerate system of three particles interacting through their ranks. We obtain the Laplace transform of the invariant measure of these gaps, and an explicit expression for the corresponding invariant…

We study the extreme value statistics of a one-dimensional resetting Brownian motion (RBM) till its first passage through the origin starting from the position $x_0$ ($>0$). By deriving the exit probability of RBM in an interval $\left[0, M…

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…

Recent result of the numerical simulation of stochastic motion of conservative mechanical or weakly damped Brownian motion subject to conservative forces reveals that, in the case of Gaussian random forces, the path probability depends…