Search results for "Random walk"
showing 10 items of 132 documents
Rare events and scaling properties in field-induced anomalous dynamics
2012
We show that, in a broad class of continuous time random walks (CTRW), a small external field can turn diffusion from standard into anomalous. We illustrate our findings in a CTRW with trapping, a prototype of subdiffusion in disordered and glassy materials, and in the L\'evy walk process, which describes superdiffusion within inhomogeneous media. For both models, in the presence of an external field, rare events induce a singular behavior in the originally Gaussian displacements distribution, giving rise to power-law tails. Remarkably, in the subdiffusive CTRW, the combined effect of highly fluctuating waiting times and of a drift yields a non-Gaussian distribution characterized by long sp…
Multicanonical Monte Carlo simulations
1998
Canonical Monte Carlo simulations of disordered systems like spin glasses and systems undergoing first-order phase transitions are severely hampered by rare event states which lead to exponentially diverging autocorrelation times with increasing system size and hence to exponentially large statistical errors. One possibility to overcome this problem is the multicanonical reweighting method. Using standard local update algorithms it could be demonstrated that the dependence of autocorrelation times on the system size V is well described by a less divergent power law, τ∝Vα, with 1<α<3, depending on the system. After a brief review of the basic ideas, combinations of multicanonical reweighting…
Random walk approach to the analytic solution of random systems with multiplicative noise—The Anderson localization problem
2006
We discuss here in detail a new analytical random walk approach to calculating the phase-diagram for spatially extended systems with multiplicative noise. We use the Anderson localization problem as an example. The transition from delocalized to localized states is treated as a generalized diffusion with a noise-induced first-order phase transition. The generalized diffusion manifests itself in the divergence of averages of wavefunctions (correlators). This divergence is controlled by the Lyapunov exponent $\gamma$, which is the inverse of the localization length, $\xi=1/\gamma$. The appearance of the generalized diffusion arises due to the instability of a fundamental mode corresponding to…
Grover Search with Lackadaisical Quantum Walks
2015
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Kempe, and Rivosh (2005) coin, adding self-loops simply slows down the search. These coins also diffe…
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing
2011
Abstract Although random walks (RWs) with single-step transitions have been extensively studied for almost a century as seen in Feller (1968), problems involving the analysis of RWs that contain interleaving random steps and random “jumps” are intrinsically hard. In this article, we consider the analysis of one such fascinating RW, where every step is paired with its counterpart random jump. In addition to this RW being conceptually interesting, it has applications in testing of entities (components or personnel), where the entity is never allowed to make more than a prespecified number of consecutive failures. The article contains the analysis of the chain, some fascinating limiting proper…
On the stability and ergodicity of adaptive scaling Metropolis algorithms
2011
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Donsker-Type Theorem for BSDEs: Rate of Convergence
2019
In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed
Deducing self-interaction in eye movement data using sequential spatial point processes
2016
Eye movement data are outputs of an analyser tracking the gaze when a person is inspecting a scene. These kind of data are of increasing importance in scientific research as well as in applications, e.g. in marketing and man-machine interface planning. Thus the new areas of application call for advanced analysis tools. Our research objective is to suggest statistical modelling of eye movement sequences using sequential spatial point processes, which decomposes the variation in data into structural components having interpretation. We consider three elements of an eye movement sequence: heterogeneity of the target space, contextuality between subsequent movements, and time-dependent behaviou…
Random walk approximation of BSDEs with H{\"o}lder continuous terminal condition
2018
In this paper, we consider the random walk approximation of the solution of a Markovian BSDE whose terminal condition is a locally Hölder continuous function of the Brownian motion. We state the rate of the L2-convergence of the approximated solution to the true one. The proof relies in part on growth and smoothness properties of the solution u of the associated PDE. Here we improve existing results by showing some properties of the second derivative of u in space. peerReviewed