相关论文: Hitting and Trapping Times on Branched Structures

We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…

The generalized master equation or the equivalent continuous time random walk equations can be used to compute the macroscopic first passage time distribution (FPTD) of a complex stochastic system from short-term microscopic simulation…

This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…

Transport is an important function of networks. Studying transport efficiency sheds light on the dynamic processes occurring within various underlying structures and offers a wide range of applications. To construct networks with different…

We study the simple random walk on the $n$-dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly-rescaled hitting time is asymptotically…

We study discrete random walks on the NFSFT and provide new methods to calculate the analytic solutions of the MFPT for any pair of nodes, the MTT for any target node and MDT for any source node. Further more, using the MTT and the MDT as…

Motivated by applications in telecommunications, computer scienceand physics, we consider a discrete-time Markov process withrestart. At each step the process eitherwith a positive probability restarts from a given distribution, orwith the…

We study the mean first-passage time (MFPT) for asymmetric continuous-time random walks in continuous-space characterised by waiting-times with finite mean and by jump-sizes with both finite mean and finite variance. In the asymptotic…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting…

For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x,…

First hitting times (FHTs) describe the time it takes a random "searcher" to find a "target" and are used to study timescales in many applications. FHTs have been well-studied for diffusive search, especially for small targets, which is…

Working withing the framework of Hopf algebras, a random walk and the associated diffusion equation are constructed on a space that is algebraically described as the merging of the real line algebra with the anyonic line algebra.…

Let $T\$ be a stopping time associated with a sequence of independent random variables $Z_{1},Z_{2},...$ . By applying a suitable change in the probability measure we present relations between the moment or probability generating functions…

We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace…

Under very general conditions the hitting time of a set by a stochastic process is a stopping time. We give a new simple proof of this fact. The section theorems for optional and predictable sets are easy corollaries of the proof.

We investigate the convergence of hitting times for jump-diffusion processes. Specifically, we study a sequence of stochastic differential equations with jumps. Under reasonable assumptions, we establish the convergence of solutions to the…

We consider the symmetric exclusion process {\eta_t,t>0} on {0,1}^{Z^d}. We fix a pattern A:={\eta:\sum_{\Lambda}\eta(i)\ge k}, where \Lambda is a finite subset of Z^d and k is an integer, and we consider the problem of establishing sharp…

We consider the hard-core model with Metropolis transition probabilities on finite grid graphs and investigate the asymptotic behavior of the first hitting time between its two maximum-occupancy configurations in the low-temperature regime.…