Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 2.10.2018 |
| Speaker: | Matas Šileikis, Ústav Informatiky AVČR |
| Title: | Subgraph counts in random graphs |
| Abstract: | In this talk I will consider one of the most studied quantities of random graph theory, the number $X_H$ of copies of a given graph $H$ in a random graph. I will survey the known results on the distribution of $X_H$ in the Erdos-Renyi random graph $G(n,p)$: limit distributions as $n$ grows and bounds for probability that $X_H$ deviates significantly from its expected value. Time permitting I will mention some results on $X_H$ in inhomogeneous random graphs, a model that vastly generalizes $G(n,p)$. Results presented include joint work with L.~Warnke (Georgia Tech) as well as J.~Hladký and C.~Pelekis (MÚ AV ČR). |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož