Showing 2023Show all
2 papers · 1 filter
math.PR2023
Extreme local statistics in random graphs: maximum tree extension counts
Pedro Araújo, Simon Griffiths, Matas Šileikis +1
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at ver…
math.CO2023
Local central limit theorem for triangle counts in sparse random graphs
Pedro Araújo, Letícia Mattos
Let be the number of copies of a fixed graph in . In 2016, Gilmer and Kopparty conjectured that a local central limit theorem should hold for as long as …