Nathan B. Shank

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We extend the classical coupon collector problem to find the expected number of selections needed to collect mi (possible random) copies of coupon i, when the distribution of the coupons is not necessarily equally likely. Upper and lower bounds which provide limiting asymptotics are also obtained for the expected number of selections needed to fulfill a(More)
Many different random graphs have been studied recently, especially since the 1960’s. They have been connected with many different areas including networks, biology, sociology, and forensics. Random graphs and Euclidean graphs will be explored at different levels. Examples of these graphs will be shown along with different properties and their applications.(More)
  • 1