Stochastic Service Systems, Random Interval Graphs and Search Algorithms

Student Co-author

HMC Undergraduate

Document Type



Mathematics (HMC)

Publication Date



We consider several stochastic service systems, and study the asymptotic behavior of the moments of various quantities that have application to models for random interval graphs and algorithms for searching for an idle server or for an vacant or occupied waiting station. In some cases the moments turn out to involve Lambert series for the generating functions for the sums of powers of divisors of positive integers. For these cases we are able to obtain complete asymptotic expansions for the moments of the quantities in question.

Rights Information

© 2013 Wiley Periodicals, Inc.

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.