相关论文: Counting planar random walk holes

We investigate the minimal local time $f(n)$ of a one-dimensional simple random walk up to time $n$, defined as the smallest number of visits to any site in the range. A conjecture formulated repeatedly by Erd\H{o}s and R\'{e}v\'{e}sz…

A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…

For a given natural number $n$, the second part of Hilbert's 16th Problem asks whether there exists a finite upper bound for the maximum number of limit cycles that planar polynomial vector fields of degree $n$ can have. This maximum number…

A decoupled standard random walk is a sequence of independent random variables $(\hat{S}_n)_{n \geq 1}$ such that, for each $n \geq 1$, the distribution of $\hat{S}_n$ is the same as that of $S_n = \xi_1 + \ldots + \xi_n$, where $(\xi_k)_{k…

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

In this paper, we mainly concerned about deriving the general formula to count the possible positions of $n$ step random walk in $\mathbb{Z}^d$ with unit length in each step, which we denoted as $|P_n^{d}|$. For our results, we firstly…

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $\mathbb{Z}^d$, $d\geq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk…

In this short lecture, we compute asymptotics of orthogonal polynomials, from a saddle point approximation. This is an example of a calculation which shows the link between integrability, algebraic geometry and random matrices.

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

Let $L_n^{X}(x)$ denote the number of visits to $x \in {\bf Z}^2$ of the simple planar random walk $X$, up till step $n$. Let $X'$ be another simple planar random walk independent of $X$. We show that for any $0<b<1/(2 \pi)$, there are…

Let $(X_t, t \geq 0)$ be an $\alpha$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t \delta_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self-…

We compute analytically the mean number of common sites, W_N(t), visited by N independent random walkers each of length t and all starting at the origin at t=0 in d dimensions. We show that in the (N-d) plane, there are three distinct…

Given a sequence of complex numbers {\rho}_n, we study the asymptotic distribution of the sets of parameters c {\epsilon} C such that the quadratic maps z^2 +c has a cycle of period n and multiplier {\rho}_n. Assume 1/n.log|{\rho}_n| tends…

We analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the…

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…