Skip to content

Continuous-Time Random Walk

A jump-process model that interleaves random state displacements with random waiting times, turning an event-indexed walk into a trajectory indexed by continuous calendar time.

Version
v1 · 2026-10-03 · History
Domain-specific #
13088
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Stochastic Processes, Anomalous Transport → Mathematics
Aliases
CTRW

Core Idea

A continuous-time random walk (CTRW) is a jump-process model with random waits between random displacements. If jump times are \(T_n=\sum_{i=1}^n\tau_i\) and \(N(t)\) counts completed jumps, a standard waiting-then-jumping path is \(X(t)=X(0)+\sum_{i=1}^{N(t)}J_i\). Continuous Time does not mean a continuous path: the walker may rest and then jump. Independence of waits and increments is the separable model, not a universal CTRW property.[^ref-5c9ce390d2ff]

Scope of Application

Scher and Montroll model amorphous-solid carrier transit with field-biased random hops and a hopping-time distribution. Berkowitz, Scher and Silliman model laboratory heterogeneous porous-medium breakthrough curves with a CTRW first-passage formalism. In both cases the same wait–jump architecture organizes a different physical carrier and observable; fitted laws and microscopic mechanisms are not thereby identical.[ref-58c01dccc1c4][ref-154221629965]

Clarity

Distinguish the event index \(n\) from calendar time \(t\). A walk with simple jump statistics can have nontrivial elapsed-time behavior because \(N(t)\) is random. Declare whether waiting and displacement are independent before using a separable Montroll–Weiss calculation. Broad waiting laws can produce sublinear jump counts; subdiffusion, superdiffusion, fractional equations and finite variance each need additional hypotheses.[ref-5c9ce390d2ff][ref-9ac430cbe94a]

Manages Complexity

The model compresses variable residence and transition histories into a random clock plus jump law. This made it useful for both dispersed photocurrent transits and heterogeneous transport breakthrough curves. It is an effective representation, not by itself a proof of which physical trap or flow structure caused observed tails.[ref-58c01dccc1c4][ref-154221629965]

Abstract Reasoning

Choose the state carrier, waiting-time and jump laws, any coupling, and a rule assigning the state between jump epochs. Construct \(T_n\), \(N(t)\) and \(X(t)\) before deriving a propagator or first-passage law. Exponential waits, Markovianity, anomalous scaling and fractional limits are optional conditions, not defining requirements. The proposed strict live parent is Continuous-time Stochastic Process, because CTRW adds the wait–jump construction to a real-time indexed random process.[ref-5c9ce390d2ff][ref-9ac430cbe94a]

Knowledge Transfer

In amorphous solids, the walker is a carrier and the random duration is a hopping time. In porous media, the walker is a migrating tracer and the duration is a heterogeneous transition time. Both map to jump state → random wait → random increment → observation-time path, without transferring one system's parameter values or physical causes to the other.[ref-58c01dccc1c4][ref-154221629965]

[^ref-5c9ce390d2ff]: MIT 18.366, “Lecture 23: Continuous Time Random Walks”, original course notes (2006), §2 pp.4–5 and §3 pp.5–7. [^ref-58c01dccc1c4]: Harvey Scher and Elliott W. Montroll, “Anomalous transit-time dispersion in amorphous solids”, Physical Review B 12 (1975), 2455, publisher abstract; full article access limited. [^ref-154221629965]: Brian Berkowitz, Harvey Scher and Stephen E. Silliman, “Anomalous transport in laboratory-scale, heterogeneous porous media”, Water Resources Research 36 (2000), 149–158, publisher abstract. [^ref-9ac430cbe94a]: Brian Berkowitz et al., “Physical pictures of transport in heterogeneous media”, Water Resources Research (2002), abstract and conclusions paras.59–61.

Relationships to Other Abstractions

Local relationship map for Continuous-Time Random WalkParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Continuous-TimeRandom WalkDOMAINDomain-specific abstraction: Continuous-time stochastic process — is a kind ofContinuous-time…DOMAIN

Current abstraction Continuous-Time Random Walk Domain-specific

Parents (1) — more general patterns this builds on

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Continuous-Time Random Walk sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08