AI Chat AI Image Generator AI Video Text to Speech

Maximum likelihood estimation for discrete exponential families and random graphs

11/29/2019

∙

by Krzysztof Bogdan, et al.

∙

∙

We characterize the existence of maximum likelihood estimators for discrete exponential families and give applications to random graph models.

Krzysztof Bogdan
1 publication
Michał Bosy
4 publications
Tomasz Skalski
4 publications

page 1

page 2

page 3

page 4

research

∙ 12/14/2020

Toric invariant theory for maximum likelihood estimation in log-linear models

We establish connections between invariant theory and maximum likelihood...

0 Carlos Améndola, et al. ∙

research

∙ 04/10/2022

Existence of maximum likelihood estimates in exponential random graph models

We present a streamlined proof of the foundational result in the theory ...

0 Henry Bayly, et al. ∙

research

∙ 11/28/2021

An inverse Sanov theorem for curved exponential families

We prove the large deviation principle (LDP) for posterior distributions...

0 Claudio Macci, et al. ∙

research

∙ 06/03/2021

Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions

Integrating discrete probability distributions and combinatorial optimiz...

0 Mathias Niepert, et al. ∙

research

∙ 12/26/2018

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks

Given a pair of graphs with the same number of vertices, the inexact gra...

0 Jesús Arroyo, et al. ∙

research

∙ 08/12/2021

Longitudinal network models and permutation-uniform Markov chains

We offer a general approach to modeling longitudinal network data, inclu...

0 William K. Schwartz, et al. ∙

research

∙ 03/29/2018

Computationally efficient likelihood inference in exponential families when the maximum likelihood estimator does not exist

In a regular full exponential family, the maximum likelihood estimator (...

0 Daniel J. Eck, et al. ∙