Related papers: Rate functions for random walks on Random conuctan…
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
We consider on-diagonal heat kernel estimates and the laws of the iterated logarithms for a switch-walk-switch random walk on a lamplighter graph under the condition that the random walk on the underlying graph enjoys sub-Gaussian heat…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
For any graph having a suitable uniform Poincare inequality and volume growth regularity, we establish two-sided Gaussian transition density estimates and parabolic Harnack inequality, for constant speed continuous time random walks…
We consider continuous time simple random walks with arbitrary speed measure $\theta$ on infinite weighted graphs. Write $p_t(x,y)$ for the heat kernel of this process. Given on-diagonal upper bounds for the heat kernel at two points…
We prove upper bounds on the transition probabilities of random walks with i.i.d. random conductances with a polynomial lower tail near $0$. We consider both constant and variable speed models. Our estimates are sharp. As a consequence, we…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We consider the simple random walk on supercritical percolation clusters in the multidimensional cubic lattice. In this model, a quenched large deviation principle holds for the position of the random walk. Its rate function depends on the…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
The relation between the expectation values computed in the random walk theory, and the heat kernel method for the diffusion equation is explained concretely. The random walk is also realized by simulations and their statistical…
We establish heat kernel upper bounds for a continuous-time random walk under unbounded conductances satisfying an integrability assumption, where we correct and extend recent results by the authors to a general class of speed measures. The…
We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…
We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…
We study discrete time random walks in an environment of i.i.d. non-negative bounded conductances in $\mathbb{Z}^d$. We are interested in the anomaly of the heat-kernel decay. We improve recent results and techniques.
It was believed that the Mertens function is a simple random walk in the first versions of the article, so its asymptotic behavior obeys the law of the iterated logarithm. In the latest version of the article we show why the asymptotic…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
We discuss large deviation properties of continuous-time random walks (CTRW) and present a general expression for the large deviation rate in CTRW in terms of the corresponding rates for the distributions of steps' lengths and waiting…