Unless otherwise noted, all talks are in 120 Hanes Hall, at 3:30 PM on Mondays and Wednesdays. Prior to the talk, from 3:00-3:30 PM, the audience is invited for refreshments in the lounge on the 3rd floor of Hanes Hall. If you would like to suggest a speaker, or get on our mailing list, please send an email to Dr. Gabor Pataki or Dr. Vladas Pipiras.
For talks given before 2016, click here. In addition to weekly colloquia and seminars, annual Hotelling lectures are held to honor the memory of Professor Harold Hotelling, first chairman of the “Department of Mathematical Statistics.”
Upcoming Events › STOR Colloquium
Events List Navigation
Directed complex networks and ranking algorithms In the first part of this talk I will discuss a family of inhomogeneous directed random graphs for modeling complex networks such as the web graph, Twitter, ResearchGate, and other social networks. This class of graphs includes as a special case the classical Erdos-Renyi model, and can be used to replicate almost any type of predetermined degree distributions, in particular, power-law degrees such as those observed in most real-world networks. I will mention during…Find out more »
Title: Statistical Implications of Turing’s Formula Abstract: This talk is organized into three parts. Turing’s formula is introduced. Given an iid sample from a countable alphabet under a probability distribution, Turing’s formula (introduced by Good (1953), hence also known as the Good-Turing formula) is a mind-bending non-parametric estimator of total probability associated with letters of the alphabet that are NOT represented in the sample. Many of its statistical properties were not clearly known for a stretch of nearly…Find out more »