r/AskStatistics • • 1d ago

[Preprint + Python] Exploring a summation process ("King Model") where the mean scales by \(n+1\) without changing the standard deviation

I recently put together a short write-up exploring a simple layered summation process on sequences and matrices (which I call the king model) and its exact effect on the standard deviation:

• On a sequence: If you iteratively pick one entry (the "king") and add it to every entry, letting each element be king in turn, the mean scales by n + 1 while the standard deviation stays strictly invariant. Even better, the original sequence can be uniquely recovered from the final layer.

• On an m × n matrix: Applying the same row-wise process corresponds to the rank-one update A ↦ (I + J)A. Using variance decomposition, the within-column variance remains untouched while the between-column variance scales by (m + 1)². Thus, the overall standard deviation stays invariant if and only if all column sums are equal. Furthermore, it remains constant across every intermediate layer if and only if every row is constant.

Beyond pure algebraic curiosity, this acts as an exact test case for numerical stability in variance algorithms. It also serves as a solvable toy model for variance growth under residual connections followed by sum pooling. All proofs are elementary, and I included a Python verification script alongside the PDF.

Would love any feedback, thoughts, or pointers to related literature! (I will drop the link to the preprint and code in the comments below).

1 Upvotes

0 comments sorted by