chapotraphouse

(For anyone here who does programming, the analogy I'm probably poorly trying to make is to Big O notation)

A small o notation would work somewhat better here, as big O just tells us about final boundedness of a function given a topological filter, and also doesn't tell us how the function behaves compared to previous 'n's.
With small o notation, you could order the tiers starting from the wealthiest/most influential/etc. This way, you could go for something like 'the way violence against people of tier n is considered/respected/recognised (on some relevant scale) is o(n) (with the topological filter n->inf'. o(n) given some topological filter F is a set of functions that can be represented as n multiplied by some other function that has the limit of 0 given the topological filter F, basically. The expression 'f(n) = o(n) [given topological filter F]' can be read as 'f is infinitely small relative to n [given topological filter F]'.