Related papers: Relations between scaling exponents in unimodular …
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
In this study we have carried out computer simulations of random walks on Watts-Strogatz-type small world networks and measured the mean number of visited sites and the return probabilities. These quantities were found to obey scaling…
We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…
Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…
We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…
We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…
Einstein-Weyl geometry is a triple (D,g,w), where D is a symmetric connection, [g] is a conformal structure and w is a covector such that: (i) connection D preserves the conformal class [g], that is, Dg=wg; (ii) trace-free part of the…
We introduce the concept of a deterministic walk in a deterministic environment on a countable state space (DWDE). For the deterministic walk in a fixed environment we establish properties analogous to those found in Markov chain theory,…
We study the asymptotic properties of nearest-neighbor random walks in 1d random environment under the influence of an external field of intensity $\lambda\in\mathbb{R}$. For ergodic shift-invariant environments, we show that the limiting…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…
In any dimension $D$, the Euclidean Einstein-Hilbert action, which describes gravity in the absence of matter, can be discretized over random discrete spaces obtained by gluing families of polytopes together in all possible ways. In the…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We have studied $A+A \rightarrow \emptyset$ reaction-diffusion model on a ring, with a bias $\epsilon$ $(0 \leq \epsilon \leq 0.5)$ of the random walkers $A$ to hop towards their nearest neighbor. Though the bias is local in space and time,…
We study several probability distributions relevant to the avalanche dynamics of elastic interfaces driven on a random substrate: The distribution of size, duration, lateral extension or area, as well as velocities. Results from the…
We use the Bethe ansatz equations to calculate the charge stiffness $D_{\rm c} = (L/2) d^2 E_0/d\Phi_{\rm c}^2|_{\Phi_{\rm c}=0}$ of the one-dimensional repulsive-interaction Hubbard model for electron densities close to the Mott insulating…
The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state…
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…
This article provides tools for the study of the Dirichlet random walk in $\mathbb{R}^d$. By this we mean the random variable $W=X_1\Theta_1+\cdots+X_n\Theta_n$ where $X=(X_1,\ldots,X_n) \sim \mathcal{D}(q_1,\ldots,q_n)$ is Dirichlet…
We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…