相关论文: First-passage percolation on ladder-like graphs wi…
We consider the standard model of first-passage percolation on $\mathbb{Z}^d$ ($d\geq 2$), with i.i.d. passage times associated with either the edges or the vertices of the graph. We focus on the particular case where the distribution of…
We present a systematic way to analyze and model systems having many characteristic time-scales. The method we propose is employed for a test-case of a meandering jet model manifesting chaotic tracer dispersion with long time-correlations.…
A general theory is derived for the moments of the first passage time of a one-dimensional Markov process in presence of a weak time-dependent forcing. The linear corrections to the moments can be expressed by quadratures of the potential…
We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$. The set of $\alpha$-orientations of a plane graph has a…
We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…
The first-passage time is proposed as an independent thermodynamic parameter of the statistical distribution that generalizes the Gibbs distribution. The theory does not include the determination of the first passage statistics itself. A…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
There are various models of first passage percolation (FPP) in $\mathbb R^d$. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice $\mathbb Z^d$ to $\mathbb R^d$…
We present general methods to exactly calculate mean-first passage quantities on self-similar networks defined recursively. In particular, we calculate the mean first-passage time and the splitting probabilities associated to a source and…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…
We study the efficiency of a two-channel reaction between two walkers on a finite one-dimensional periodic lattice. The walkers perform a combination of synchronous and asynchronous jumps on the lattice and react instantaneously when they…
The dynamics of a point particle in a periodic array of spherical scatterers converges, in the limit of small scatterer size, to a random flight process, whose paths are piecewise linear curves generated by a Markov process with memory two.…
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high…
We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…
In this paper we present a comprehensive analysis of the solution of the classical problem of finding the distribution density of a random variable - the first passage time to a given domain by the trajectory of a $p$-adic Markov stochastic…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
We investigate some simple and surprising properties of a one-dimensional Brownian trajectory with diffusion coefficient $D$ that starts at the origin and reaches $X$ either: (i) at time $T$ or (ii) for the first time at time $T$. We…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…