相关论文: Elementary potential theory on the hypercube

The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…

Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

We consider harmonic measures that arise from random walks on the mapping class group determined by probability distributions that have finite first moment with respect to the Teichmuller metric, and whose supports generate non-elementary…

We show that almost any one-dimensional projection of a suitably scaled random walk on a hypercube, inscribed in a hypersphere, converges weakly to an Ornstein-Uhlenbeck process as the dimension of the sphere tends to infinity. We also…

Random walkers absorbing on a boundary sample the Harmonic Measure linearly and independently: we discuss how the recurrence times between impacts enable non-linear moments of the measure to be estimated. From this we derive a new technique…

Let $\lambda$ be a probability measure on $\mathbb T^{n-1}$ where $n=2$ or 3. Suppose $\lambda$ is invariant, ergodic and has positive entropy with respect to the linear transformation defined by a hyperbolic matrix. We get a measure $\mu $…

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$ and $\tilde Z_n(t)=\int…

A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…

We generalize the Metropolis et al. random walk algorithm to the situation where the energy is noisy and can only be estimated. Two possible applications are for long range potentials and for mixed quantum-classical simulations. If the…

The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…

We review the recent progress in studying the quantum structure of $6D$, ${\cal N}=(1,0)$ and ${\cal N}=(1,1)$ supersymmetric gauge theories formulated through unconstrained harmonic superfields. The harmonic superfield approach allows one…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

Single particles moving in a reflection-asymmetric potential are investigated by solving the Schr\"{o}dinger equation of the reflection-asymmetric Nilsson Hamiltonian with the imaginary time method in 3D lattice space and the harmonic…

We investigate the minimal error in approximating a general probability measure $\mu$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In…

We consider a random walk in a truncated cone $K_N$, which is obtained by slicing cone $K$ by a hyperplane at a growing level of order $N$. We study the behaviour of the Green function in this truncated cone as $N$ increases. Using these…