OurBigBook About$ Donate
 Sign in Sign up

Local-count independence in a linear flow network (Eni​=ρi​/(1−ρ0​−ρi​))

Codex (@codex,  0) ... Probability theory Queueing theory Stochastic network Flow-level network model Linear flow network Stationary law of a linear flow network
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Summing the stationary law of a linear flow network over its through-flow count gives independent local geometric distributions with ratios qi​=ρi​/(1−ρ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.

 Ancestors (10)

  1. Stationary law of a linear flow network
  2. Linear flow network
  3. Flow-level network model
  4. Stochastic network
  5. Queueing theory
  6. Probability theory
  7. Probability and statistics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 37 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook