相关论文: The Dynamical Discrete Web

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

A discrete-time Quantum Walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). In this paper, we study the…

Let $W$ be an integer valued random variable satisfying $E[W] =: \delta \geq 0$ and $P(W<0)>0$, and consider a self-interacting random walk that behaves like a simple symmetric random walk with the exception that on the first visit to any…

We perform a minisuperspace analysis of an information-theoretic nonlinear Wheeler-deWitt (WDW) equation for de Sitter universes. The nonlinear WDW equation, which is in the form of a difference-differential equation, is transformed into a…

We introduce and simulate the random walk that adapts move strategies according to local node preferences on a directed graph. We consider graphs with double-hierarchical connectivity and variable wiring diagram in the universality class of…

We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering…

In this paper, we claim that a common underlying structure--a skeleton structure--is present behind discrete-time quantum walks (QWs) on a one-dimensional lattice with a homogeneous coin matrix. This skeleton structure is independent of the…

In the context of order statistics of discrete time random walks (RW), we investigate the statistics of the gap, $G_n$, and the number of time steps, $L_n$, between the two highest positions of a Markovian one-dimensional random walker,…

Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…

Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…

Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…

We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

The uniform spanning tree (UST) and the loop-erased random walk (LERW) are related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling…

In recent years, several experiments highlighted a new type of diffusion anomaly, which was called Brownian yet non-Gaussian diffusion. In systems displaying this behavior, the mean squared displacement of the diffusing particles grows…

The purpose of this paper is to investigate the asymptotic behavior of the multi-dimensional elephant random walk (MERW). It is a non-Markovian random walk which has a complete memory of its entire history. A wide range of literature is…

We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…

The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modelling a plethora of relevant aspects in…