Stochastic Service Systems, Random Interval Graphs and Search Algorithms

Authors

Patrick Eschenfeldt '12, Harvey Mudd CollegeFollow
Ben Gross '13, Harvey Mudd CollegeFollow
Nicholas Pippenger, Harvey Mudd CollegeFollow

Student Co-author

HMC Undergraduate

Document Type

Article

Department

Mathematics (HMC)

Publication Date

2013

Abstract

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.

DOI

10.1002/rsa.20485

Recommended Citation

Eschenfeldt, P., Gross, B. and Pippenger, N. (2013), Stochastic service systems, random interval graphs and search algorithms. Random Struct. Alg.. doi: 10.1002/rsa.20485