相关论文: Differences between Lyapunov exponents for the sim…

As a model of market price, we introduce a new type of random walk in a moving potential which is approximated by a quadratic function with its center given by the moving average of its own trace. The properties of resulting random walks…

We have studied the diffusion of a single particle on a one-dimensional lattice. It is shown that, for a self-similar distribution of hopping rates, the time dependence of the mean-square displacement follows an anomalous power law…

The famous Bernoulli shift (or dyadic transformation) is perhaps the simplest deterministic dynamical system exhibiting chaotic dynamics. It is a piecewise linear time-discrete map on the unit interval with a uniform slope larger than one,…

The Riemann walk is the lattice version of the Levy flight. For the one-dimensional Riemann walk of Levy exponent 0<\alpha<2 we study the statistics of the support, i.e. the set of visited sites, after t steps. We consider a wide class of…

For a better understanding of the chaotic behavior of systems of many moving particles it is useful to look at other systems with many degrees of freedom. An interesting example is the high-dimensional Lorentz gas, which, just like a system…

We show that the probability distribution function that best fits the distribution of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space deviates from the exponential statistics by a…

We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.

Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…

We study the persistence exponent for random walks in random sceneries (RWRS) with integer values and for some special random walks in random environment in $\mathbb Z^2$ including random walks in $\mathbb Z^2$ with random orientations of…

We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for…

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

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…

It is frequently asserted that in a chaotic system two initially close points will separate at an exponential rate governed by the largest global Lyapunov exponent. Local Lyapunov exponents, however, are more directly relevant to…

The present paper provides an overview of results obtained in four recent papers by the authors. These papers address the problem of intermittency for the Parabolic Anderson Model in a \emph{time-dependent random medium}, describing the…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…

We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…

Let $X_1,X_2, \ldots $ be a sequence of $i.i.d$ real (complex) $d \times d $ invertible random matrices with common distribution $\mu$ and $\sigma_1(n), \sigma_2(n), \ldots , \sigma_d(n)$ be the singular values, $\lambda_1(n), \lambda_2(n),…

A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…