Publikációk és kéziratok - Publications and preprints
Ágnes Backhausz, Villő Csiszár, Balázs Csegő Kolok, Damján Tárkányi, András Zempléni, A new adaptive two-layer model for opinion spread in hypergraphs: parameter sensitivity and estimation. [arXiv:2512.23355]
Ágnes Backhausz, Christian Kuehn, Sjoerd van der Niet, Giulio Zucal, Spectral theory of dense hypergraph limits. Manuscript. [arXiv:2511.03516]
Ágnes Backhausz, Edit Bognár, Villő Csiszár, Damján Tárkányi, András Zempléni, Comparison of classical, xgboost and neural network methods for parameter estimation in epidemic processes on random graphs. Franklin Open. 100271 (2025). [available online]
Lajos Kelemen, István András Seres, Ágnes Backhausz, The Spatiotemporal Scaling Laws of Bitcoin Transactions. Presented at IEEE International Conference on Blockchain and Cryptocurrency. [arXiv:2309.11884]
Ágnes Backhausz, György J. Székely, Epidemic spread, parameter sensitivity and vaccination strategies on a random graph with overlapping communities. Manuscript. [arXiv:2308.12655]
Ágnes Backhausz, Edit Bognár, Villő Csiszár, Damján Tárkányi, András Zempléni, Estimating the parameters of epidemic spread on multilayer random graphs: a classical and a neural network approach. Journal of Statistical Theory and Practice. 18 (4) 50 (2024). [available online]
Ágnes Backhausz, Tamás F. Móri, A random graph of moderate density. Electronic Communications in Probability. 27 1-12 (2022).[available online]
Ágnes Backhausz, István Z. Kiss, Péter L. Simon, The impact of spatial and social structure on an SIR epidemic on a weighted multilayer network. Periodica Mathematica Hungarica. 85 343-363 (2022). [available online]
Ágnes Backhausz, Charles Bordenave, Balázs Szegedy, Typicality and entropy of processes on infinite trees. Ann. Inst. Henri Poincaré Probab. Stat. 58 (4) 1959-1980 (2022). [arXiv:2102.02653]
Ágnes Backhausz, Edit Bognár, Epidemic spread on random graphs with multiple type nodes, Annales Univ. Sci. Budapest., Sect. Math. 63 67-99 (2020)
Ágnes Backhausz, Bence Rozner, Barabási-Albert random graph with multiple type edges with perturbation. Acta Mathematica Hungarica. 161 (1), 212-229 (2020). [arXiv:1905.11329]
Ágnes Backhausz, Balázs Szegedy, Action convergence of operators and graphs. Canadian Journal of Mathematics. 74 (1), 72-121 (2022). [available online].
Ágnes Backhausz, Bence Rozner, Asymptotic degree distribution in preferential attachment graph models with multiple type edges. Stochastic Models. 35 (4), 496-522 (2019). [available online]
Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Entropy inequalities for factors of IID. Groups, Geometry, and Dynamics. 13 (2), 389-414 (2019) [journal page]. [arXiv:1706.04937]
Ágnes Backhausz, Dávid Kunszenti-Kovács, On the dense Preferential Attachment Graph models and their graphon induced counterpart. Journal of Applied Probability. 56 (2), 590-601 (2019). [journal page] [arXiv:1701.06760]
Ágnes Backhausz, Balázs Szegedy, On the almost eigenvectors of random regular graphs. The Annals of Probability. 47 (3) 1677-1725 (2019). [link to journal page] [pdf]
Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer. Correlation bound for distant parts of factor of IID processes. Combinatorics, Probability and Computing. 27 (1) 1-20. (2018) [pdf]
Ágnes Backhausz, Bálint Virág. Spectral measures of factor of i.i.d. processes on vertex-transitive graphs. Annales de l'Institute Henri Poincaré - Probabilités et Statistiques. 53 (4), 2260-2278, 2017. [pdf]
Ágnes Backhausz, Tamás F. Móri. Further properties of a random graph with duplications and deletions. Stochastic Models. 32 (1), 99-120, 2016. [arXiv:1409.5279]
Ágnes Backhausz, Balázs Szegedy. On large girth regular graphs and random processes on trees. Random Structures and Algorithms. 53 (3), 389-416. [pdf]
Ágnes Backhausz, Tamás F. Móri.
Asymptotic properties of a random graph with duplications.
Journal of Applied Probability. 52 (2), 375-390, 2015. [arXiv:1308.1506]
Ágnes Backhausz, Balázs Szegedy, Bálint Virág.
Ramanujan graphings and correlation decay in local algorithms.
Random Structures Algorithms. 47 (3), pp. 424-435, 2015. DOI: 10.1002/rsa.20562. [arXiv:1305.6784]
Ágnes Backhausz, Tamás F. Móri. Asymptotics of a renewal-like recursion and an integral equation.
Applicable Analysis and Discrete Mathematics, 8 pp. 200-223, 2014. [arXiv:1104.1027]
Ágnes Backhausz, Tamás F. Móri. Weights and
degrees in a random graph model based on 3-interactions.
Acta Mathematica Hungarica, 143 (1), pp. 23-43, 2014. [arXiv:1206.0633]
Ágnes Backhausz, Tamás F. Móri. A random model of publication activity.
Discrete Applied Mathematics, 162, pp. 78-89, 2014. [arXiv:1104.1026]
Ágnes Backhausz, Tamás F. Móri,
Degree distribution in the lower levels of the uniform recursive tree.
Annales Univ. Sci.
Budapest.,
Sect. Comp., 36, pp. 53-62, 2012. [pdf]
Ágnes Backhausz, Tamás F. Móri,
A random graph model based on 3-interactions.
Annales Univ. Sci.
Budapest., Sect. Comp., 36, pp. 41-52, 2012. [pdf]
Ágnes Backhausz, Tamás F. Móri,
Local degree distribution in scale free random graphs.
Electronic Journal of Probability, 16 (54), pp. 1465-1488, 2011. [pdf]
Ágnes Backhausz, Limit distribution of degrees in random family trees.
Electronic Communications in Probability, 16, pp. 27-37, 2011. [article]
Ágnes Backhausz, Local degree distributions: examples and counterexamples.
Periodica Mathematica Hungarica, 63 (2), pp. 153-171, 2011.
Ágnes M. Backhausz, Vilmos Komornik, Tivadar Szilágyi,
A simplified multidimensional integral.
Czechoslovak Mathematical Journal, 59 (3), pp. 721-739, 2009. [article]
Doktori értekezés: Véletlen gráfok vizsgálata martingálelméleti módszerekkel - PhD thesis: Analysis of random graphs with
methods of martingale theory (2012) [pdf, in Hungarian]
[summary, in English]
Diplomamunka - Master thesis (2008) [pdf, in Hungarian]