## Abstract

A large deviations principle (LDP), demonstrated for occupancy problems with indistinguishable balls, is generalized to the case in which balls are distinguished by a finite number of colors. The colors of the balls are chosen independently from the occupancy process itself. There are r balls thrown into n urns with the probability of a ball entering a given urn being 1 / n (i.e. Maxwell-Boltzmann statistics). The LDP applies with the scale parameter, n, tending to infinity and r increasing proportionally. The LDP holds under mild restrictions, the key one being that the coloring process by itself satisfies an LDP. This includes the important special cases of deterministic coloring patterns and colors chosen with fixed probabilities independently for each ball.

Original language | English |
---|---|

Pages (from-to) | 115-141 |

Number of pages | 27 |

Journal | Journal of Applied Probability |

Volume | 44 |

Issue number | 1 |

DOIs | |

Publication status | Published - Mar 2007 |

Externally published | Yes |

## Keywords

- Circuit-switched network
- Coloring process
- Maxwell-boltzmann statistics
- Occupancy model
- Optical packet switching
- Population estimation
- Sample path large deviations principle