Local-count independence in a linear flow network (source code)

= Local-count independence in a linear flow network
{title2=$E n_i=\rho_i/(1-\rho_0-\rho_i)$}

Summing the <stationary law of a linear flow network> over its through-flow count gives independent local <geometric distributions> with ratios $q_i=\rho_i/(1-\rho_0)$. This gives the displayed means. The local counts are independent of one another in this marginal distribution; the through count is generally dependent on them. The <independence> is a stationary distributional fact, not an assertion that their dynamics evolve independently.