Sampling Algorithms for Hypergraphs and Contingency Tables

Time

-

Locations

E1 121

Host

Applied Mathematics

Speaker

Sonja Petrović
IIT Applied Math
www.iit.edu/directory/people/sonja-petrovic

Description

One of the basic statistical questions relies upon sampling the space of observations with a fixed statistics. Sampling algorithms are a basic building block of a scheme for testing how well a statistical model fits the observed data. This talk, adapted from a short talk just presented at the Joint Math Meetings in San Antonio, will explain what types of sampling problems on hypergraphs and tables arise in algebraic statistics.

Event Topic

Nonlinear Algebra and Statistics (NLASTATS)

Tags: