collaborators

2 papers

math.PR2026

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.CO2025

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph : The Lower Tail

José Alvarado, Gabriel Dias, Simon Griffiths

Let be the number of triangles in a graph . In [14] and [25] (respectively) the following bounds were proved on the lower tail behaviour of triangle counts in…