Conditional Splitting Probabilities

• Conditional splitting probabilities are context-dependent constructs that decompose a probability law into tractable, conditionally defined components.
• They are applied across diverse fields such as parsing, first-passage analysis, quantum walks, and rare-event simulation, each with distinct formulations.
• This approach enables precise structural insights—from parity decompositions and autoregressive split decisions to level-to-level survival factors—enhancing analytical and computational efficiency.

“Conditional splitting probabilities” denotes a family of context-dependent constructions in which a probability law, a first-passage event, or a structured prediction problem is decomposed into conditionally defined components. In recent arXiv usage, the term appears in at least four technically distinct senses: as the normalized integer- and half-integer-supported subsequences of a Poisson trinomial distribution (Broadie et al., 9 Mar 2026); as autoregressive probabilities of selecting a split point inside a span in constituency and discourse parsing (Nguyen et al., 2021); as first-passage probabilities conditioned on phase-space variables such as position, velocity, or orientation in active matter and related stochastic processes (Frydel, 27 Jun 2026, Iyaniwura et al., 13 Mar 2026, Dolgushev et al., 2024); and as conditional level-to-level factors in rare-event simulation, multilevel splitting, and conditional samplers (Walter, 2014, 0711.2037, Botev et al., 2019).

1. Scope of the term across research areas

The phrase does not name a single standardized object. Instead, it consistently refers to probabilities defined after a “split” of either support, state space, trajectory space, or structure space. The split may be algebraic, geometric, algorithmic, or combinatorial.

Domain	Conditional object	Representative form
Poisson trinomial laws	pmf restricted to one lattice component	$\mathbb{P}(X=k \mid X\in\mathbb Z)$
Parsing	split-point distribution inside a span	$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$
First-passage theory	hitting probability conditioned on initial state	$\pi_\lambda(z,w)$ or $p_R(x,\theta)$
Rare-event simulation	level-to-level survival factor	$\mathbb P(F_i\mid F_{i-1})$

This terminological plurality has methodological consequences. In distribution theory, the split is usually a decomposition of a probability mass function into interleaved subsequences. In NLP, it is a factorization of a tree into a sequence of local split decisions. In first-passage settings, it is a competition between exits, targets, or absorbing sets. In rare-event computation, it is a product decomposition over nested subsets or levels. A common misconception is that the phrase always refers to classical gambler’s-ruin-type hitting probabilities; the recent literature shows that it also names conditional lattice laws, pointer-network outputs, and exact-sampling factorizations.

2. Lattice splitting in Poisson trinomial distributions

For independent variables $X_1,\dots,X_n$ taking values in $\{0,\tfrac12,1\}$, with $\mathbb P(X_i=\tfrac12)=T_i$, $\mathbb P(X_i=1)=W_i$, and $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$, the sum $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$0 has what the paper calls a Poisson trinomial distribution (Broadie et al., 9 Mar 2026). Writing $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$1 and $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$2, the pmf splits into an even part and an odd part,

$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$3

where $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$4 and $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$5. Equivalently, the support of $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$6 splits into integers and half-integers, controlled by the parity of the number $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$7 of $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$8-valued summands: $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$9

In this setting, “conditional splitting probabilities” are the normalized subsequences

$\pi_\lambda(z,w)$0

The paper’s central structural result is that each normalized subsequence is a Poisson binomial distribution. Via Hurwitz stability of $\pi_\lambda(z,w)$1, the Hermite–Biehler theorem, and real non-positive zeros of $\pi_\lambda(z,w)$2 and $\pi_\lambda(z,w)$3, both conditional laws inherit log-concavity, unimodality, and the usual “one or two adjacent modes” structure of Poisson binomials. The same analysis yields quantitative stability: if $\pi_\lambda(z,w)$4, $\pi_\lambda(z,w)$5, and $\pi_\lambda(z,w)$6, then

$\pi_\lambda(z,w)$7

and any two modes of the two conditional laws are within distance $\pi_\lambda(z,w)$8. The resulting picture is that parity splitting can substantially reshape pointwise masses while leaving the center and the peak tightly constrained.

A useful correction to an intuitive but false expectation is that the two split components need not behave as unrelated subdistributions. In the nondegenerate case they are highly structured, each lies in the Poisson binomial family, and their means and modes remain close to the unconditional mean. When $\pi_\lambda(z,w)$9 or $p_R(x,\theta)$0, no genuine splitting occurs; then necessarily every $p_R(x,\theta)$1, and $p_R(x,\theta)$2 reduces to a shifted Poisson binomial law.

3. Autoregressive split-point distributions in parsing

In constituency parsing, “conditional splitting probabilities” are distributions over candidate split positions inside a current span. In the boundary-based seq2seq framework of Shen et al., a span $p_R(x,\theta)$3 is split at step $p_R(x,\theta)$4 by choosing a boundary index $p_R(x,\theta)$5, and the model parameterizes

$p_R(x,\theta)$6

where $p_R(x,\theta)$7 is the input sentence and $p_R(x,\theta)$8 is the sequence of previous splitting decisions (Nguyen et al., 2021). The full structure probability factors autoregressively as a product of these conditional splitting probabilities: $p_R(x,\theta)$9

The model instantiates this factorization with a 3-layer bidirectional LSTM encoder, fencepost boundary representations $\mathbb P(F_i\mid F_{i-1})$0, span representations $\mathbb P(F_i\mid F_{i-1})$1, a 3-layer unidirectional decoder LSTM, and a biaffine pointer that scores every boundary position. After softmax,

$\mathbb P(F_i\mid F_{i-1})$2

For syntax, valid splits satisfy $\mathbb P(F_i\mid F_{i-1})$3. For discourse, the framework relaxes this to $\mathbb P(F_i\mid F_{i-1})$4, where $\mathbb P(F_i\mid F_{i-1})$5 means “stop splitting here,” so discourse segmentation becomes a special case of the same conditional splitting process rather than a separate preprocessing stage.

This interpretation of splitting probabilities is algorithmic rather than measure-theoretic. The probabilities are local decisions in a top-down depth-first decoder, but because they are conditioned on the decoder state they encode the entire splitting history. The paper emphasizes that this gives structurally consistent trees without chart-based global inference. With beam size treated as constant, decoding complexity is $\mathbb P(F_i\mid F_{i-1})$6 on GPU and $\mathbb P(F_i\mid F_{i-1})$7 on CPU. Empirically, the model reaches 93.77 F1 on PTB without pretraining, 95.7 F1 with BERT, and in end-to-end discourse parsing improves relation F1 by 1.3 points over the previous best joint model; syntactic parsing runs at 1,127 sentences/s on GPU, while end-to-end discourse parsing is roughly 44× faster than CODRA and 4–5× faster than the previous neural joint parser (Nguyen et al., 2021).

4. First-passage, active matter, and memory-dependent splitting

In stochastic transport, splitting probabilities are classical first-passage objects: the probability that one boundary or target is reached before another, conditioned on an initial state. Recent active-matter work makes that conditioning explicit in phase space. For confined run-and-tumble particles, active Brownian particles, and active Ornstein–Uhlenbeck particles in a slit $\mathbb P(F_i\mid F_{i-1})$8, the conditional splitting probability

$\mathbb P(F_i\mid F_{i-1})$9

is the probability that a particle starting at position $X_1,\dots,X_n$0 with projected velocity $X_1,\dots,X_n$1 reaches the right wall before the left. The backward equation

$X_1,\dots,X_n$2

is paired with the stationary forward equation for the bulk density, and the paper derives the exact identities

$X_1,\dots,X_n$3

which imply the marginal relations

$X_1,\dots,X_n$4

Thus the stationary density is the spatial derivative of the splitting probability, and the fraction of dynamically adsorbed particles at a wall equals the wall splitting probability (Frydel, 27 Jun 2026).

A related confined-active-particle study formulates the right-exit probability as $X_1,\dots,X_n$5 in a 1D interval and as $X_1,\dots,X_n$6 in a 2D corrugated channel, both satisfying backward Fokker–Planck equations with absorbing exit boundaries and reflecting side walls (Iyaniwura et al., 13 Mar 2026). In the 1D interval,

$X_1,\dots,X_n$7

with $X_1,\dots,X_n$8 and $X_1,\dots,X_n$9. The orientation average obeys a perturbative expansion

$\{0,\tfrac12,1\}$0

for weak activity, while in the strong-activity regime the averaged splitting probability tends to $\{0,\tfrac12,1\}$1 away from boundary layers. In narrow corrugated channels, a Fick–Jacobs reduction replaces $\{0,\tfrac12,1\}$2 by

$\{0,\tfrac12,1\}$3

so geometry enters through an entropic drift-diffusion operator.

Memory effects generalize the same theme beyond Markovian dynamics. For one-dimensional isotropic non-Markovian Gaussian processes with stationary increments and two targets at $\{0,\tfrac12,1\}$4 and $\{0,\tfrac12,1\}$5, the splitting probabilities $\{0,\tfrac12,1\}$6 are governed by post-first-passage average trajectories $\{0,\tfrac12,1\}$7 and $\{0,\tfrac12,1\}$8, through

$\{0,\tfrac12,1\}$9

The paper’s central claim is that splitting probabilities are controlled by out-of-equilibrium trajectories observed after the first passage. For scale-invariant mean-square displacement $\mathbb P(X_i=\tfrac12)=T_i$0, the far-target probability obeys

$\mathbb P(X_i=\tfrac12)=T_i$1

so memory can steepen or flatten the dependence on initial position depending on the Hurst exponent $\mathbb P(X_i=\tfrac12)=T_i$2 (Dolgushev et al., 2024).

These works collectively show that “conditional” in first-passage splitting is often irreducibly state-enriched. Conditioning only on position is insufficient for active particles because the relevant Markov state includes velocity or orientation; for non-Markovian Gaussian processes, even that is not enough, and the effective conditioning is encoded in post-first-passage trajectory statistics.

5. Conditional splitting in monitored quantum walks

For monitored continuous-time quantum walks with two targets, splitting probabilities are the probabilities of eventual first detection at the left or right target under repeated projective measurements. The setup is a finite-dimensional Hilbert space with unitary evolution $\mathbb P(X_i=\tfrac12)=T_i$3, measurements at times $\mathbb P(X_i=\tfrac12)=T_i$4, and a survival operator

$\mathbb P(X_i=\tfrac12)=T_i$5

The first-detection amplitude at target $\mathbb P(X_i=\tfrac12)=T_i$6 on the $\mathbb P(X_i=\tfrac12)=T_i$7-th measurement cycle is

$\mathbb P(X_i=\tfrac12)=T_i$8

and the corresponding splitting probability is

$\mathbb P(X_i=\tfrac12)=T_i$9

(Singh et al., 22 Jan 2026).

A key structural result is the mapping of the two-target problem onto two single-target detection problems using the symmetric and antisymmetric target states

$\mathbb P(X_i=1)=W_i$0

For parity-symmetric Hamiltonians,

$\mathbb P(X_i=1)=W_i$1

so the left/right splitting probabilities become

$\mathbb P(X_i=1)=W_i$2

with $\mathbb P(X_i=1)=W_i$3 an interference term constructed from the two auxiliary single-target processes.

This produces a specifically quantum notion of conditional splitting. The outcome is conditioned not only on the initial site but on the measurement cadence $\mathbb P(X_i=1)=W_i$4, which reorganizes the spectrum of the survival operator. For a tight-binding chain, the critical sampling time is

$\mathbb P(X_i=1)=W_i$5

with $\mathbb P(X_i=1)=W_i$6 the bandwidth. For large $\mathbb P(X_i=1)=W_i$7 and $\mathbb P(X_i=1)=W_i$8, the paper finds a universal regime

$\mathbb P(X_i=1)=W_i$9

for all bulk initial conditions $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$0. For $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$1, a nonuniversal regime appears in which splitting probabilities deviate from $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$2 and develop pronounced peaks and dips depending on $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$3 and on the initial condition. At resonant sampling times satisfying

$\mathbb P(X_i=0)=L_i:=1-T_i-W_i$4

dark states can occur, so $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$5. This sharply distinguishes monitored quantum splitting from classical absorbing-boundary problems, where total absorption probability on a finite graph is 1 (Singh et al., 22 Jan 2026).

6. Rare-event simulation, conditional sampling, and abstract splitting formalisms

In rare-event computation, the expression usually means exactly what the name suggests: conditional probabilities associated with successive splits of a rare event into less rare nested events. For multilevel splitting or subset simulation with nested sets

$\mathbb P(X_i=0)=L_i:=1-T_i-W_i$6

the target probability factors as

$\mathbb P(X_i=0)=L_i:=1-T_i-W_i$7

The Moving Particles framework summarizes earlier results that optimal variance at fixed cost is achieved when these conditional probabilities are all equal, $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$8, citing Cérou et al.; it also recalls Guyader et al.’s limit $\mathbb P(X_i=0)=L_i:=1-T_i-W_i$9 and then replaces explicit level design by a particle-moving scheme whose number of moves to reach the rare set is Poisson with parameter $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$00 for one particle and $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$01 for $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$02 particles, rather than order $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$03 as in naive Monte Carlo (Walter, 2014).

Large-deviation analysis casts the same factors as hitting probabilities between successive level sets of an importance function. In that formulation, the rare event is $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$04, and the probability is written as a product of level-to-level terms of the form

$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$05

The paper shows that subexponential particle growth and asymptotic variance control are equivalent to the existence of a suitable subsolution for the associated calculus-of-variations problem (0711.2037). In the idealized exact-resampling analysis of adaptive multilevel splitting, the algorithm enforces an empirical conditional survival fraction $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$06 at each iteration by killing the $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$07 least-adapted particles among $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$08 and resampling them from the exact conditional law above the current level; the resulting rare-event estimator is unbiased whatever $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$09, and the paper derives large-$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$10 expansions for both variance and cost (Bréhier et al., 2014).

The same logic extends from probability estimation to sampling from conditional rare-event laws. Generalized splitting targets

$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$11

by using levels $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$12 with

$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$13

Markov kernels with stationary distributions $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$14, and repeated non-empty splitting trials. The paper’s main conclusion is that approximation error depends crucially on the relative variability of the number of points $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$15 produced in one successful run, and it provides explicit total-variation and mean-absolute-error bounds in terms of low-order moments of $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$16 (Botev et al., 2019).

Several adjacent frameworks recast the same conditional-splitting idea in different algebraic forms. Weighted ensemble (WE) does not write explicit level probabilities $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$17, but its bin-conditional offspring counts and weights preserve the target law $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$18; the paper proves that WE is the only splitting and killing method that gives asymptotically consistent long-time MCMC estimates when total weight is preserved pathwise, and it derives a lower bound on asymptotic variance together with near-optimal designs based on binwise conditional variances (Webber et al., 2020). Split sampling writes

$P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$19

introduces an auxiliary variable $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$20, and shows that with choices such as $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$21 or $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$22 the method reproduces the long-run sampling distribution of product estimators and relates directly to nested sampling (Birge et al., 2012). Probabilistic divide-and-conquer with deterministic second half factors an exact conditional law $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$23 over a product decomposition $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$24; when each $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$25 has a unique completion $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$26 satisfying the constraint, the second conditional law collapses to $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$27, so all nontrivial conditional splitting resides in the first half (DeSalvo, 2014). At the highest level of abstraction, categorical probability interprets idempotent Markov kernels as conditional-type projections that split through an intermediate space $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$28, $P_\theta(k_t \mid (i_t,j_t), y_{<t}, x)$29, and proves that every idempotent measurable Markov kernel between standard Borel spaces splits in this sense (Fritz et al., 2023).

Across these literatures, the unifying idea is not a single formula but a recurring operation: a hard global object is replaced by conditional pieces whose structure is easier to analyze or simulate. What varies is the object being split—support lattices, parse trees, phase-space trajectories, nested rare-event sets, or probability kernels themselves.