Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPassage times, exit times and Dirichlet problems for open quantum walks
223
0
0.0
(
0
)
Authors
Ivan Bardet
Ask ChatGPT about the research
No Arabic abstract
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the expectation of that passage time, and the expectation of the number of visits, and discuss the notion of recurrence for open quantum walks. We also study exit times and exit probabilities from a finite domain, and use them to solve Dirichlet problems and to determine harmonic measures. We consider in particular the case of irreducible open quantum walks. The results we obtain extend those for classical Markov chains.
rate research
Read More
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads to consider Discrete Fourier Transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums, and allows the use of efficient algorithms based on the Fast Fourier Transform. The wave functions here obtained govern the probability of finding the particle at any given location, but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
We study a stochastic process $X_t$ related to the Bessel and the Rayleigh processes, with various applications in physics, chemistry, biology, economics, finance and other fields. The stochastic differential equation is $dX_t = (nD/X_t) dt + sqrt{2D} dW_t$, where $W_t$ is the Wiener process. Due to the singularity of the drift term for $X_t = 0$, different natures of boundary at the origin arise depending on the real parameter $n$: entrance, exit, and regular. For each of them we calculate analytically and numerically the probability density functions of first-passage times or first-exit times. Nontrivial behaviour is observed in the case of a regular boundary.
In this paper we prove a duality relation between coalescence times and exit points in last-passage percolation models with exponential weights. As a consequence, we get lower bounds for coalescence times with scaling exponent 3/2, and we relate its distribution with variational problems involving the Brownian motion process and the Airy process.
Let $mathbb{hat{E}}$ be the upper expectation of a weakly compact but non-dominated family $mathcal{P}$ of probability measures. Assume that $Y$ is a $d$-dimensional $mathcal{P}$-semimartingale under $mathbb{hat{E}}$. Given an open set $Qsubsetmathbb{R}^{d}$, the exit time of $Y$ from $Q$ is defined by [ {tau}_{Q}:=inf{tgeq0:Y_{t}in Q^{c}}. ] The main objective of this paper is to study the quasi-continuity properties of ${tau}_{Q}$ under the nonlinear expectation $mathbb{hat{E}}$. Under some additional assumptions on the growth and regularity of $Y$, we prove that ${tau}_{Q}wedge t$ is quasi-continuous if $Q$ satisfies the exterior ball condition. We also give the characterization of quasi-continuous processes and related properties on stopped processes. In particular, we get the quasi-continuity of exit times for multi-dimensional $G$-martingales, which nontrivially generalizes the previous one-dimensional result of Song.
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition that the random walk is transient at the target site, and independently of the small-world, scale free or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network, since the target averaged GMFPT satisfies much more restrictive bounds, which forbid any sublinear scaling with the network size.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
