General Path Models Overview

Updated 6 July 2026

General Path Models are frameworks that structure analyses by replacing unstructured data with explicit, path-indexed rules and operators.
They integrate diverse methodologies across distribution theory, graph convexity, causal mediation, programming, and efficiency analysis.
This modeling strategy bridges local rules with global inference, enabling precise regime identification and robust optimization.

“General path models” is not a single, uniform formalism. In the cited literature, the expression designates several families of models in which a path, pathway parameter, or path-dependent transition rule organizes the construction of distributions, closures, counterfactuals, predictions, or efficiency scores. The term covers, among other objects, parametric paths through distribution families, admissible path systems in graphs, path loss laws in wireless networks, path diagrams in SEM, path-specific effects in causal mediation, higher-order models for path data, AST-path representations of programs, branching paths through model space, and path-based DEA projections (Mathai et al., 2014, Thompson et al., 2017, Guo et al., 2016, Cook et al., 2020, Steen et al., 2018, Sahasrabuddhe et al., 14 Jan 2025, Alon et al., 2018, Kissel et al., 2021, Halická et al., 2023, Srinivasan et al., 2020).

1. Scope and recurrent structure

Across these literatures, the central modeling move is to replace an unstructured description by an explicitly path-indexed one. In some cases the path is a continuous parametric route in distribution space; in others it is a family of admissible graph paths, an observed sequence through a network, a causal pathway in a DAG, a syntactic path in an AST, or a nested sequence of models. Taken together, these works suggest a recurring structure: a path object, a rule for traversing or selecting it, and an induced operator such as a closure, projection, likelihood, or counterfactual distribution.

Domain	Path object	Representative formal device
Distribution theory	pathway parameter $\alpha$ or $q_1,q_2$	generalized type-1 beta, generalized type-2 beta, generalized gamma
Graph convexity	family $\mathcal{P}$ of admissible graph paths	interval operator $I_{\mathcal P}$ ; matrix path convexity
Network path data	observed trigrams and state nodes	convex NMF factorization of regularized second-order transitions
Causal and social-science models	path diagrams and causal paths $\pi$	reflexive SEMs, $Y(\pi,a,a')$ , PDSEMs
Computation and model search	AST paths and forward model paths	path-contexts $\langle x_s,p,x_f\rangle$ ; forward stability selection
DEA	projection path $\phi_o(\theta)$	GS path-based model with ID, MO, and PR

A second recurrent feature is that “path” often mediates between local and global structure. A local rule—such as chord constraints in a graph path, a transition kernel conditioned on the previous node, or a structural equation tied to a particular regime—induces a global object such as a convexity space, a higher-order Markov chain, or a counterfactual trajectory.

2. Distributional pathways and propagation laws

In stochastic modeling, the pathway model is a univariate parametric family that moves continuously between three distribution classes by means of a pathway parameter $\alpha$ : the generalized type-1 beta family for $\alpha<1$ , the generalized gamma family in the limit $q_1,q_2$ 0, and the generalized type-2 beta family for $q_1,q_2$ 1 (Mathai et al., 2014). Its core scalar forms are

$q_1,q_2$ 2

$q_1,q_2$ 3

and

$q_1,q_2$ 4

The interpretation is explicit: $q_1,q_2$ 5 yields finite support, $q_1,q_2$ 6 yields exponential-type tails, and $q_1,q_2$ 7 yields power-law tails. The pathway parameter therefore determines a continuous route from compactly supported densities through generalized gamma laws to heavy-tailed type-2 beta laws (Mathai et al., 2014).

The same paper embeds this pathway idea in input-output and reaction-diffusion settings. With $q_1,q_2$ 8 as input or production, $q_1,q_2$ 9 as output or destruction, and $\mathcal{P}$ 0 as the residual, Laplace-type and gamma-type residual laws arise from simple assumptions on $\mathcal{P}$ 1 and $\mathcal{P}$ 2. Section 4.1 then replaces exponential kernels in reaction-rate integrals by pathway analogues. The generalized integral

$\mathcal{P}$ 3

reduces to classical exponential-kernel integrals as $\mathcal{P}$ 4, but otherwise introduces type-2 beta heavy-tailed factors. The same framework is used to thicken or thin gamma tails through appended Mittag–Leffler and Bessel factors, with $\mathcal{P}$ 5 producing thicker tails and $\mathcal{P}$ 6 thinner ones (Mathai et al., 2014).

Within this distributional pathway formalism, specific well-known models appear as special cases. For $\mathcal{P}$ 7, the $\mathcal{P}$ 8 form becomes Tsallis statistics; for $\mathcal{P}$ 9, the $I_{\mathcal P}$ 0 form becomes superstatistics. The paper also states that Gaussian, Maxwell–Boltzmann, and standard gamma distributions arise under suitable choices of $I_{\mathcal P}$ 1, $I_{\mathcal P}$ 2, and scale parameters (Mathai et al., 2014).

A different use of “path model” occurs in wireless networks, where the path object is the propagation law $I_{\mathcal P}$ 3. Two general path loss classes are analyzed: the singular model

$I_{\mathcal P}$ 4

and the bounded model

$I_{\mathcal P}$ 5

with $I_{\mathcal P}$ 6 as the main asymptotic parameter (Guo et al., 2016). In this setting, lower SIR tails decay polynomially and upper tails are either exponential-type or power-law, depending on the network class and whether path loss is singular or bounded. The paper’s summary gives, for example, $I_{\mathcal P}$ 7 for ad hoc networks with singular path loss and $I_{\mathcal P}$ 8 for simple cellular networks with singular path loss, while bounded path loss yields $I_{\mathcal P}$ 9 in the upper tail (Guo et al., 2016).

This juxtaposition is instructive because it shows two distinct meanings of path modeling in probability. In the pathway model, a scalar parameter traces a route through distribution families. In SIR asymptotics, the path model is a path loss law whose near-field boundedness or singularity governs tail behavior. The commonality is not semantic identity but the use of a path-specifying rule to determine asymptotic or distributional regime.

3. Path-defined graph and network constructions

In graph theory, a path model is a family $\pi$ 0 of graph paths from which one derives an interval operator and a convexity space (Thompson et al., 2017). For a connected simple graph $\pi$ 1, the interval function is

$\pi$ 2

and the convex sets are exactly the fixed points

$\pi$ 3

The framework’s main generalization is matrix path convexity. Four symmetric length matrices $\pi$ 4 specify, for each endpoint pair $\pi$ 5, lower and upper bounds on path length and chord length. A path belongs to $\pi$ 6 iff it satisfies $\pi$ 7, $\pi$ 8, and every chord has length between $\pi$ 9 and $Y(\pi,a,a')$ 0. The resulting convexity space $Y(\pi,a,a')$ 1 unifies geodesic, monophonic, $Y(\pi,a,a')$ 2, triangle-path, detour, and all-path convexities (Thompson et al., 2017).

The constant-matrix specialization $Y(\pi,a,a')$ 3-path convexity isolates fixed path models in which admissible paths have length between $Y(\pi,a,a')$ 4 and $Y(\pi,a,a')$ 5 and all chords have length between $Y(\pi,a,a')$ 6 and $Y(\pi,a,a')$ 7. This formulation is algorithmically significant. When $Y(\pi,a,a')$ 8 are part of the input, MATRIX CONVEX SET is CoNP-complete, MATRIX INTERVAL DETERMINATION and MATRIX CONVEX HULL DETERMINATION are NP-complete, and the associated optimization problems are NP-hard or NP-complete. By contrast, for fixed constants $Y(\pi,a,a')$ 9, $\langle x_s,p,x_f\rangle$ 0-INTERVAL DETERMINATION is in $\langle x_s,p,x_f\rangle$ 1, and for bounded treewidth graphs all six standard problems become linearly solvable via CMSOL $\langle x_s,p,x_f\rangle$ 2 formulations and Courcelle-type meta-theorems (Thompson et al., 2017). The framework is therefore both descriptive and generative: it systematizes known path convexities and supports the definition of new ones such as $\langle x_s,p,x_f\rangle$ 3- $\langle x_s,p,x_f\rangle$ 4, $\langle x_s,p,x_f\rangle$ 5, $\langle x_s,p,x_f\rangle$ 6-path, $\langle x_s,p,x_f\rangle$ 7-path, and Hamiltonian convexities (Thompson et al., 2017).

A second graph- and network-based notion of general path models appears in higher-order models for path data. Here the primitive observations are sequences

$\langle x_s,p,x_f\rangle$ 8

not aggregated edges, and first-order Markov assumptions are often inadequate (Sahasrabuddhe et al., 14 Jan 2025). For each physical node $\langle x_s,p,x_f\rangle$ 9, the paper constructs a trigram count matrix $\phi_o(\theta)$ 0, a second-order MLE $\phi_o(\theta)$ 1, and a first-order successor distribution $\phi_o(\theta)$ 2. A Dirichlet prior centered on $\phi_o(\theta)$ 3 yields the regularized second-order estimate

$\phi_o(\theta)$ 4

with $\phi_o(\theta)$ 5 chosen by leave-one-out cross-validation (Sahasrabuddhe et al., 14 Jan 2025).

The central compression step factorizes $\phi_o(\theta)$ 6 by convex NMF into a small number of latent state nodes: $\phi_o(\theta)$ 7 When $\phi_o(\theta)$ 8, the model collapses to first-order behavior at node $\phi_o(\theta)$ 9; when $\alpha$ 0 is large enough to match predecessor-specific columns, it approaches a full second-order model. The trade-off between complexity and accuracy is quantified by flow overlap,

$\alpha$ 1

and, for matrices, by a column-weighted mean overlap (Sahasrabuddhe et al., 14 Jan 2025). In air-travel data the method identified interpretable state nodes for hubs such as Denver, Atlanta, Dallas–Fort Worth, and Chicago, while in synthetic information flow on the Lazega law firm network it recovered overlapping communities that were not visible in the first-order graph (Sahasrabuddhe et al., 14 Jan 2025).

These two bodies of work share an important formal trait: a path family is not merely descriptive. It defines an operator. In matrix path convexity, the operator is $\alpha$ 2 and its iterates. In concise higher-order networks, it is the state-node Markov chain induced by $\alpha$ 3 and $\alpha$ 4. In both cases, changing the admissible path class changes the induced global geometry.

4. Path diagrams, path-specific causation, and path-dependent structure

In the social sciences, path analysis is the use of path diagrams and linear structural equations to represent relations among observed and latent variables (Cook et al., 2020). In the reflexive model treated there, latent constructs $\alpha$ 5 and $\alpha$ 6 are linked to indicator vectors $\alpha$ 7 and $\alpha$ 8 through measurement equations

$\alpha$ 9

with jointly normal latent variables and mutually independent error blocks (Cook et al., 2020). The observable cross-covariance has rank one,

$\alpha<1$ 0

so the regression of $\alpha<1$ 1 on $\alpha<1$ 2 is a reduced-rank regression. A central identification point is that the latent correlation $\alpha<1$ 3 is not generally identifiable without further assumptions, but

$\alpha<1$ 4

is identifiable, and $\alpha<1$ 5 equals the first canonical correlation between $\alpha<1$ 6 and $\alpha<1$ 7 (Cook et al., 2020). This distinction underlies the paper’s comparison of SEM, PLS, envelope models, and SERR.

Causal mediation theory extends the path idea from diagrammatic representation to path-specific counterfactuals (Steen et al., 2018). The total effect $\alpha<1$ 8, the natural direct effect $\alpha<1$ 9, and the natural indirect effect $q_1,q_2$ 00 are special cases of path-specific effects along chosen sets of directed paths $q_1,q_2$ 01. The general object is $q_1,q_2$ 02, which sets $q_1,q_2$ 03 to $q_1,q_2$ 04 along paths in $q_1,q_2$ 05 and to $q_1,q_2$ 06 along paths in $q_1,q_2$ 07 (Steen et al., 2018). Identification is harder than for total effects because adjustment for confounding is not sufficient; path-specific effects depend on cross-world counterfactual structure. The paper develops graphical criteria based on recanting witnesses and, with hidden variables, recanting districts. In hidden-variable settings, marginal path-specific effects are identifiable iff there is no recanting district for $q_1,q_2$ 08 and the total effect is identifiable; in that case the identification functional is an edge-specific truncated district factorization (Steen et al., 2018).

Path Dependent Structural Equation Models generalize longitudinal SEMs by allowing the qualitative causal structure itself to depend on the realized path through a discrete state space (Srinivasan et al., 2020). A PDSEM uses a finite state space $q_1,q_2$ 09, state-specific DAGs for the initial state, transition-specific CDAGs for allowed transitions $q_1,q_2$ 10, and state-determining variables $q_1,q_2$ 11. The observed-data distribution is

$q_1,q_2$ 12

and interventions may change not only variable values but also subsequent state trajectories (Srinivasan et al., 2020). For fully observed PDSEMs, a generalized g-formula identifies counterfactual distributions; with hidden variables, identification is characterized using nested Markov factorizations on the induced ADMGs and CADMGs (Srinivasan et al., 2020).

A common misunderstanding is to treat all path diagrams as fixed-structure models. The cited work shows three increasingly rich levels: reflexive SEMs with a single latent-variable diagram, mediation models with path-specific counterfactual semantics on a fixed DAG, and PDSEMs where the very graph applied at time $q_1,q_2$ 13 depends on the realized path. This suggests that “path model” in causal work ranges from graphical depiction to full path-dependent data-generating mechanism.

5. Computational path representations and model-space paths

In program analysis, a general path-based representation is built from paths in abstract syntax trees rather than from flat token sequences (Alon et al., 2018). An AST is formalized as $q_1,q_2$ 14, with parent function $q_1,q_2$ 15, and an AST path of length $q_1,q_2$ 16 is a sequence

$q_1,q_2$ 17

where $q_1,q_2$ 18 indicates traversal to parent or child. A path-context is the triplet

$q_1,q_2$ 19

with $q_1,q_2$ 20 and $q_1,q_2$ 21 (Alon et al., 2018). Abstraction functions $q_1,q_2$ 22 yield abstract path-contexts $q_1,q_2$ 23, and hyperparameters $q_1,q_2$ 24 and $q_1,q_2$ 25 constrain path length and width.

This representation is explicitly task- and model-agnostic. The same path-contexts drive CRF-based and word2vec-based learning for variable naming, method naming, and full type prediction in JavaScript, Java, Python, and C# (Alon et al., 2018). The reported exact-match results for CRF models are 67.3% on JavaScript variable naming, 58.2% on Java, 56.7% on Python, and 56.1% on C#; for method naming, 53.1% on JavaScript, 47.3% exact with F1 49.9 on Java, and 51.1% on Python; for Java full type prediction, 69.1% (Alon et al., 2018). In the word2vec setting on JavaScript variable naming, AST paths yield 40.4% accuracy, compared with 23.2% for AST neighbors without paths and 20.6% for linear token-stream contexts (Alon et al., 2018). The representation is therefore “general” in the strong sense of being usable across tasks, algorithms, and languages.

A different computational meaning of “path model” arises in model path selection. Here the path is a sequence of nested models produced by forward stability selection under data perturbations (Kissel et al., 2021). At forward step $q_1,q_2$ 26, with current model $q_1,q_2$ 27, one draws $q_1,q_2$ 28 subsamples, fits all one-variable extensions, records the winning covariate $q_1,q_2$ 29 on each subsample, and computes selection proportions

$q_1,q_2$ 30

where $q_1,q_2$ 31 (Kissel et al., 2021). The hypotheses

$q_1,q_2$ 32

formalize forward stability. The practical algorithm stops when one multinomial cell count reaches $q_1,q_2$ 33, computes the smallest $q_1,q_2$ 34 guaranteeing $q_1,q_2$ 35, and retains all covariates with count exceeding $q_1,q_2$ 36 (Kissel et al., 2021).

The output is not a single forward path but a branching tree of plausible model paths. On the diabetes data, the method found 67 distinct paths; 24 of 67 models (36%) outperformed the lasso model chosen by CV, and 40 of 67 models (60%) outperformed the CV-tuned forward stepwise model (Kissel et al., 2021). On the breast-cancer data, MPS selected 79 out of 84 possible 3-variable logistic-regression models, but only 1 regression-tree path, illustrating that path multiplicity can itself diagnose model misspecification or structural instability (Kissel et al., 2021).

These two computational uses of paths differ sharply in ontology. AST paths are syntactic objects extracted from a structured input. Model paths are trajectories through subset space. Yet both provide a compact alternative to unstructured search: the former by encoding code semantics through tree relations, the latter by organizing the Rashomon set of plausible models into a nested, visualizable family.

6. Path-based efficiency analysis and general implications

In DEA, a path-based model is defined over the VRS technology

$q_1,q_2$ 37

together with a direction $q_1,q_2$ 38 and two scalar functions $q_1,q_2$ 39 (Halická et al., 2023). The general GS model is

$q_1,q_2$ 40

subject to

$q_1,q_2$ 41

plus the VRS constraints (Halická et al., 2023). This induces the path

$q_1,q_2$ 42

with efficiency score $q_1,q_2$ 43 and projection $q_1,q_2$ 44 (Halická et al., 2023). BCC radial models, DDF-g, HDF, and GDF are all special cases of this GS construction.

The paper studies three properties: indication of strong efficiency,

$q_1,q_2$ 45

strict monotonicity,

$q_1,q_2$ 46

and strong efficiency of projections,

$q_1,q_2$ 47

Under mild assumptions, strict monotonicity and strong efficiency of projections are equivalent, and both imply indication (Halická et al., 2023). The paper also characterizes the narrow class in which all three hold: GS models with GS range directions over ideal technology sets. In general VRS technologies, however, standard path-based models typically fail all three properties, unlike slacks-based graph models, which typically satisfy them (Halická et al., 2023).

This final comparison clarifies a broad point about general path models. The choice of path is rarely innocuous. In distribution theory it determines tail class and support; in graph convexity it determines closure and complexity; in higher-order network models it determines the effective memory order; in mediation it determines which counterfactual effect is even identifiable; in program analysis it determines what structure a learner can exploit; in model path selection it determines which alternatives remain visible; and in DEA it determines whether projections land on strong or weak frontiers. The literature therefore does not support a unitary theory of “general path models.” It supports a general modeling strategy in which a carefully specified path object mediates between local structure and global inference.