betaFeedback

WorksComputer Science

6G Reasoning Agent Societies: Composition, Scaling, and Consistency-Time Laws

Abstract

Emerging 6G control planes would compose Large Language Model (LLM) agents that exchange interpreted conclusions, so hallucinations can propagate even over error-free transport. Recent architectures audit each message locally against the sender's observation mask, but isolated audits miss collective behavior. Modeling the agent society as a cellular sheaf, we establish three laws valid on arbitrary topologies. First, the composition law: network-wide divergence exceeds the sum of per-agent audit scores by exactly their hidden total correlation. This blind spot masks up to 23% of joint divergence and, because the declared signal cancels in the cognitive signal-to-noise ratio (SNR), overstates it by 1.141.14 dB purely through topology; the resulting trust inflation preserves valid consensus states but slows convergence. Second, the scaling law: reconciliation decouples across metric counters, so the worst-connected dimension sets the pace. Consistency time grows for a society size nn as Ω(n2/d)Ω(n^{2/d}) on polynomial-growth topologies of degree dd, and paths breach a 11 s near-real-time budget at n∗=13n^\ast=13 agents, whereas expanders (Θ(1)Θ(1)) and radius-3 local audits (O(1)O(1), ≈300\approx300 ms) stay bounded. Third, the consistency-time law: the timing error from omitted correlations is one-sided and capped by the worst-measured link. These laws, validated on simulated topologies and deployed LLM societies, give provable worst-case latency ceilings for near-real-time operation.

Introduction

Proposals for next-generation O-RAN architectures are rethinking the near-real-time RAN Intelligent Controller (RIC). Instead of rigid, rule-based xApps, these networks employ LLM agents that do more than execute code: they interpret E2 measurement reports, form internal beliefs about the state of the network’s cells, and negotiate resource allocation in natural language before acting [1], [2]. This leap in capability introduces a blind spot. Because the agents are proprietary black boxes, an operator cannot audit their internal logic to verify how a conclusion was reached, and the control plane is no longer transmitting bits reliably but conveying interpreted meaning [3], [4]. Protection has to be redefined accordingly.

In a classical control plane, resilience is transport integrity: a packet delivered intact is correct. In an agentic one, a perfectly delivered conclusion can still be a hallucination inferred from misunderstood or unmonitored metrics, so the network must secure trust rather than integrity [5], [6], which means endowing it with a machine Theory of Mind—the ability to judge an agent’s credibility from its behavior and interactions [7], [8].

Literature Review

Four lines of work bear on that problem and none of them closes it.

The first is the agentic control plane itself. The near-real-time RIC, its E2 interface and the xApp model that LLM agents are proposed to inhabit are well characterized [9], and multi-agent frameworks show that agents given roles, memories and a protocol do coordinate on non-trivial tasks [1], [2], [4]. The same literature establishes the failure mode that motivates auditing: a language model produces fluent, confident statements unsupported by its inputs [10], and at the receiver those are indistinguishable from well-founded ones. Outputs are nevertheless judged one at a time, which is the assumption this paper prices.

The second is semantic and goal-oriented communication, which moves the design objective from bit fidelity to the fidelity of conveyed meaning and gives an information-theoretic account of what a receiver needs for its task [3], [6], [11]. It says what should be preserved end to end, not what an evaluator of meaning can and cannot see—a different question, and the one a trust layer faces.

The third is trust and reputation. Scores are accumulated per interaction and aggregated by sums, averages or Bayesian updates [12], and in agentic control planes each message is scored against an expectation reconstructed from the sender’s public observation mask [5]. The locality is not an oversight but a necessity, since a near-real-time loop cannot run joint inference over message histories. Every one of these aggregation rules, however, is exact only when the evidence being combined is independent—and circulating conclusions introduce dependence.

Fourth, the spectral theory of agreement models network consensus as a linear diffusion process, x˙=−Lx\dot{x}=-Lx, where nodes iteratively average their states with neighbors [13], [14], [15]. The rate of this diffusion follows a 1/λ21/\lambda_2 relaxation law, meaning the graph Laplacian’s spectral gap λ2\lambda_2 controls how fast differences dissipate. Consequently, the edge weights of LL can be treated as tunable design parameters and optimized directly to maximize convergence speed [16]. Cellular sheaves generalize this to agents holding different quantities that agree only where their vocabularies overlap [17], and sheaf diffusion has modeled disagreement among agents whose private frames differ [18]. Classical information theory supplies the measures: Kullback–Leibler geometry [19], total correlation as the multivariate extension of mutual information [20], and the composition results separating single-link from cascaded capacity [21], [22].

Gaps and Contributions

Three gaps remain. First, the composition results of network information theory govern transport: what a cascade of channels can carry, not what a cascade of evaluations can detect. With no counterpart for credibility, a trust layer that sums per-link scores inherits the sum’s independence assumption, and with it a cost no better expectation can remove.

Second, consensus theory prices agreement for agents holding the same state but disagreeing about its value. Sheaf Laplacians [17], [18] handle different vocabularies, but ask whether opinions converge, and to what—not how long that takes under the topology the subscriptions induce, which is what a near-real-time budget is spent on.

Third, the weights here are measurements, not design variables. Where [16] chooses weights to make a network fast, a trust layer reads them from scores that Theorem 1 in this paper shows to be optimistic, then derives its convergence time from them. A controller sizing a budget on that number trusts a self-report whose error the literature does not bound.

We close these gaps with three laws, each stated for an arbitrary topology, proved from the architecture and validated without fitted parameters:

  • The composition of trust (Section III). Link-by-link evaluation underestimates the society’s divergence by exactly the total correlation of its messages, for any topology and per-agent expectations.

  • Scaling and consistency time (Section IV). A society reconciles as slowly as its worst-connected counter, so topology alone fixes consistency time: Ω(n2/d)\Omega(n^{2/d}) under polynomial growth, Θ(1)\Theta(1) on expanders, and O(1)O(1) within a fixed neighborhood.

  • Bounding the reported consistency time (Section IV). The reported consistency time never exceeds the true one and falls short of it by at most the worst-audited link’s inflation, so near-real-time budgets can be sized on it safely.

  • Validation (§ 5). The laws are tested on simulated sheaves swept over topology and size, and on LLM agent societies prompted with O-RAN measurement reports.

System Model

Agents, Masks, Messages, and Beliefs

The control plane operates as a society of agents connected over a graph G=(V,E)G = (V, E), shown in Figure 1; N(v)\mathcal{N}(v) denotes the neighbors of agent vv. Each agent subscribes to a specific set of E2 counters, forming its public observation mask AvA_v, and observes the network metrics ov=θ∣Avo_v = \theta|_{A_v} for a given cell state θ\theta. Agents score the cell over a shared vocabulary C\mathcal{C} of scoring dimensions cc—in the running example, user-plane load (UP), control-plane signaling (CP), and mobility stress (MOB)—each fed by one or more E2 counters; Cv⊆C\mathcal{C}_v \subseteq\mathcal{C} denotes the dimensions covered by AvA_v.

Figure 1. A society of LLM xApps on a near-real-time RIC. The agents interact over a graph G=(V,E)G = (V, E), each monitoring the RAN through a public mask AvA_v. The trust layer scores each link against an expectation built from the sender’s mask alone.

Each round, agent vv emits a message over the whole vocabulary, produced by its proprietary policy πv\pi_v from its own observation and the messages its neighbors sent in the previous round. Its belief is the part of that message its mask backs:

mv=πv(ov,{mu}u∈N(v))∈[0,100]C,xv=mv∣Cv.(1)\mathbf{m}_v = \pi_v\left(o_v,\{\mathbf{m}_u\}_{u\in\mathcal{N}(v)}\right) \in[0,100]^{\mathcal{C}}, \qquad\mathbf{x}_v = \mathbf{m}_v|_{\mathcal{C}_v}. \tag*{(1)}

Each entry of xv\mathbf{x}_v is a score on the common 0–100 scale, the mean of a belief distribution with variance σv,c2\sigma_{v,c}^2 on dimension cc; the belief’s precision matrix is Λv=diag⁡(σv,c−2)c∈Cv\Lambda_v = \operatorname{diag}(\sigma_{v,c}^{-2})_{c\in\mathcal{C}_v}. The remainder of the message, mv∣C∖Cv\mathbf{m}_v|_{\mathcal{C}\setminus\mathcal{C}_v}, is asserted without evidence. The message is indexed by vertex because the same vector traverses every incident link. Because masks are public O1 metadata, an operator can invert a generic emission policy to calculate an expected belief x^v\hat{\mathbf{x}}_v on the same dimensions, based strictly on what vv is allowed to see—its observation ovo_v, with no neighbor input.

Crucially, asking agents with asymmetric views to agree on everything is ill-posed. If a signaling-focused agent lacks user-plane counters and a user-plane agent lacks control-plane counters, their beliefs do not even range over the same dimensions, and forcing xu=xv\mathbf{x}_u=\mathbf{x}_v would require both to guess blindly on unmonitored metrics. Consensus is meaningful only on the projection onto mutually observable metrics. The mathematical framework that formalizes this kind of localized, overlapping agreement is a cellular sheaf [17].

A Running Example

To illustrate why partial agreement is necessary and how the trust layer evaluates it, consider the following scenario.

Example 1 (Two agents and a signaling storm). Two agents monitor a single cell: Signaling Watch (uu, for the control plane) and Slice Guardian (vv, for the user plane); both also monitor mobility. Their masks AuA_u and AvA_v capture data during a signaling storm occurring over a lightly loaded user plane.

MaskE2SM-KPM counterDimensionReading
AuA_uRACH.PreambleDedCellCP2740
MM.HoExeFailCellMOB46
AvA_vRRU.PrbTotDlUP32
DRB.UEThpDlUP51
MM.HoExeFailCellMOB46

Table 1.

Agent uu emits the message mu=(70,85,55)\mathbf{m}_u = (70,85,55) over (UP, CP, MOB). Agent vv, after reading it, emits mv=(52,60,58)\mathbf{m}_v = (52,60,58), even though its own counters would have put the user plane near 35.

By (1), mu\mathbf{m}_u restricts to the belief xu=(−,85,55)\mathbf{x}_u=(-,85,55), and mv\mathbf{m}_v to xv=(52,−,58)\mathbf{x}_v=(52,-,58). The message mu\mathbf{m}_u is a single point; the law pup_u is the statistical distribution this message follows across operating conditions—it should be sharp on CP but diffuse on UP—and the expectation law quq_u is what the trust layer builds from the mask alone.

Agent uu’s UP score of 70 is a confident assertion its mask cannot support, and the trust layer rightfully penalizes it. Agent vv’s UP score of 52, by contrast, passes the audit because its mask covers UP—yet that score was heavily influenced by reading uu’s hallucinated message. No local inspection against qvq_v can detect this flaw: the provenance of the error is hidden entirely in the statistical dependence between the agents.

The Trust Sheaf

To manage these overlapping views mathematically, we model the network as a trust sheaf. Extending the example, uu still tracks CP and MOB, vv tracks UP and MOB, and a third agent zz tracks all three dimensions; in this configuration uu and vv are each linked to zz but not to each other.

Stalks and shared vocabularies. A sheaf F\mathcal{F} assigns each agent a vertex stalk F(v)\mathcal{F}(v), the space of its beliefs over CvC_v, and each link an edge stalk F(e)\mathcal{F}(e), the dimensions its two endpoints share. Before communicating across a link, an agent applies a restriction map

Fv→e:F(v)⟶F(e),v→e,(2)\mathcal{F}_{v\to e}:\mathcal{F}(v)\longrightarrow\mathcal{F}(e),\qquad v\to e, \tag*{(2)}

which acts as a filter, dropping every dimension its neighbor does not track.

Defining consensus. Consensus on a link e={u,z}e=\{u,z\} means the agents’ filtered beliefs match: Fu→exu=Fz→exz\mathcal{F}_{u\to e}\mathbf{x}_u=\mathcal{F}_{z\to e}\mathbf{x}_z. If uu’s belief is (80,57)(80,57) and zz’s is (44,80,57)(44,80,57), they agree on their link: uu’s (80,57)(80,57) equals zz’s restriction to the shared CP and MOB, and uu’s blindness to zz’s UP score of 44 does not break the agreement.

Measuring disagreement. When agents disagree, their current beliefs are stacked into a global state vector, a 0-cochain x∈⨁vF(v)\mathbf{x}\in\bigoplus_v\mathcal{F}(v). For the three agents, with uu and vv holding their beliefs from Example 1:

x=(−,85,55∣52,−,58∣44,80,57).(3)\mathbf{x}=(-,85,55\mid52,-,58\mid44,80,57). \tag*{(3)}

The coboundary operator δ\delta subtracts the restricted beliefs across each link. Between uu and zz (sharing CP, MOB) the disagreement is (85−80,55−57)=(5,−2)(85-80,55-57)=(5,-2); between vv and zz (sharing UP, MOB) it is (52−44,58−57)=(8,1)(52-44,58-57)=(8,1). The resulting 1-cochain collects these residuals:

δx=(5,−2∣8,1).(4)\delta\mathbf{x}=(5,-2\mid8,1). \tag*{(4)}

The Laplacian and relaxation. The network penalizes these residuals in proportion to the trust weight wew_e of each link, defined in Section II-D. With WW the diagonal matrix of link weights, the sheaf Laplacian LF≜δTWδL_{\mathcal{F}}\triangleq\delta^{\mathsf{T}}W\delta yields their weighted sum:

xTLFx=∑ewe∥(δx)e∥2.(5)\mathbf{x}^{\mathsf{T}}L_{\mathcal{F}}\mathbf{x}=\sum_e w_e\lVert(\delta\mathbf{x})_e\rVert^2. \tag*{(5)}

To resolve conflicts, the network undergoes relaxation, x˙=−LFx\dot{\mathbf{x}}=-L_{\mathcal{F}}\mathbf{x}: a local gradient descent that moves each agent’s beliefs toward its trusted neighbors, and stops only when every shared dimension agrees and δx=0\delta\mathbf{x}=0.

Gluing. Gluing is the property that lets local agreements cascade into network-wide consensus. An assignment of beliefs is consistent when all differences across links vanish, δx=0\delta\mathbf{x}=0; such a state is a global section, an element of H0(G;F)=ker⁡δH^0(G;\mathcal{F})=\ker\delta. Anchoring zz’s beliefs, an audit of the two links to zz alone drives xu=(80,57)\mathbf{x}_u=(80,57) and xv=(44,57)\mathbf{x}_v=(44,57), and so brings uu and vv, which share no link, to a common MOB = 57. On a connected graph, pairwise agreement stitches itself into global agreement, which is what licenses a purely local audit. Because WW is positive diagonal, ker⁡LF=ker⁡δ=H0\ker L_{\mathcal{F}}=\ker\delta=H^0 whatever the weights: trust sets how fast the society reaches a global section, never which global sections exist.

If calibrations conflict around loops, consensus contracts to the consistent subspace H0H^0, and relaxation projects the initial beliefs onto it with disagreement decaying as e−λ2te^{-\lambda_2t} [13], where λ2\lambda_2 is the smallest nonzero eigenvalue of LFL_{\mathcal{F}}. The time for disagreement to fall to a fraction ϵ\epsilon of its initial value is the consistency time

τ(F)≜λ2(LF)−1log⁡(1/ϵ).(6)\tau(\mathcal{F})\triangleq\lambda_2(L_{\mathcal{F}})^{-1}\log(1/\epsilon). \tag*{(6)}

The Cognitive SNR

Receivers evaluate trust via a machine Theory of Mind, auditing whether a sender’s evidence supports its claims. Comparing a transmitted message against an expectation derived from the sender’s public mask yields a cognitive signal-to-noise ratio (SNR) [5]:

Nv→e≜DKL(Fv→exv∥Fv→ex^v),γv→e≜SvNv→e,(7)N_{v\to e}\triangleq D_{\mathrm{KL}}\left(\mathcal{F}_{v\to e}x_v\mathrel{\|}\mathcal{F}_{v\to e}\hat{x}_v\right),\qquad\gamma_{v\to e}\triangleq\frac{S_v}{N_{v\to e}}, \tag*{(7)}
w(γ)≜1−exp⁡(−ηγ)∈[0,1),w(\gamma)\triangleq1-\exp(-\eta\gamma)\in[0,1),

where, as throughout, a divergence is taken between the belief distributions whose means these vectors hold. The noise Nv→eN_{v\to e} penalizes hallucinations by measuring how far the sender’s restricted message departs from the expectation its mask supports. The signal SvS_v is the confidence the sender asserts, taken as in the companion formulation [5] to be the trace of its belief’s precision matrix:

Sv≜Tr⁡(Λv)=∑c∈Cv1σv,c2.(8)S_v\triangleq\operatorname{Tr}(\Lambda_v)=\sum_{c\in C_v}\frac{1}{\sigma_{v,c}^{2}}. \tag*{(8)}

Since scores are pure numbers on the 0–100 scale, SvS_v is a dimensionless precision, whereas Nv→eN_{v\to e} is a divergence in bits; the ratio γv→e\gamma_{v\to e} therefore carries units of inverse bits, reading as asserted precision per bit of unexplained divergence. It is reported against a declared reference γ0=1 bit−1\gamma_0 = 1\ \mathrm{bit}^{-1}, exactly as power is reported in dBm against 1 mW, and written in dBcog_{\mathrm{cog}}: a value of xx dBcog_{\mathrm{cog}} means 10log⁡10(γv→e/γ0)=x10\log_{10}(\gamma_{v\to e}/\gamma_0)=x. Nothing in the three laws below turns on that choice: each is stated as a ratio in which SvS_v cancels, so the reference cancels with it.

The ratio γv→e\gamma_{v\to e} acts as a native hallucination detector: asserting high confidence without observational support spikes Nv→eN_{v\to e} and collapses the SNR. Finally, η\eta scales γ\gamma into a normalized weight, and reconciliation across a link is bottlenecked by its least credible participant: we≔w(γe)w_e \coloneqq w(\gamma_e) with γe≔min⁡v→eγv→e\gamma_e \coloneqq\min_{v\to e}\gamma_{v\to e}.

Message Laws and the Two Divergences

Across operating conditions θ\theta, (1) makes each mvm_v a random vector. The ensemble mV≔(mv)v∈V\mathbf{m}_V \coloneqq(m_v)_{v\in V} follows a joint law pVp_V with marginals pvp_v, and its dependence has two sources: shared counters feed a common θ\theta into several observations, and (1) feeds each agent its neighbors’ messages. The trust layer’s expectation qvq_v is the law of the message a generic policy would emit from ovo_v alone, with no neighbor input. Agent vv contributes Nv≔DKL(pv∥qv)N_v \coloneqq D_{\mathrm{KL}}(p_v\mathbin\Vert q_v), taken over the whole vocabulary so that unbacked claims are charged, and the reported and joint divergences are

Nlocal≔∑v∈VNv,Njoint≔DKL(pV∥∏v∈Vqv).(9)N_{\mathrm{local}} \coloneqq\sum_{v\in V}N_v,\qquad N_{\mathrm{joint}} \coloneqq D_{\mathrm{KL}}\left(p_V\mathbin\Vert\prod_{v\in V}q_v\right). \tag*{(9)}

Both measure cognitive noise in bits. In Example 1, NlocalN_{\mathrm{local}} charges uu for its unbacked UP claim and clears vv, whose UP score is backed by its own counters; NjointN_{\mathrm{joint}} also charges for vv’s UP score moving with uu’s, a dependence no marginal can represent.

Assumption 1 (Per-agent expectation). The reference law against which the trust layer scores a relayed conclusion is the product ∏v∈Vqv\prod_{v\in V}q_v, each factor built from its agent’s own observation alone.

The Composition Law

Near-real-time control loops must evaluate messages link by link, because joint audits over full network histories are computationally infeasible. Yet as agents read peer messages, their conclusions become statistically intertwined. Local audits measure individual deviations from expectation but cannot detect collective reinforcement. The composition law formalizes this blind spot: localized auditing underestimates the joint divergence by exactly the hidden dependence among agents, and so inflates reported trust.

Theorem 1 (Society divergence). For any finite society and any interaction topology, the locally visible and joint divergences of (9) differ by exactly the total correlation Φ\Phi of the messages mV\mathbf{m}_V:

Njoint=Φ(mV)+Nlocal.(10)N_{\mathrm{joint}}=\Phi(\mathbf{m}_V)+N_{\mathrm{local}}. \tag*{(10)}

where Φ(mV)≔DKL(pV∥∏v∈Vpv)=∑v∈Vh(mv)−h(mV)\Phi(\mathbf{m}_V)\coloneqq D_{\mathrm{KL}}\left(p_V\mathbin\Vert\prod_{v\in V}p_v\right)=\sum_{v\in V}h(m_v)-h(\mathbf{m}_V) and h(⋅)h(\cdot) is the differential entropy.

Proof. Assume pV≪∏vqvp_V\ll\prod_vq_v and all terms finite. This holds in practice because each qvq_v is, by the law of a generic policy’s output, assigns positive density to every score on every dimension—on dimensions outside the mask it reduces to an uninformative prior—so no feasible message is declared impossible. Inserting log⁡∏vpv\log\prod_vp_v,

Njoint≔Ep[log⁡pV∏vqv]=Ep[log⁡pV∏vpv]+Ep[log⁡∏vpv∏vqv].(11)N_{\mathrm{joint}}\coloneqq\mathbb{E}_{p}\left[\log\frac{p_V}{\prod_vq_v}\right] =\mathbb{E}_{p}\left[\log\frac{p_V}{\prod_vp_v}\right]+\mathbb{E}_{p}\left[\log\frac{\prod_vp_v}{\prod_vq_v}\right]. \tag*{(11)}

Term (a) is DKL(pV∥∏v∈Vpv)=Φ(mV)D_{\mathrm{KL}}(p_V\mathbin\Vert\prod_{v\in V}p_v)=\Phi(\mathbf{m}_V). By linearity of expectation, term (b) splits into ∑v∈VEp[log⁡pv(mv)/qv(mv)]=Nlocal\sum_{v\in V}\mathbb{E}_p[\log p_v(m_v)/q_v(m_v)]=N_{\mathrm{local}}. ■

The proof uses only Assumption 1 and linearity of expectation—no ordering, no Markov property—so the topology shapes pVp_V without entering the statement, and independent messages give Φ=0\Phi=0. In Example 1 the shortfall is Φ(m{u,v})=I(mu;mv)\Phi(\mathbf{m}_{\{u,v\}})=I(m_u;m_v), which reflects both the shared MOB counter and vv’s persuasion. Three readings follow at once. Since Φ(mV)≥0\Phi(\mathbf{m}_V)\ge0 by Gibbs’ inequality, Njoint≥NlocalN_{\mathrm{joint}}\ge N_{\mathrm{local}}, with equality iff the messages are mutually independent, so a per-link audit is optimistic and never pessimistic. The shortfall does not depend on the per-agent expectations: term (a) involves only the pvp_v, never the qvq_v, so Φ(mV)\Phi(\mathbf{m}_V) survives any choice of qvq_v, and no amount of care in modeling the senders recovers it. And because γ\gamma decreases with divergence while ww increases with γ\gamma, the gap reaches the reported trust weights intact, rescaling the society’s confidence by a single factor.

Corollary 1 (Uniform SNR inflation). Let S≔∑v∈VSvS\coloneqq\sum_{v\in V}S_v. The reported and joint-consistent cognitive SNRs γrep≔S/Nlocal\gamma^{\mathrm{rep}}\coloneqq S/N_{\mathrm{local}} and γjoint≔S/Njoint\gamma^{\mathrm{joint}}\coloneqq S/N_{\mathrm{joint}} satisfy

γrepγjoint=NjointNlocal=1+ΦNlocal≔β≥1.(12)\frac{\gamma^{\mathrm{rep}}}{\gamma^{\mathrm{joint}}}=\frac{N_{\mathrm{joint}}}{N_{\mathrm{local}}}=1+\frac{\Phi}{N_{\mathrm{local}}}\coloneqq\beta\ge1. \tag*{(12)}

Proof. By (8), SvS_v depends only on what vv transmitted, not on any reference law, so it is objective and receiver-compatible yet intrinsic to the sender. The local evaluation sums these per-agent signals. The joint evaluation reads the society’s asserted precision, which is block-diagonal because no agent transmits cross-covariances; its trace is therefore the same ∑vSv=S\sum_vS_v=S. The two evaluations thus share the confidence SS and differ only in their reference law, so SS cancels and (12) is Theorem 1 divided by NlocalN_{\mathrm{local}}. Since Φ(mV)≥0\Phi(\mathbf{m}_V)\ge0, β≥1\beta\ge1.

This is what lets the shortfall be read as a power ratio without any commitment about how confidence is measured. Both evaluations share the same declared signal SS, which cancels identically, so β\beta is a dimensionless factor by which the audit over-reports the society’s cognitive SNR. Its decibel reading, 10log⁡10β10\log_{10}\beta, is therefore an unqualified decibel, produced by the topology and the message correlations rather than by the agents’ calibration, and no recalibration can reduce it.

Scaling and Consistency Time

When a network scales, smaller local societies are glued into larger ones, as described in Section II-C. Gluing preserves locally certified states, and the consensus space H0=ker⁡δH^0 = \ker\delta does not depend on the weights; so neither growth nor the trust inflation of Corollary 1 alters which agreements are valid. What both change is the rate of convergence—how fast agents agree, not whether they agree. To understand this speed limit, consider how the structure tracks variables. Because links compare only shared counters—comparing CP while ignoring UP, for instance—dimensions never mix, and the Laplacian decouples into independent reconciliation processes, one per dimension.

Lemma 1 (The society splits by dimension). Let every restriction map be a coordinate projection onto the dimensions its link shares, and let GcG_c, the subgraph sharing dimension cc, be connected. The Laplacian decomposes as LF=⨁cLGcwL_F = \bigoplus_c L^w_{G_c}, where LGcwL^w_{G_c} is the graph Laplacian of GcG_c carrying the trust weights. The algebraic connectivity and the consistency time are therefore set entirely by the slowest dimension:

λ2(LF)=min⁡cλ2(LGcw),τ(F)=max⁡cτ(Gc).(13)\lambda_2(L_F) = \min_c \lambda_2(L^w_{G_c}), \qquad\tau(F) = \max_c \tau(G_c). \tag*{(13)}

Proof: The Laplacian (5) computes differences across links with no cross-terms between dimensions. The spectrum of the direct sum is the union of the individual spectra, with unshared dimensions contributing only to the kernel.

This creates a counter-intuitive dynamic: widely shared counters demand global consensus and become bottlenecks, while narrowly shared dimensions reconcile quickly across local links. Because Lemma 1 isolates each dimension into an ordinary graph GcG_c, classical graph theory dictates how topology governs the worst-case consistency time. Below, Br(v)B_r(v) denotes the radius-rr ball around vv, the agents within rr hops of it, and a graph has polynomial growth dd when its ball sizes scale as rdr^d.

Proposition 1 (Consistency time vs. topology). Let the consistency time (6) be evaluated for link weights w≥wmin⁡>0w \ge w_{\min} > 0, on any sheaf F′F' over a subgraph of GG. Topology dictates convergence: (i) Global scaling: On graphs with polynomial growth dd (e.g., grids) and nn agents, consistency slows as Ω(n2/d)log⁡(1/ε)\Omega(n^{2/d}) \log(1/\varepsilon). Expander graphs, conversely, maintain a constant time Θ(1)log⁡(1/ε)\Theta(1) \log(1/\varepsilon) [14 Ch. 1–2]. (ii) Local scaling: Consistency within any ball Br(v)B_r(v) depends only on local geometry, independent of nn:

τ(F∣Br(v))≤∣Br(v)∣diam⁡(Br(v))4wmin⁡log⁡1ε.(14)\tau\left(F\big|_{B_r(v)}\right) \le\frac{|B_r(v)|\operatorname{diam}(B_r(v))}{4w_{\min}}\log\frac{1}{\varepsilon}. \tag*{(14)}

(iii) Universal bound: If the maximum degree Δ\Delta is bounded, every radius-rr ball reconciles in O(1)O(1) time with respect to nn, whatever the global topology.

Proof: By Lemma 1, it suffices to analyze each GcG_c, the slowest of which sets the overall speed. (i) On polynomial-growth graphs, standard spectral theory gives λ2=O(n−2/d)\lambda_2 = O(n^{-2/d}), which through (13) yields the Ω(n2/d)\Omega(n^{2/d}) bound. Expander graphs preserve a constant gap Θ(1)\Theta(1) [14 Ch. 1–2], so the society is fast if every dimension expands. (ii) Restricting each GcG_c to Br(v)B_r(v) gives a subgraph G′G' with at most ∣Br(v)∣|B_r(v)| vertices and diameter at most diam⁡(Br(v))\operatorname{diam}(B_r(v)). Mohar’s lower bound on algebraic connectivity [15] states that for any graph G′=(V′,E′)G' = (V', E') with minimum edge weight wmin⁡w_{\min}, λ2≥4wmin⁡/(∣V′∣diam⁡(G′))\lambda_2 \ge4w_{\min}/(|V'|\operatorname{diam}(G')). Inverting λ2\lambda_2 yields (14), which depends only on rr and the maximum degree. (iii) With maximum degree Δ\Delta, the Moore bound gives ∣Br(v)∣≤1+Δ∑k<r(Δ−1)k|B_r(v)| \le1 + \Delta\sum_{k<r}(\Delta- 1)^k [23], and diam⁡(Br(v))≤2r\operatorname{diam}(B_r(v)) \le2r, so (14) is O(1)O(1) in nn. ▪

Topologyddλ2(LG)\lambda_2(L_G)τ(F)\tau(F)Measured
Path, Ring1Θ(n−2)\Theta(n^{-2})Θ(n2)\Theta(n^2)2.00, 1.99
Grid2Θ(n−1)\Theta(n^{-1})Θ(n)\Theta(n)0.98
Expander∞\inftyΘ(1)\Theta(1)Θ(1)\Theta(1)−0.12
Complete—Θ(n)\Theta(n)Θ(n−1)\Theta(n^{-1})−1.03

Table 1 (PDF p. 5). Consistency time versus topology as nn grows. For these named families the order is tight, so the Ω(n2/d)\Omega(n^{2/d}) of Proposition 1 sharpens to Θ(⋅)\Theta(\cdot). The last column is the exponent of nn fitted to the measured consistency time.

Table 1 summarizes this architectural reality: standard physical topologies such as paths and grids cannot achieve global consensus at scale, and only expanders or dense networks maintain a bounded global consistency time. Otherwise, architects must rely on (14), ensuring that well-connected local neighborhoods reconcile quickly, independent of the broader network.

While Proposition 1 maps theoretical speeds, real-world auditing is imperfect. Applying Theorem 1 to the sub-society each link’s audit sees gives an inflation βe≥1\beta_e \ge1 per link ee (Corollary 1), so the network is driven by distorted weights. The βe\beta_e need not be equal across links, and Theorem 2 uses only βe≥1\beta_e \ge1, not their values. This creates a discrepancy between the reported consistency time τrep\tau^{\mathrm{rep}}, computed from the inflated weights, and the true consistency time τjoint\tau^{\mathrm{joint}}, computed from the joint-consistent weights. The per-link audit cannot see this inflation, Theorem 2 proves the error is bounded, one-sided, and set by the worst-audited link.

Theorem 2 (Consistency-time bias under inflated trust). For any sheaf F′F' and inflations βe≥1\beta_e \ge1, the ratio of the reported to the true consistency time is bounded by

(max⁡eβe)−1≤τrep(F′)τjoint(F′)≤1.(15)\left(\max_e \beta_e\right)^{-1} \le\frac{\tau^{\mathrm{rep}}(F')}{\tau^{\mathrm{joint}}(F')} \le1. \tag*{(15)}

Proof: Because w(γ)w(\gamma) is concave and increasing with w(0)=0w(0) = 0, the distorted weights w(βeγe)w(\beta_e\gamma_e) are sandwiched as w(γe)≤w(βeγe)≤(max⁡eβe)w(γe)w(\gamma_e) \le w(\beta_e\gamma_e) \le(\max_e \beta_e)w(\gamma_e). This ordering transfers to the Laplacians and hence to λ2\lambda_2, and inverting yields (15). ▪

This theorem provides a predictable fail-safe. Because βe≥1\beta_e \ge1, the reported time τrep\tau^{\mathrm{rep}} is optimistic, but the error is tightly capped. (i) Lower bound: the network never synchronizes faster than reported, τrep≤τjoint\tau^{\mathrm{rep}} \le\tau^{\mathrm{joint}}. (ii) Capped delay: errors do not compound; the true delay is capped by the single worst-measured link, τjoint≤τrep×max⁡eβe\tau^{\mathrm{joint}} \le\tau^{\mathrm{rep}}\times\max_e\beta_e. (iii) Guaranteed budgets: multiplying the reported time by the maximum known inflation yields a safe upper bound, so if that bound meets the real-time requirement, the true system does too. This fail-safe complements the local scaling law:

Corollary 2 (Locality improves the consistency time). Restricting the check to a ball Br(v)B_r(v) improves the error bound to (max⁡e⊆Br(v)βe)−1(\max_{e\subseteq B_r(v)}\beta_e)^{-1}, rendering the fidelity of the local consistency time immune to poorly audited links outside the ball.

Locality thus offers a double advantage: local neighborhoods not only reconcile faster (Proposition 1), their reported consistency times are also more faithful (Corollary 2). A society can therefore guarantee reliable near-real-time local synchronization even if its distant periphery degrades.

Numerical Results

We evaluate the framework in two regimes: elicited LLM agent societies, to test whether the trust shortfall of Theorem 1 is real, and simulated sheaves swept across topologies and sizes, to test the bounds of Proposition 1 and Theorem 2.

Experimental Setup

Our experiment runs five xApps with overlapping E2SM-KPM observation masks (Figure 1). All agents track a shared MOB counter (MM.HoExeFailCell), establishing a baseline correlation, and each is a locally hosted Mistral 7B model (temperature 0.6, a single sample per message). To separate interaction effects from that baseline, identical scenarios and seeds run across three topologies: (i) an isolated control without communication, where correlation stems solely from the shared counter; (ii) a path topology along a linear chain; and (iii) a complete topology with full peer context.

Each agent reports its own assessment of the cell, using its neighbors’ messages purely as context rather than claims to restate, as in (1). The expectations qvq_v are elicited from the same model given ovo_v alone, with no neighbor messages. Generator and auditor therefore share a prior, which under-states NvN_v: every number below is the optimistic end of what an operator auditing against an independent reference would measure. To measure asserted precision without altering live communication, each agent is prompted a second time with a fresh seed, and this second answer is never transmitted.

Pooled across scenarios, the squared difference between the two responses gives σv,c2\sigma_{v,c}^{2}, floored at two score points so that identical answers cannot generate infinite trust; the signal SvS_v from (8) is then the sum of the reciprocal variances. Because every quantity reported below is a ratio in which SvS_v cancels, none of them depends on this elicitation: it fixes the absolute SNRs of Figure 2b, not their separation.

Figure 2. (a) Unseen divergence share Φ/Njoint\Phi/N_{\mathrm{joint}} across network topologies as a function of society size; the right axis carries the same measurement as the SNR penalty 10log⁡10β10\log_{10}\beta. (b) Reported (S/Nlocal)(S/N_{\mathrm{local}}) versus joint (S/Njoint)(S/N_{\mathrm{joint}}) cognitive SNR in dBcog_{\mathrm{cog}}; their separation is that penalty at n=5n=5, and is independent of the reference (Corollary 1).

The Composition Law

Per-link audits miss joint divergence, creating a blind spot that expands with network scale and density (Figure 2a). At n=5n=5, hidden divergence reaches 10%, 13% and 23% (β≈1.12\beta\approx1.12, 1.15, and 1.30) for the isolated, path, and complete societies. The 10% isolated baseline forms a structural floor from the shared counter. Communication expands the gap: a complete topology hides nearly double a path’s share, with 13 of its 23 points driven by peer persuasion rather than shared data.

This shortfall distorts the trust layer by inflating reported confidence (Figure 2b). Inter-agent context sharpens beliefs and raises both the reported and the joint cognitive SNR, but the reported one grows faster. Their separation is the penalty of Corollary 1, widening from 0.48 dB with isolated agents to 0.60 dB along a path and 1.14 dB in a complete society. Dense societies thus present a paradox: they report the highest confidence precisely where the audit harbors its largest blind spot.

The Scaling Law

Sweeping network size (n=9…196n=9\ldots196) confirms that topology dictates real-time feasibility (Figure 3), matching Table 1: (i) path topologies scale quadratically, Θ(n2)\Theta(n^2), exceeding the 1 s near-real-time budget at n∗=13n^{*}=13 agents (0.5 s to >200>200 s); (ii) grids scale linearly, Θ(n)\Theta(n), breaching it at n∗=172n^{*}=172 (60 ms to 1.1 s); and (iii) expanders maintain flat Θ(1)\Theta(1) consistency times (100–400 ms), remaining within budget at every size. Local audits (dashed lines) bypass the global limits of sparse networks: a radius-3 audit converges in ≈300\approx300 ms on paths regardless of size, roughly 700× faster than the global consistency time at n=196n=196. On grids, local times plateau near 200 ms. On expanders, local and global consistency times coincide, as Proposition 1 predicts: local shortcuts are unnecessary when global mixing is already fast.

Figure 3. Consistency time versus society size (12 random sheaves per point; 10 ms per diffusion round). Solid lines denote global consistency times; dashed lines denote local radius-3 audits. The shaded band marks the 1 s near-real-time budget.

The Consistency-Time Law

We evaluate Theorem 2 as an operational budgeting rule across 120 random sheaves, comparing the multiplier actually needed, τjoint/τrep\tau^{\mathrm{joint}}/\tau^{\mathrm{rep}}, against the maximum link inflation max⁡eβe\max_{e}\beta_{e} (Figure 4). The bound holds in every trial. Operators can therefore prevent timing violations by scaling the reported consistency time by max⁡eβe\max_{e}\beta_{e}, computed from the message streams through Φ\Phi. Specifically, (i) trials land on the diagonal across scales, showing that the bound is tight; (ii) not knowing where the inflation sits costs only minor slack, under 1.5×1.5\times (e.g., 3.0×3.0\times needed against 3.7×3.7\times guaranteed); and (iii) radius-3 balls obey the same rule with the maximum taken over the links inside the ball (Corollary 2), none of their points lying above the diagonal. A neighborhood’s consistency time can thus be budgeted from the inflation of its own links alone, whatever the audit quality elsewhere in the society.

Figure 4. The multiplier τjoint/τrep\tau^{\mathrm{joint}}/\tau^{\mathrm{rep}} needed versus the one Theorem 2 guarantees, over 120 random sheaves on n=100n=100 agents, each certified globally and on a radius-3 ball.

Conclusion

Link-by-link trust evaluation keeps an O-RAN RIC within its tight control loop but obscures how agent conclusions depend on one another. This blind spot is exact: the joint divergence exceeds the reported local sum by the total correlation of the transmitted messages. In agent societies this creates a trust paradox: as communication increases, reported confidence rises while unobserved dependence hides up to 23% of the joint divergence in dense networks. Modeling the control plane as a cellular sheaf shows that this mis-measured audit still certifies valid consensus states, sacrificing only convergence speed. Reconciliation decomposes by metric counter, making consensus as slow as the worst-connected dimension, and consistency time grows quadratically with network diameter: path topologies breach a 1 s near-real-time budget at n∗=13n^{*}=13 agents and grids at n∗=172n^{*}=172, whereas radius-3 local audits converge in ≈300\approx300 ms regardless of network size. Multiplying the reported consistency time by the worst-link inflation max⁡eβe\max_{e}\beta_{e} provides a safe operational bound. Two practical strategies emerge to secure agent control planes: (i) architecturally, by minimizing network diameter, deploying expanders, or relying on local audits; and (ii) informationally, by estimating unobserved message correlations directly from relayed traffic, without access to proprietary agent internals.

References

  1. [1]TM Forum, “Autonomous networks: Technical architecture,” TM Forum, Tech. Rep. IG1230, 2023.
  2. [2]L. Bariah, Q. Zhao, H. Zou, Y. Tian, F. Bader, and M. Debbah, “Large generative AI models for telecom: The next big thing?” IEEE Commun. Mag., vol. 62, no. 11, pp. 84–90, Nov. 2024.arxiv.org/abs/2306.10249
  3. [3]E. Calvanese Strinati, S. Barbarossa, J. L. Gonzalez-Jimenez, D. Kténas, N. Cassiau, L. Maret, and C. Dehos, “6G: The next frontier: From holographic messaging to artificial intelligence using subterahertz and visible light communication,” IEEE Veh. Technol. Mag., vol. 14, no. 3, pp. 42–50, Sept. 2019.
  4. [4]J. S. Park, J. C. O’Brien, C. J. Cai, M. R. Morris, P. Liang, and M. S. Bernstein, “Generative agents: Interactive simulacra of human behavior,” in Proc. ACM Symp. User Interface Software and Technology (UIST), San Francisco, CA, USA, Oct. 2023.arxiv.org/abs/2304.03442
  5. [5]H. Chergui, C. Fernández-Martínez, M. Bennis, and M. Debbah, “Agents that model agents: Five principles toward a theory of mind for 6G networks,” 2026, arXiv:2609.01779.arxiv.org/abs/2609.01779
  6. [6]W. Saad, M. Bennis, and M. Chen, “A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,” IEEE Netw., vol. 34, no. 3, pp. 134–142, May/Jun. 2020.arxiv.org/abs/1902.10265
  7. [7]M. Kosinski, “Evaluating large language models in theory of mind tasks,” Proc. Natl. Acad. Sci., vol. 121, no. 45, 2024.DOI
  8. [8]T. Ullman, “Large language models fail on trivial alterations to theory-of-mind tasks,” 2023, arXiv:2302.08399.
  9. [9]M. Polese, L. Bonati, S. D’Oro, S. Basagni, and T. Melodia, “Understanding O-RAN: Architecture, interfaces, algorithms, security, and research challenges,” IEEE Commun. Surveys Tuts., vol. 25, no. 2, pp. 1376–1411, 2nd Quarter 2023.arxiv.org/abs/2202.01032
  10. [10]Z. Ji, N. Lee, R. Frieske, T. Yu, D. Su, Y. Xu, E. Ishii, Y. Bang, A. Madotto, and P. Fung, “Survey of hallucination in natural language generation,” ACM Comput. Surv., vol. 55, no. 12, p. Art. 248, Dec. 2023.DOI
  11. [11]D. Gündüz, Z. Qin, I. Estella Aguerri, H. S. Dhillon, Z. Yang, A. Yener, K. K. Wong, and C.-B. Chae, “Beyond transmitting bits: Context, semantics, and task-oriented communications,” IEEE J. Sel. Areas Commun., vol. 41, no. 1, pp. 5–41, Jan. 2023.
  12. [12]A. Jøsang, R. Ismail, and C. Boyd, “A survey of trust and reputation systems for online service provision,” Decis. Support Syst., vol. 43, no. 2, pp. 618–644, Mar. 2007.
  13. [13]R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520–1533, Sept. 2004.
  14. [14]F. R. K. Chung, Spectral Graph Theory, ser. CBMS Reg. Conf. Ser. Math. Amer. Math. Soc., 1997, no. 92.
  15. [15]B. Mohar, “Eigenvalues, diameter, and mean distance in graphs,” Graphs Combin., vol. 7, no. 1, pp. 53–64, Mar. 1991.DOI
  16. [16]L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Syst. Control Lett., vol. 53, no. 1, pp. 65–78, Sept. 2004.
  17. [17]J. Hansen and R. Ghrist, “Toward a spectral theory of cellular sheaves,” J. Appl. Comput. Topol., vol. 3, pp. 315–358, Dec. 2019.arxiv.org/abs/2005.12798
  18. [18]——, “Opinion dynamics on discourse sheaves,” SIAM J. Appl. Math., vol. 81, no. 5, pp. 2033–2060, Jan. 2021.arxiv.org/abs/2005.12798
  19. [19]I. Csiszár, “I-divergence geometry of probability distributions and minimization problems,” Ann. Probab., vol. 3, no. 1, pp. 146–158, Feb. 1975.DOI
  20. [20]S. Watanabe, “Information theoretical analysis of multivariate correlation,” IBM J. Res. Develop., vol. 4, no. 1, pp. 66–82, Jan. 1960.DOI
  21. [21]T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Hoboken, NJ: Wiley, 2006.
  22. [22]T. M. Cover and A. A. El Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572–584, Sept. 1979.
  23. [23]M. Miller and J. Sirán, “Moore graphs and beyond: A survey of the degree/diameter problem,” The Electronic Journal of Combinatorics, vol. Dynamic Surveys, pp. #DS14: May 16, 2013, Dec. 2005.

Paper details

vlnc:W_7kajuzpw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents