Results 31 to 40 of about 430,069 (325)
Mixing times and moving targets [PDF]
We consider irreducible Markov chains on a finite state space. We show that the mixing time of any such chain is equivalent to the maximum, over initial states $x$ and moving large sets $(A_s)_s$, of the hitting time of $(A_s)_s$ starting from $x$.
Sousi, Perla, Winkler, Peter
core +1 more source
Quantum walks on quotient graphs [PDF]
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states ...
A. M. Childs +13 more
core +2 more sources
Poincaré inequalities and hitting times
Equivalence of the spectral gap, exponential integrability of hitting times and Lyapunov conditions are well known. We give here the correspondance (with quantitative results) for reversible diffusion processes. As a consequence, we generalize results of Bobkov in the one dimensional case on the value of the Poincar constant for logconcave measures ...
Cattiaux, Patrick +2 more
openaire +6 more sources
This study was conducted to clarify relationship between putter head motions of golf and ball hitting direction, distance with use of statistical techniques.
Tomoya YOSHIDA, Masaki HOKARI
doaj +1 more source
Statistical analysis of random walks on network
This paper describes an investigation of analytical formulas for parameters in random walks. Random walks are used to model situations in which an object moves in a sequence of steps in randomly chosen directions.
A. Kalikova
doaj
Tail probability of the hitting time of Brownian motion to a sphere with fixed hitting sites [PDF]
We consider \(d\)-dimensional Brownian motion \(\{B_\mu(t)\}_{t\geqq0}\) with a drift \(\mu\in\mathbb{R}^d\) and the first hitting time \(\sigma_{r,\mu}^{(d)}\) to the sphere with radius \(r\) centered at the origin.
Yuji Hamana
doaj +1 more source
Inverse functions for Monte Carlo simulations with applications to hitting time distributions
Random sampling is a ubiquitous tool in simulations and modeling in a variety of applications. There are efficient algorithms for several known distributions, but in general, one must resort to computing or approximating the inverse of the distributions ...
Avishai Ben‐David, Raghu Raghavan
doaj +1 more source
Convolution-type derivatives, hitting-times of subordinators and time-changed $C_0$-semigroups [PDF]
In this paper we will take under consideration subordinators and their inverse processes (hitting-times). We will present in general the governing equations of such processes by means of convolution-type integro-differential operators similar to the ...
AI Saichev +29 more
core +1 more source
On some dynamical features of the complete Moran model for neutral evolution in the presence of mutations [PDF]
We present a version of the classical Moran model, in which mutations are taken into account; the possibility of mutations was introduced by Moran in his seminal paper, but it is more often overlooked in discussing the Moran model.
Giuseppe Gaeta
doaj +1 more source
Mixing Times are Hitting Times of Large Sets [PDF]
We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent to the maximum over initial states x and large sets A of the hitting time of A starting from x.
Peres, Yuval, Sousi, Perla
openaire +2 more sources

