SearcharxivSearch

arXiv subjects

Stelios Savva

Publications and source records attributed to Stelios Savva.

2 recordsLinked to original sources

A commutant gate for spectral fitting through symmetry forced degeneracy

Learned spectral models fail at symmetry forced degenerate sectors for two distinct reasons. Where symmetry forces levels to coincide exactly, the per level observable one would normally fit is not well defined, since every unit vector of that shared space is an eigenvector; and near a symmetry protected crossing, the eigenvector observable gradient carries a factor 1/(lambda_i - lambda_j) that is genuinely singular as the gap closes. The usual response is to regularize the divergence or threshold the gap, and both carry a real cost: a fixed gap cannot both protect a forced multiplet and keep two genuinely distinct levels apart. We show a different fix, on synthetic operator families with a known symmetry answer key. A gate reads the symmetry structure directly from the observed operators, as the linear commutant of the family, one singular value decomposition nullspace, following the simultaneous block diagonalization of Maehara and Murota. Block identity is read from the centre of that commutant rather than from eigenvalue clustering, which makes the forced versus accidental distinction structural rather than metric, and the objective switches between a projector trace through forced blocks and a per level target elsewhere. Under operator estimation noise the gate classifies correctly to epsilon of about 0.3, where energy clustering already fails by 0.02. Gated fitting reaches the truth at machine precision in both the symmetric and the symmetry breaking regime, in the latter converging to a truth that is a singularity of the ungated objective, and observable bias sits at the noise floor. Validation off the regular representation, where multiplicity and dimension separate, eliminated two defective estimators that all regular representation tests had passed. The demonstrated object is a gated estimator; a full parametric matrix model, with the matrices learned, is the next experiment.

math.NA

When a common price signal is present, network topology leaves no fingerprint on a storage fleet's collective dynamics

Price-based mean-field models of battery storage coordination usually assume that each agent responds to the true population-average charging power. Under that assumption, communication topology is irrelevant because the broadcast price already carries the coupling that matters. We study a nearby regime in which agents respond to a shared noisy forecast of the average, with correlation rho between agents' forecast errors. Analytically and in simulation, we find that topology remains undetectable in the effective-dimensional response of the fleet, even when neighbour observation is the only explicit communication signal. The mechanism is structural: the correlated forecast error projects onto the graph-invariant consensus mode, while topology acts through transverse modes. As rho N grows, the consensus-mode variance dominates and the spectral participation ratio approaches one independently of graph topology. Simulations on linear, star, and small-world graphs confirm that topology-induced variation is below the variation caused by redrawing the forecast noise. The result is not a claim that topology has no dynamical effect, but that shared stochastic forcing can mask topology-dependent modes in decentralized storage fleets.

nlin.CD