Limit distribution of degrees in random family trees - Ágnes Backhausz (CoRR, 2010)

Local degree distributions: Examples and counterexamples. - Ágnes Backhausz (Period. Math. Hung., 2011)

A random model of publication activity. - Ágnes Backhausz; Tamás F. Móri (Discret. Appl. Math., 2014)

Asymptotic Properties of a Random Graph with Duplications. - Ágnes Backhausz; Tamás F. Móri (J. Appl. Probab., 2015)

Ramanujan graphings and correlation decay in local algorithms. - Ágnes Backhausz; Balázs Szegedy; Bálint Virág (Random Struct. Algorithms, 2015)

Correlation Bounds for Distant Parts of Factor of IID Processes. - Ágnes Backhausz; Balázs Gerencsér; Viktor Harangi; Máté Vizer (Comb. Probab. Comput., 2018)

On large-girth regular graphs and random processes on trees. - Ágnes Backhausz; Balázs Szegedy (Random Struct. Algorithms, 2018)

On the dense preferential attachment graph models and their graphon induced counterpart. - Ágnes Backhausz; Dávid Kunszenti-Kovács (J. Appl. Probab., 2019)

The impact of spatial and social structure on an SIR epidemic on a weighted multilayer network. - Ágnes Backhausz; István Z. Kiss; Péter L. Simon (Period. Math. Hung., 2022)

The Spatiotemporal Scaling Laws of Bitcoin Transactions. - Lajos Kelemen; István András Seres; Ágnes Backhausz (ICBC, 2024)

Parameter estimation of epidemic spread in two-layer random graphs by classical and machine learning methods. - Ágnes Backhausz; Edit Bognár; Villo Csiszár; Damján Tárkányi; András Zempléni (CoRR, 2024)