2000 character limit reached
Parrondo-like behavior in continuous-time random walks with memory (1107.2346v3)
Published 12 Jul 2011 in math-ph, cond-mat.stat-mech, math.MP, and q-fin.ST
Abstract: The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as noise, the effect can be thought as a kind of stochastic resonance. The ultimate origin of this phenomenon is the same of the Parrondo's paradox in game theory
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.