Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bold Step Acceptance Mechanism

Updated 23 January 2026
  • Bold Step Acceptance is a probability mechanism where a one-dimensional random walker makes record-dependent moves based on a gamma-controlled function p(y).
  • The mechanism delineates sub-diffusive, diffusive, and ballistic regimes by adjusting the bias at the record, thereby modulating the diffusion exponent.
  • Cycle decomposition analysis links local record decisions to the overall anomalous transport properties without requiring additional noise or degrees of freedom.

Bold step acceptance refers to the probability mechanism that governs the forward progression of a one-dimensional random walker at the record distance from its origin. In the bold/timorous random walk (BTRW), as formalized by Serva, the walker’s movement diverges from the simple symmetric random walk (SSRW) only when at the maximum distance ever attained from the starting point. At these “records,” the walker can either step farther (“bold”) with probability p(Mn)p(M_n) or step back (“timorous”) with probability %%%%1%%%%, where MnM_n denotes the running maximum. The function p(y)=yγ1+yγp(y) = \frac{y^\gamma}{1 + y^\gamma}, parameterized by γR\gamma \in \mathbb{R}, controls the degree of boldness and ultimately dictates the anomalous transport properties and scaling regimes of the process (Serva, 2013).

1. Formal Definition and Transition Rules

At step nn, the walker is at position XnX_n and the running maximum is Mn=max{X0,X1,,Xn}M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}. The stochastic rule for the next step (σn+1=±1\sigma_{n+1} = \pm 1) depends on the relation between Xn|X_n| and MnM_n:

  • If Xn<Mn|X_n| < M_n (“strictly inside the current record”), then

P(σn+1=+1)=P(σn+1=1)=12.P(\sigma_{n+1} = +1) = P(\sigma_{n+1} = -1) = \frac{1}{2}.

  • If Xn=Mn|X_n| = M_n (“on a record”), then

P(σn+1=sign(Xn))=p(Mn),P(\sigma_{n+1} = \operatorname{sign}(X_n)) = p(M_n),

P(σn+1=sign(Xn))=1p(Mn),P(\sigma_{n+1} = -\operatorname{sign}(X_n)) = 1 - p(M_n),

where the function p(y)p(y) is the bold-step acceptance law.

The canonical choice for the law on records is

p(y)=yγ1+yγ,p(y) = \frac{y^\gamma}{1 + y^\gamma},

with γR\gamma \in \mathbb{R}. Positive γ\gamma leads to increasing boldness with depth into unexplored territory, negative γ\gamma to greater timorousness (Serva, 2013).

2. Regimes of Bold and Timorous Behavior

The parameter γ\gamma divides the walker’s behavior into distinct diffusion regimes:

  • Bold regime: For γ>0\gamma > 0, p(y)>1/2p(y) > 1/2 for large yy. The walker favors bold steps, resulting in persistent outward excursions.
  • Timorous regime: For γ<0\gamma < 0, p(y)<1/2p(y) < 1/2 for large yy, so the walker typically reverses at the record, resulting in hesitant, confined motion.
  • Marginal case: At γ=0\gamma = 0, p(y)=1/2p(y) = 1/2, recovering the SSRW with standard diffusive behavior.

This single parameter γ\gamma continuously interpolates between these regimes.

3. Asymptotic Scaling and Diffusion Exponents

The long-time scaling of the mean squared displacement (MSD) Xn2\langle X_n^2 \rangle is governed by the exponent ν(γ)\nu(\gamma) such that

Xn2n2ν(γ).\langle X_n^2 \rangle \sim n^{2\nu(\gamma)}.

The precise dependence of ν(γ)\nu(\gamma) on γ\gamma is a continuous, piecewise function:

$\nu(\gamma) = \begin{cases} \frac{1}{2-\gamma}, & \gamma < 0 \[1ex] \frac{1}{2-2\gamma}, & 0 \le \gamma \le \frac{1}{2} \[1ex] 1, & \gamma > \frac{1}{2} \end{cases}$

The resulting regime structure is:

γ\gamma Diffusion regime Scaling of Xn2\langle X_n^2 \rangle
γ<0\gamma < 0 Sub-diffusive (timorous) n2/(2γ)n^{2/(2-\gamma)} (<n< n)
0<γ<1/20 < \gamma < 1/2 Super-diffusive (bold) n2/(22γ)n^{2/(2-2\gamma)} (>n> n and <n2< n^2)
γ>1/2\gamma > 1/2 Ballistic (strongly bold) n2n^2

The crossover at γ=0\gamma = 0 yields normal diffusion Xn2n\langle X_n^2 \rangle \sim n.

4. Cycle Decomposition and Mechanism

The analytical approach relies on decomposing the walk into cycles that each start with a visit to the current running maximum. Each cycle consists of:

  • A “lazy excursion” of random length m(y)m(y), comprising SSRW statistics inside Xn<y|X_n| < y,
  • An “active excursion” of length n(y)n(y), a run of consecutive outward bold steps, extending the record.

The statistical properties are:

  • For large yy, m(y)m(y) has mean m(y)2y\langle m(y) \rangle \sim 2y and variance Varm(y)83y3\operatorname{Var} m(y) \sim \frac{8}{3} y^3, reflecting SSRW hitting times.
  • n(y)n(y) has a geometric distribution with success probability $1 - p(y)$, so n(y)yγ\langle n(y) \rangle \sim y^\gamma for γ0\gamma \neq 0, with variance O(y2γ)\sim O(y^{2\gamma}).

Aggregating these cycles, the overall scaling of the record evolves as:

  • For γ<0\gamma < 0, the sum of m(yk)m(y_k) is sharply concentrated, yielding deterministic scaling yt1/(2γ)y \sim t^{1/(2-\gamma)}.
  • For 0<γ<1/20 < \gamma < 1/2, heavy-tailed mm-sums give tk2t \sim k^2, yk1/(1γ)y \sim k^{1/(1-\gamma)}, and yt1/(22γ)y \sim t^{1/(2-2\gamma)}.
  • For γ>1/2\gamma > 1/2, the duration is dominated by the record extension itself, yielding ballistic yty \sim t.

Critically, XnX_n and the sequence of running maxima y(n)y(n) share the same scaling exponent, ensuring the validity of the MSD relation (Serva, 2013).

5. Physical Interpretation and Significance

The bold-step acceptance law p(Mn)p(M_n) encapsulates a form of memory-dependent random walk, where the walker’s bias at the record is history dependent and dynamically adjusts with the extremity of the excursion:

  • For increasing p(y)p(y) (i.e., γ>0\gamma > 0), forward records are reinforced by streaks of consecutive outward steps, producing bursty, persistent excursions and driving the process into super-diffusive or ballistic regimes.
  • For decreasing p(y)p(y) (γ<0\gamma < 0), the walker is increasingly hesitant on the frontier, regularly retreating and sampling the surroundings, confining the trajectory and producing sub-diffusive scaling.
  • The special case of γ=0\gamma = 0 reduces precisely to SSRW, with no memory or bias at the frontier.

Through this single mechanism, the model reproduces a continuous spectrum of anomalous transport, directly linking the local decision law at the record to macroscopic transport properties (Serva, 2013).

6. Relation to Anomalous Transport and Minimality

The bold-step acceptance framework exemplifies a minimal generative process for memory-induced anomalous transport. Without introducing additional degrees of freedom or noise structure, the γ\gamma-parameterized law p(y)p(y) smoothly interpolates between distinct universality classes of random walks. The scaling exponents bridge sub-diffusive, standard diffusive, and super-diffusive (ballistic) behaviors, providing a controlled setting for the analytical study of record-dependent and reinforcement-driven random walks (Serva, 2013). This suggests a broad applicability for understanding related phenomena in non-Markovian or self-interacting random processes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Bold Step Acceptance.