LCN2 Seminar: Sparse random graphs with many triangles.
- Suman Chakraborty (TU/e + UL)
- Friday 28 January 2022
- Room 176
You can also attend via ZoomZoom link
50th LCN2 seminar
Speaker: Suman Chakraborty (TU/e + UL)
Title: Sparse random graphs with many triangles.
It is well known that sparse random graphs (where the number of edges is of the order of the number of vertices) contain only a small number of triangles. On the other hand, many networks observed in real life are sparse but contain a large number of triangles. Motivated by this discrepancy we ask the following two questions: How (un)likely is it that a sparse random graph contains a large number of triangles? What does the graph look like when it contains a large number of triangles? We also ask a related question: What is the probability that in a sparse random graph a large number of vertices are part of some triangle? We discuss these questions, as well as some applications to exponential random graph models.