Search

On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three favorite sites occur simultaneously infinitely often and eventually there is no simultaneous occurrence of four favorite sites. For $d\geq 3$, we derive sharp asymptotics of the number of favorite sites. This answers an open question of Erd\H{o}s and R\'{e}v\'{e}sz (1987), which was brought up again in Dembo (2005)., Comment: 46 pages, 3 figures

In this paper, it is shown that $\alpha$-permanent in algebra is closely related to loop soup in probability. We give explicit expansions of $\alpha$-permanents of the block matrices obtained from matrices associated to $*$-forests, which are a special class of matrices containing tridiagonal matrices. It is proved in two ways, one is the direct combinatorial proof, and the other is the probabilistic proof via loop soup., Comment: 9 pages, 1 figure; to appear in Electronic Communications in Probability

The main interest of this article is the one-sided boundedness of the local discrepancy of $\alpha\in\mathbb{R}\setminus\mathbb{Q}$ on the interval $(0,c)\subset(0,1)$ defined by \[D_n(\alpha,c)=\sum_{j=1}^n 1_{\{\{j\alpha\}

Roughly speaking, regular subspaces are regular Dirichlet forms that inherit the original forms with smaller domains. In this paper, regular subspaces of 1-dim symmetric $\alpha$-stable processes are considered. The main result is that it admits proper regular subspaces if and only if $\alpha\in [1,2]$. Moreover, for $\alpha\in(1,2)$, the characterization of the regular subspaces is given. General 1-dim symmetric L\'evy processes will also be investigated. It will be shown that whether it has proper regular subspaces is closely related to whether its sample paths have finite variation., Comment: 20 pages

In this paper, we first introduce the Ray-Knight identity and percolation Ray-Knight identity related to loop soup with intensity $\alpha (\ge 0)$ on trees. Then we present the inversions of the above identities, which are expressed in terms of repelling jump processes. In particular, the inversion in the case of $\alpha=0$ gives the conditional law of a Markov jump process given its local time field. We further show that the fine mesh limits of these repelling jump processes are the self-repelling diffusions \cite{Aidekon} involved in the inversion of the Ray-Knight identity on the corresponding metric graph. This is a generalization of results in \cite{2016Inverting,lupu2019inverting,LupuEJP657}, where the authors explore the case of $\alpha=1/2$ on a general graph. Our construction is different from \cite{2016Inverting,lupu2019inverting} and based on the link between random networks and loop soups., Comment: 33 pages, 2 figures