Search arXiv⌕ Search

arXiv · 2607.23916

Recursive Governance: A Graph-Theoretic Framework for Risk Propagation and Drift Detection in Agentic AI Systems

Abstract

As financial institutions transition from traditional predictive models to autonomous agentic systems, the static model inventory requirements of traditional model risk management (MRM) face structural obsolescence. This paper proposes a dynamic Inventory-as-Code (IaC) governance loop that treats the model inventory as a living architectural component rather than a periodic documentation artifact. We make four principal contributions. First, we introduce a calibrated Degree of Autonomy (DoA) materiality score with an explicit, taxonomized tool-complexity weighting scheme that addresses the dominance problem of naive additive risk formulations. Second, we construct the agent inventory as a Directed Acyclic Graph (DAG) and define a formal Composite Risk Propagation algorithm under which upstream validation failures induce risk penalties on all reachable descendants. Third, we develop a Trajectory Monitoring protocol based on distributional cosine drift across ensembled Chain-of-Thought (CoT) embeddings, with an explicit procedure for constructing and certifying the Golden Path baseline, a matched-bootstrap calibration that we show is necessary to avoid a severe false-positive artifact in the naive alternative, and a two-stage response that separates legitimate reasoning variation from detrimental drift without demanding that a single exceedance event trigger an irreversible action. Fourth, we address practical complications largely absent from the prior literature: LLM base-model version changes, latent feedback loops in nominally acyclic agent graphs, and a two-pass execution structure that stages validation ahead of risk propagation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sriram Nagaraj, Advaith Nila Narayanan. 2026-07-27. Recursive Governance: A Graph-Theoretic Framework for Risk Propagation and Drift Detection in Agentic AI Systems. https://arxiv.org/abs/2607.23916

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Discrete normalized gradient flow for two-component Bose-Einstein condensates: Energy dissipation, global convergence and sharp local convergence behavior

The gradient flow with semi-implicit discretization (GFSI) is the most widely used algorithm for computing the ground state of Gross-Pitaevskii energy functional. We apply GFSI to the two-component scenario with Josephson junction and rotating term, which is one of the most important and topical models in multi-component Bose-Einstein condensates (MBECs), and rigorously establish the following fundamental results for the first time. By introducing a Lagrange multiplier to reformulate GFSI into an equivalent form, we prove its energy dissipation property and global convergence to stationary states. More significantly, we uncover an intrinsic connection between this classical numerical PDE discretization rooted in imaginary-time evolution and Riemannian optimization, a state-of-the-art mathematical framework for manifold-constrained optimization. This connection enables us to fully characterize the local convergence behavior of GFSI within the Riemannian optimization framework. Together with the aforementioned global convergence result, this yields a complete global--local convergence theory for GFSI. Finally, numerical experiments comprehensively validate the theoretically predicted energy dissipation and convergence properties.

math.NA↗

Discretization, Uniform-in-Time Estimations and Approximation of Invariant Measures for Nonlinear Stochastic Differential Equations with Non-Uniform Dissipativity

The approximation of invariant measures for nonlinear ergodic stochastic differential equations (SDEs) is a central problem in scientific computing, with important applications in stochastic sampling, physics, and ecology. We first propose an easily applicable explicit Truncated Euler-Maruyama (TEM) scheme and prove its numerical ergodicity in the $L^p$-Wasserstein distance ($p\geqslant 1$). Furthermore, by combining truncation techniques with the coupling method, we establish a uniform-in-time $1/2$-order convergence rate in moments for the TEM scheme. Additionally, leveraging the exponential ergodicity of both the numerical and exact solutions, we derive a $1/2$-order convergence rate for the invariant measures of the TEM scheme and the exact solution in the $L^1$-Wasserstein distance. Finally, two numerical experiments are conducted to validate our theoretical results.

math.NA↗

Barotropic-Baroclinic Splitting for Multilayer Shallow Water Models with Exchanges

This work presents the numerical analysis of a barotropic-baroclinic splitting in a nonlinear multilayer framework with exchanges between the layers in terrain-following coordinates. The splitting is formulated as an exact operator splitting. The barotropic step handles free surface evolution and depth-averaged velocity via a well-balanced one-layer model, while the baroclinic step manages vertical exchanges between layers and adjusts velocities to their mean values. We show that the barotropic-baroclinic splitting preserves total energy conservation and meets both a discrete maximum principle and a discrete entropy inequality. Several numerical experiments are presented showing the gain in computational cost, particularly in low Froude simulations, with no loss of accuracy. The benefits of using a well-balancing strategy in the barotropic step to preserve the geostrophic equilibrium are inherited in the overall scheme.

math.NA↗