3 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
On the upper tail of star counts in random graphs
Margarita Akhmejanova, Matas Å ileikis
Let count the number of -stars in the random binomial graph . We determine, for fixed and , the asymptotics of $\log \mathbb{P}(X \ge (…
math.CO2024
From flip processes to dynamical systems on graphons
Frederik Garbe, Jan Hladký, Matas Šileikis +1
We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathca…