For more information about this meeting, contact Jason Morton.

Title: | Toric ideals from hypergraphs: algebra for network models |

Seminar: | Applied Algebra and Network Theory Seminar |

Speaker: | Sonja Petrovic, Penn State |

Abstract: |

This talk is about models parametrized by edges of a hypergraph. Such models are toric by definition, and the goal is to obtain a Markov basis for the model. Equivalently, we are interested in the defining ideal of the edge subring of a hypergraph.
The ideal of the edge subring of a \emph{graph} gives a Markov bases for the p1 model for random graphs (networks). The algebraic and combinatorial constructions used for these toric ideals give insight into the geometry of the model, existence of maximum likelihood estimators, and a better way to generate Markov moves. The ideal theory of graphs has a rich history, including some results that are well-known in algebraic statistics.
A more complicated family of algebraic models motivates the generalization of this construction to hypergraphs. The talk will outline the motivation and the main results. |

### Room Reservation Information

Room Number: | MB106 |

Date: | 01 / 18 / 2012 |

Time: | 02:30pm - 03:20pm |