Asymmetric simple exclusion process¶

A continuous-time interacting-particle model on a lattice where biased nearest-neighbor jumps occur only into vacant sites.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3351
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Stochastic Processes → Mathematics
Aliases: ASEP

Core Idea¶

ASEP, TASEP, finite open systems and periodic systems use different boundaries and jump rates; update convention and occupancy state space determine stationary laws and currents. Each particle waits an exponential time, chooses a direction with asymmetric rates and moves one site if exclusion permits, producing collective transport, shocks and nonequilibrium steady states. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Hopping Car Traffic

Picture a row of squares with little bugs on some of them. Now and then a bug tries to hop to the square next door, and it likes hopping one way more than the other. But a square can only hold one bug, so if the next square is full, the bug has to stay put. Lots of bugs doing this make traffic jams.

Hopping Particles That Can't Share

The asymmetric simple exclusion process is a math model of particles on a line of spots. Each spot is either empty or holds exactly one particle. Every particle has its own random timer; when it rings, the particle picks a direction to try to hop one spot, and one direction is more likely than the other. If the spot it wants is already taken, it doesn't move. Even with these simple rules, the particles together form flows and traffic jams. The details, like whether the line is a loop or has open ends, change what happens.

Biased Hopping With No Sharing

The asymmetric simple exclusion process (ASEP) is a random model of particles moving on a lattice, usually a line of sites. Each site holds at most one particle, which is the "exclusion" rule. Each particle waits a random, exponentially distributed time, then tries to jump one site left or right, with the two directions having unequal rates, which is the "asymmetric" part. The jump happens only if the target site is empty. Even though each particle follows simple local rules, the system shows collective behavior like a net particle current, shock fronts where density jumps, and steady states that are not in equilibrium. Variants such as TASEP, where particles move only one way, or systems with open ends versus periodic loops behave differently, so the rules must be stated precisely.

The asymmetric simple exclusion process is an interacting-particle Markov process on a lattice in which each site is either empty or occupied, giving a binary occupancy configuration. Each particle carries an independent exponential clock; when it rings, the particle attempts a nearest-neighbor jump to the right or left with unequal rates, and the jump succeeds only if the target site is vacant. This combination of asymmetric drift and hard-core exclusion generates collective transport: a nonzero particle current, shocks, and nonequilibrium stationary states. Behavior depends heavily on setup: TASEP (totally asymmetric, one direction only) versus partially asymmetric rates, finite open systems with injection and extraction at the boundaries versus periodic rings, and continuous-time versus discrete update conventions. The stationary distributions and currents are determined by these choices of lattice, boundaries, update rule and state space. A precise statement also fixes the initial distribution, the generator, the current being measured and the regime studied, such as stationarity or large-scale scaling.

Scope of Application¶

Asymmetric simple exclusion process belongs to stochastic processes and is useful where the analyst can specify the typed stochastic processes carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime are explicit. The scope is broad within that domain but bounded by the need for the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Asymmetric simple exclusion process. Asymmetric simple exclusion process compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed stochastic processes carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of stochastic processes because they reuse the typed stochastic processes carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Each particle waits an exponential time, chooses a direction with asymmetric rates and moves one site if exclusion permits, producing collective transport, shocks and nonequilibrium steady states., and type the carrier, state every parameter and convention in the definition, test that the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Asymmetric simple exclusion process Domain-specific

Parents (1) — outgoing typed relations

Asymmetric simple exclusion process is a kind of Stochastic Process Prime

It remains its own entry because its identity is fixed by the lattice and boundary conditions, binary occupancy configuration, left and right jump rates, independent clocks and update rule, exclusion condition, initial law, generator, particle current and stationary or scaling regime.

Hierarchy path (1) — routes to 1 parentless root

Asymmetric simple exclusion process → is a kind of Stochastic Process

Neighborhood in Abstraction Space¶

Asymmetric simple exclusion process sits in a crowded region of the domain-specific corpus (10^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Stochastic Processes & Markov Dynamics (29 abstractions)

Nearest neighbors

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