SearcharxivSearch

arXiv subjects

Hewan Shemtaga

Publications and source records attributed to Hewan Shemtaga.

3 recordsLinked to original sources

The Accountability Horizon: An Impossibility Theorem for Governing Human-Agent Collectives

Existing accountability frameworks for AI systems, legal, ethical, and regulatory, rest on a shared assumption: for any consequential outcome, at least one identifiable person had enough involvement and foresight to bear meaningful responsibility. This paper proves that agentic AI systems violate this assumption not as an engineering limitation but as a mathematical necessity once autonomy exceeds a computable threshold. We introduce Human-Agent Collectives, a formalisation of joint human-AI systems where agents are modelled as state-policy tuples within a shared structural causal model. Autonomy is characterised through a four-dimensional information-theoretic profile (epistemic, executive, evaluative, social); collective behaviour through interaction graphs and joint action spaces. We axiomatise legitimate accountability through four minimal properties: Attributability (responsibility requires causal contribution), Foreseeability Bound (responsibility cannot exceed predictive capacity), Non-Vacuity (at least one agent bears non-trivial responsibility), and Completeness (all responsibility must be fully allocated). Our central result, the Accountability Incompleteness Theorem, proves that for any collective whose compound autonomy exceeds the Accountability Horizon and whose interaction graph contains a human-AI feedback cycle, no framework can satisfy all four properties simultaneously. The impossibility is structural: transparency, audits, and oversight cannot resolve it without reducing autonomy. Below the threshold, legitimate frameworks exist, establishing a sharp phase transition. Experiments on 3,000 synthetic collectives confirm all predictions with zero violations. This is the first impossibility result in AI governance, establishing a formal boundary below which current paradigms remain valid and above which distributed accountability mechanisms become necessary.

cs.AI

Well-posedness of Keller-Segel systems on compact metric graphs

Chemotaxis phenomena govern the directed movement of micro-organisms in response to chemical stimuli. In this paper, we investigate two Keller--Segel systems of reaction-advection-diffusion equations modeling chemotaxis on thin networks. The distinction between two systems is driven by the rate of diffusion of the chemo-attractant. The intermediate rate of diffusion is modeled by a coupled pair of parabolic equations, while the rapid rate is described by a parabolic equation coupled with an elliptic one. Assuming the polynomial rate of growth of the chemotaxis sensitivity coefficient, we prove local well-posedness of both systems on compact metric graphs, and, in particular, prove existence of unique classical solutions. This is achieved by constructing sufficiently regular mild solutions via analytic semigroup methods and combinatorial description of the heat kernel on metric graphs. The regularity of mild solutions is shown by applying abstract semigroup results to semi-linear parabolic equations on compact graphs. In addition, for logistic type Keller--Segel systems we prove global well-posedness and, in some special cases, global uniform boundedness of solutions.

math.AP

Stability and bifurcation for logistic Keller--Segel models on compact graphs

This paper concerns asymptotic stability, instability, and bifurcation of constant steady state solutions of the parabolic-parabolic and parabolic-elliptic chemotaxis models on metric graphs. We determine a threshold value $χ^*>0$ of the chemotaxis sensitivity parameter that separates the regimes of local asymptotic stability and instability, and, in addition, determine the parameter intervals that facilitate global asymptotic convergence of solutions with positive initial data to constant steady states. Moreover, we provide a sequence of bifurcation points for the chemotaxis sensitivity parameter that yields non-constant steady state solutions. In particular, we show that the first bifurcation point coincides with threshold value $χ^*$ for a generic compact metric graph. Finally, we supply numerical computation of bifurcation points for several graphs.

math.AP