Related papers: Probability of hitting a distant point for the vot…
Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…
We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We establish the discrete approximation to Brownian motion with varying dimension (BMVD in abbreviation) by random walks. The setting is very similar to that in [11], but here we use a different method allowing us to get rid the…
The nearest-neighbor level spacing distribution is numerically investigated by directly diagonalizing disordered Anderson Hamiltonians for systems of sizes up to 100 x 100 x 100 lattice sites. The scaling behavior of the level statistics is…
We study the large deviations of one-dimensional excited random walks. We prove a large deviation principle for both the hitting times and the position of the random walk and give a qualitative description of the respective rate functions.…
We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
We study the first and second orders of the asymptotic expansion, as the dimension goes to infinity, of the moments of the Hilbert-Schmidt norm of a uniformly distributed matrix in the p-Schatten unit ball. We consider the case of matrices…
A rigorous study is carried out for the randomly forced Burgers equation in the inviscid limit. No closure approximations are made. Instead the probability density functions of velocity and velocity gradient are related to the statistics of…
The voter model is a classical interacting particle system, modelling how global consensus is formed by local imitation. We analyse the time to consensus for a particular family of voter models when the underlying structure is a scale-free…
In this paper, we consider the voter model with popularity bias. The influence of each node on its neighbors depends on its degree. We find the consensus probabilities and expected consensus times for each of the states. We also find the…
We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…
Critical catalytic branching random walk on d-dimensional integer lattice is investigated for all d. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is…
We study the one-dimensional Burgers equation in the inviscid limit for Brownian initial velocity (i.e. the initial velocity is a two-sided Brownian motion that starts from the origin x=0). We obtain the one-point distribution of the…
For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…
The q-voter model is a spin-flip system in which the rate of flipping to type i is given by the qth power of the proportion of nearest neighbours in type i for $i=0,1$. If $q=1$ it reduces to the classical voter model. We show that in the…
In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…
In 1962 Dyson used a physically based, macroscopic argument to deduce the first two terms of the large spacing asymptotic expansion of the gap probability for the bulk state of random matrix ensembles with symmetry parameter \beta. In the…
It has been observed that quantum walks on regular lattices can give rise to wave equations for relativistic particles in the continuum limit. In this paper we define the 3D walk as a product of three coined one-dimensional walks. The…