Algebraic statistics, tables, and networks: The Fienberg advantage

10/03/2019
by   Elizabeth Gross, et al.
0

Stephen Fienberg's affinity for contingency table problems and reinterpreting models with a fresh look gave rise to a new approach for hypothesis testing of network models that are linear exponential families. We outline his vision and influence in this fundamental problem, as well as generalizations to multigraphs and hypergraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2017

Two-Sample Tests for Large Random Graphs Using Network Statistics

We consider a two-sample hypothesis testing problem, where the distribut...
research
11/14/2018

Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing

This paper surveys some recent developments in fundamental limits and op...
research
06/23/2019

Algebraic Statistics in Practice: Applications to Networks

Algebraic statistics uses tools from algebra (especially from multilinea...
research
11/07/2020

Hypothesis testing with low-degree polynomials in the Morris class of exponential families

Analysis of low-degree polynomial algorithms is a powerful, newly-popula...
research
05/17/2020

Marginal likelihood computation for model selection and hypothesis testing: an extensive review

This is an up-to-date introduction to, and overview of, marginal likelih...
research
05/25/2019

LUTNet: speeding up deep neural network inferencing via look-up tables

We consider the use of look-up tables (LUT) to speed up and simplify the...

Please sign up or login with your details

Forgot password? Click here to reset