Linearly Generalized Skorokhod Reflection Mapping

• Linearly generalized Skorokhod reflection mapping is a generalization that uses linear operators (or matrices) to couple the reflection term while preserving minimality and complementarity.
• It extends traditional one-dimensional and multidimensional reflection problems, accommodating jump processes and queueing recursions to model constrained stochastic systems.
• The approach employs fixed-point theory, lattice frameworks, and spectral radius conditions to ensure existence, uniqueness, and stability of solutions.

Searching arXiv for recent and foundational papers on linearly generalized Skorokhod reflection mapping. The linearly generalized Skorokhod reflection mapping is a generalization of the classical Skorokhod reflection map in which the constraining term enters through a linear coupling, typically via a reflection matrix, a linear operator, or a linear drift term, while preserving nonnegativity and a complementarity or minimality condition. In the literature summarized here, this notion appears in finite-dimensional orthants driven by jump processes, in infinite-dimensional fluid limits for Jackson networks, and in one-dimensional linearly drifted reflection maps arising from queueing recursions (Baker et al., 30 Dec 2025, Clarke et al., 16 May 2026, Feng et al., 31 Oct 2025). The subject sits between classical pathwise reflection theory, convex-domain Skorokhod problems, and modern applications to queueing networks, reflected diffusions, and stochastic systems with operator-valued constraints.

1. Classical one-sided reflection and its characterizations

The classical one-sided Skorokhod problem at the lower barrier $0$ starts from a continuous path $X:[0,\infty)\to\mathbb{R}$ and seeks a pair $(Q,Y)$ such that

$Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$

where $Y$ is continuous, nondecreasing, $Y(0)=0$, and increases only when the reflected process is at the boundary: $\int_0^\infty Q(s)\,dY(s)=0.$ For a continuous function $X$, the unique solution is

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$

so that

$$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$

This is the one-sided Skorokhod reflection map in its standard form (Anantharam et al., 2010).

A bounded-variation reformulation writes the driving input as a signed Borel measure $X:[0,\infty)\to\mathbb{R}$0, where $X:[0,\infty)\to\mathbb{R}$1 and $X:[0,\infty)\to\mathbb{R}$2 are locally finite nonnegative Borel measures without atoms. In that setting,

$X:[0,\infty)\to\mathbb{R}$3

and the paper proves that $X:[0,\infty)\to\mathbb{R}$4 is not merely a reflected path but the unique maximal solution of the nonlinear integral equation

$X:[0,\infty)\to\mathbb{R}$5

This gives an exact characterization of one-sided reflection as a fixed-point problem rather than only an explicit supremum formula (Anantharam et al., 2010).

The multidimensional deterministic precursor is the Skorokhod problem in a convex domain $X:[0,\infty)\to\mathbb{R}$6, where one seeks

$X:[0,\infty)\to\mathbb{R}$7

with $X:[0,\infty)\to\mathbb{R}$8, $X:[0,\infty)\to\mathbb{R}$9 of bounded variation, $(Q,Y)$0, and

$(Q,Y)$1

where $(Q,Y)$2 is a unit inward normal vector. In this formulation the correction acts only on the boundary and in inward normal directions, providing the geometric template from which matrix-based and operator-based linear generalizations are built (Wang et al., 2020).

2. Finite-dimensional linear coupling in the positive orthant

A direct finite-dimensional linearly generalized Skorokhod reflection mapping is studied for an $(Q,Y)$3-dimensional process constrained to remain in $(Q,Y)$4, driven by an exogenous jump process $(Q,Y)$5. The state equation is

$(Q,Y)$6

where $(Q,Y)$7 is a nonnegative matrix with $(Q,Y)$8, and $(Q,Y)$9 is the reflection process (Baker et al., 30 Dec 2025).

The one-dimensional Skorokhod formula is recalled in the form

$Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$0

as the smallest nondecreasing process such that $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$1. The linear generalization arises because reflection in coordinate $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$2 depends linearly on the entire vector $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$3 through the matrix $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$4: $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$5 At a jump time $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$6, the increment must satisfy the coupled system

$Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$7

In this formulation, the classical reflection map is generalized by allowing cross-coupling through the linear operator $Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$8 (Baker et al., 30 Dec 2025).

The main existence theorem is stated in cone-duality form. The cone

$Q(t)=X(t)+Y(t)\ge 0,\qquad t\ge 0,$9

and its dual

$Y$0

govern continuation across jumps. A solution on $Y$1 can be extended to $Y$2 if and only if

$Y$3

When this holds, there exists a unique minimal jump $Y$4 with respect to the partial order on $Y$5. Consequently, for any initial conditions and driving processes, there exists a unique minimal strong solution on a maximal interval $Y$6, where $Y$7 is the first jump time at which the dual-cone condition fails (Baker et al., 30 Dec 2025).

The same jump condition admits a fixed-point interpretation through a monotone operator $Y$8, and Knaster–Tarski yields a complete lattice of fixed points; iteration from $Y$9 gives the minimal fixed point, hence the minimal jump. This places the linearly generalized map simultaneously in lattice-theoretic and linear-programming frameworks. The LP formulation minimizes $Y(0)=0$0 subject to

$Y(0)=0$1

and Farkas’s lemma converts feasibility into the dual-cone criterion (Baker et al., 30 Dec 2025).

A notable special case is the sub-stochastic regime $Y(0)=0$2. Then $Y(0)=0$3 and $Y(0)=0$4, so continuation always holds. This recovers Reiman’s all-time existence result as a special case, whereas arbitrary nonnegative matrices with zero diagonal require the maximal-stopping-time theory (Baker et al., 30 Dec 2025).

3. Operator-valued and infinite-dimensional reflection maps

An infinite-dimensional extension replaces a finite reflection matrix by an integral operator. In a growing open Jackson network, the usual finite-dimensional reflection matrix $Y(0)=0$5 is replaced in the limit by the operator $Y(0)=0$6, where $Y(0)=0$7 is induced by a nonnegative kernel $Y(0)=0$8 on $Y(0)=0$9. The reflected path and regulator live in

$\int_0^\infty Q(s)\,dY(s)=0.$0

The infinite-dimensional Skorokhod problem is

$\int_0^\infty Q(s)\,dY(s)=0.$1

with

$\int_0^\infty Q(s)\,dY(s)=0.$2

and coordinatewise complementarity

$\int_0^\infty Q(s)\,dY(s)=0.$3

For the network limit, $\int_0^\infty Q(s)\,dY(s)=0.$4 (Clarke et al., 16 May 2026).

The reflection operator class is defined by

$\int_0^\infty Q(s)\,dY(s)=0.$5

where

$\int_0^\infty Q(s)\,dY(s)=0.$6

The feasible regulator set is

$\int_0^\infty Q(s)\,dY(s)=0.$7

and the reflected pair is defined by

$\int_0^\infty Q(s)\,dY(s)=0.$8

with componentwise infimum

$\int_0^\infty Q(s)\,dY(s)=0.$9

This is presented as the infinite-dimensional analogue of a linearly generalized Skorokhod reflection map (Clarke et al., 16 May 2026).

A central auxiliary operator is

$X$0

and the theory shows that

$X$1

with $X$2 the unique fixed point of $X$3. Existence is obtained by constructing

$X$4

uniqueness by monotone iteration $X$5, and complementarity by a minimality argument (Clarke et al., 16 May 2026).

The spectral radius condition $X$6 is structural. It yields the Neumann-series inverse

$X$7

and for any $X$8, some finite $X$9 satisfies

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$0

These bounds lead to Lipschitz continuity: $Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$1 and

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$2

The same framework also quantifies stability under perturbations of the operator itself (Clarke et al., 16 May 2026).

This development is explicitly connected to the classical finite-dimensional linearly generalized Skorokhod map of Whitt, with the novelty that a reflection matrix becomes an operator acting on $Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$3-valued paths. The resulting theory covers heterogeneous, possibly asymmetric networks and continuum-index limits (Clarke et al., 16 May 2026).

4. Linear-drift reflection and queueing recursions

A one-dimensional version with linear feedback appears in the study of queues whose interarrival and service times depend linearly and randomly on customer waiting times. The waiting-time sequence satisfies the modified Lindley recursion

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$4

equivalently

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$5

with regulator

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$6

In continuous-time indexing, the regulator satisfies

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$7

Thus the queueing recursion is represented as a linear recursion plus reflection (Feng et al., 31 Oct 2025).

The paper defines the linearly generalized reflection map

$Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$8

where $Y(t)=-\inf_{0\le s\le t}\bigl(X(s)\wedge 0\bigr),$9 solve

$$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$0

with

$$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$1

For $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$2, this reduces to the standard Skorokhod reflection map: $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$3 The linear generalization is therefore not a matrix coupling but a reflection law with linear drift feedback (Feng et al., 31 Oct 2025).

A useful representation is

$$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$4

where $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$5 is the unique solution of

$$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$6

The paper states that $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$7 is well-defined and Lipschitz continuous on $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$8, and by this representation $$Q(t)=X(t)\vee \sup_{0\le s\le t}\bigl(X(t)-X(s)\bigr).$$9 and $X:[0,\infty)\to\mathbb{R}$00 are also Lipschitz. The classical explicit formula remains available at the $X:[0,\infty)\to\mathbb{R}$01 level: $X:[0,\infty)\to\mathbb{R}$02 This identifies the linearly generalized map as a drift-perturbed reflection operator built on the standard half-line map (Feng et al., 31 Oct 2025).

In moderate deviations, reflection appears exactly when the stable equilibrium lies at the boundary. When the fluid equilibrium is positive, $X:[0,\infty)\to\mathbb{R}$03, the rate function is determined by the unreflected linear map $X:[0,\infty)\to\mathbb{R}$04. When the stable equilibrium is $X:[0,\infty)\to\mathbb{R}$05, the rate function is expressed through

$X:[0,\infty)\to\mathbb{R}$06

and the reflected term survives in the limiting variational problem. The paper states that this dichotomy is parallel to the corresponding diffusion limits: positive equilibrium yields an Ornstein–Uhlenbeck-type limit, whereas zero equilibrium yields a reflected OU process or reflected Brownian motion when $X:[0,\infty)\to\mathbb{R}$07 (Feng et al., 31 Oct 2025).

5. Extended Skorokhod maps, oblique reflection, and linearized derivative problems

The linearly generalized perspective is closely connected with the extended Skorokhod map in convex polyhedral domains. For a convex polyhedral domain

$X:[0,\infty)\to\mathbb{R}$08

with face-dependent reflection directions $X:[0,\infty)\to\mathbb{R}$09 satisfying

$X:[0,\infty)\to\mathbb{R}$10

the extended Skorokhod problem seeks $X:[0,\infty)\to\mathbb{R}$11 such that

$X:[0,\infty)\to\mathbb{R}$12

and for all $X:[0,\infty)\to\mathbb{R}$13,

$X:[0,\infty)\to\mathbb{R}$14

Under geometric assumptions and a projection map $X:[0,\infty)\to\mathbb{R}$15, the corresponding extended Skorokhod map is Lipschitz on path space (Lipshutz et al., 2016).

The central sensitivity result is that directional derivatives of the extended Skorokhod map exist under the boundary jitter property. For $X:[0,\infty)\to\mathbb{R}$16,

$X:[0,\infty)\to\mathbb{R}$17

and the directional derivative

$X:[0,\infty)\to\mathbb{R}$18

has a right-continuous regularization characterized by a derivative problem. The derivative problem associated with the reflected path $X:[0,\infty)\to\mathbb{R}$19 seeks $X:[0,\infty)\to\mathbb{R}$20 such that

$X:[0,\infty)\to\mathbb{R}$21

and

$X:[0,\infty)\to\mathbb{R}$22

where

$X:[0,\infty)\to\mathbb{R}$23

This is a linearized, time-inhomogeneous Skorokhod-type problem on tangent hyperplanes (Lipshutz et al., 2016).

The framework includes linearly generalized Skorokhod reflection mappings in the Harrison–Reiman sense. When the active reflection directions are linearly independent at each boundary point, the constraining term has the decomposition

$X:[0,\infty)\to\mathbb{R}$24

where $X:[0,\infty)\to\mathbb{R}$25 is the reflection matrix with columns $X:[0,\infty)\to\mathbb{R}$26, and $X:[0,\infty)\to\mathbb{R}$27 is componentwise nondecreasing with $X:[0,\infty)\to\mathbb{R}$28 increasing only when the path lies on face $X:[0,\infty)\to\mathbb{R}$29. Moreover, if the matrix

$X:[0,\infty)\to\mathbb{R}$30

has spectral radius $X:[0,\infty)\to\mathbb{R}$31, then the generalized Harrison–Reiman Skorokhod problem satisfies the assumptions needed for the directional-derivative theory (Lipshutz et al., 2016).

This deterministic theory is carried into reflected diffusions in convex polyhedral domains. A reflected diffusion

$X:[0,\infty)\to\mathbb{R}$32

with

$X:[0,\infty)\to\mathbb{R}$33

is shown to be pathwise differentiable with respect to the initial condition, drift, diffusion coefficient, and reflection directions. The right-continuous regularization of the derivative is the pathwise unique solution of a constrained linear SDE with jumps, whose coefficients, domain, and directions of reflection depend on the reflected diffusion itself. This establishes the derivative problem as the linearized reflection map governing infinitesimal perturbations of constrained dynamics (Lipshutz et al., 2017).

6. Scope of the term and related non-equivalent generalizations

The phrase “linearly generalized Skorokhod reflection mapping” does not cover every generalized reflection mechanism appearing in the recent literature. One source of possible confusion is the existence of generalized half-line reflection laws of the form

$X:[0,\infty)\to\mathbb{R}$34

with $X:[0,\infty)\to\mathbb{R}$35 nondecreasing and

$X:[0,\infty)\to\mathbb{R}$36

where $X:[0,\infty)\to\mathbb{R}$37 may have jumps. This framework includes jump reflection, sticky or delayed reflection through the time change

$X:[0,\infty)\to\mathbb{R}$38

and switching approximations near the boundary. It is a generalized Skorokhod map, but its defining feature is the boundary regulator $X:[0,\infty)\to\mathbb{R}$39, not linear coupling through a reflection matrix or operator (Pilipenko et al., 2023).

A second distinction concerns nonlinear-expectation reflection in BSDEs. There the generalized reflection operator is

$X:[0,\infty)\to\mathbb{R}$40

and the reflection process $X:[0,\infty)\to\mathbb{R}$41 is characterized by the Skorokhod-type condition

$X:[0,\infty)\to\mathbb{R}$42

The paper explicitly states that this framework is not linear in general; linear behavior appears only in special cases. Thus it supports a generalized Skorokhod reflection interpretation, but not a fundamentally linear one (Li, 21 Nov 2025).

A related backward formulation appears in reflected BSDEs with resistance, where time reversal and the Skorokhod equation yield an explicit representation of the compensator $X:[0,\infty)\to\mathbb{R}$43. The solution is then obtained as a fixed point of a mapping built from the Skorohod reflection formula. This is again a generalized reflection-operator viewpoint, but the generalization is stochastic and backward rather than a linearly coupled orthant map in the finite- or infinite-dimensional queueing sense (Qian et al., 2011).

Taken together, these works indicate that the linearly generalized Skorokhod reflection mapping is best understood as one branch within a larger reflection-operator landscape. Its distinctive feature is the preservation of Skorokhod minimality or complementarity under linear coupling, whether through $X:[0,\infty)\to\mathbb{R}$44, $X:[0,\infty)\to\mathbb{R}$45, or a linear drift-reflection law. Other generalized reflection constructions may share fixed-point, minimality, and pathwise-continuity mechanisms, but they are not linear in the same sense.