Bold Step Acceptance Mechanism

• 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(M_n)$ or step back (“timorous”) with probability $1-p(M_n)$, where $M_n$ denotes the running maximum. The function $p(y) = \frac{y^\gamma}{1 + y^\gamma}$, parameterized by $\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 $n$, the walker is at position $X_n$ and the running maximum is $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$. The stochastic rule for the next step ($\sigma_{n+1} = \pm 1$) depends on the relation between $|X_n|$ and $1-p(M_n)$0:

• If $1-p(M_n)$1 (“strictly inside the current record”), then

$1-p(M_n)$2

• If $1-p(M_n)$3 (“on a record”), then

$1-p(M_n)$4

$1-p(M_n)$5

where the function $1-p(M_n)$6 is the bold-step acceptance law.

The canonical choice for the law on records is

$1-p(M_n)$7

with $1-p(M_n)$8. Positive $1-p(M_n)$9 leads to increasing boldness with depth into unexplored territory, negative $M_n$0 to greater timorousness (Serva, 2013).

2. Regimes of Bold and Timorous Behavior

The parameter $M_n$1 divides the walker’s behavior into distinct diffusion regimes:

• Bold regime: For $M_n$2, $M_n$3 for large $M_n$4. The walker favors bold steps, resulting in persistent outward excursions.
• Timorous regime: For $M_n$5, $M_n$6 for large $M_n$7, so the walker typically reverses at the record, resulting in hesitant, confined motion.
• Marginal case: At $M_n$8, $M_n$9, recovering the SSRW with standard diffusive behavior.

This single parameter $p(y) = \frac{y^\gamma}{1 + y^\gamma}$0 continuously interpolates between these regimes.

3. Asymptotic Scaling and Diffusion Exponents

The long-time scaling of the mean squared displacement (MSD) $p(y) = \frac{y^\gamma}{1 + y^\gamma}$1 is governed by the exponent $p(y) = \frac{y^\gamma}{1 + y^\gamma}$2 such that

$p(y) = \frac{y^\gamma}{1 + y^\gamma}$3

The precise dependence of $p(y) = \frac{y^\gamma}{1 + y^\gamma}$4 on $p(y) = \frac{y^\gamma}{1 + y^\gamma}$5 is a continuous, piecewise function:

$p(y) = \frac{y^\gamma}{1 + y^\gamma}$6

The resulting regime structure is:

$p(y) = \frac{y^\gamma}{1 + y^\gamma}$7	Diffusion regime	Scaling of $p(y) = \frac{y^\gamma}{1 + y^\gamma}$8
$p(y) = \frac{y^\gamma}{1 + y^\gamma}$9	Sub-diffusive (timorous)	$\gamma \in \mathbb{R}$0 ($\gamma \in \mathbb{R}$1)
$\gamma \in \mathbb{R}$2	Super-diffusive (bold)	$\gamma \in \mathbb{R}$3 ($\gamma \in \mathbb{R}$4 and $\gamma \in \mathbb{R}$5)
$\gamma \in \mathbb{R}$6	Ballistic (strongly bold)	$\gamma \in \mathbb{R}$7

The crossover at $\gamma \in \mathbb{R}$8 yields normal diffusion $\gamma \in \mathbb{R}$9.

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 $n$0, comprising SSRW statistics inside $n$1,
• An “active excursion” of length $n$2, a run of consecutive outward bold steps, extending the record.

The statistical properties are:

• For large $n$3, $n$4 has mean $n$5 and variance $n$6, reflecting SSRW hitting times.
• $n$7 has a geometric distribution with success probability $n$8, so $n$9 for $X_n$0, with variance $X_n$1.

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

• For $X_n$2, the sum of $X_n$3 is sharply concentrated, yielding deterministic scaling $X_n$4.
• For $X_n$5, heavy-tailed $X_n$6-sums give $X_n$7, $X_n$8, and $X_n$9.
• For $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$0, the duration is dominated by the record extension itself, yielding ballistic $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$1.

Critically, $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$2 and the sequence of running maxima $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$3 share the same scaling exponent, ensuring the validity of the MSD relation (Serva, 2013).

5. Physical Interpretation and Significance

The bold-step acceptance law $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$4 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 $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$5 (i.e., $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$6), 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 $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$7 ($M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$8), 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 $M_n = \max\{|X_0|, |X_1|, \ldots, |X_n|\}$9 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 $\sigma_{n+1} = \pm 1$0-parameterized law $\sigma_{n+1} = \pm 1$1 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.