1 citations · 1 across the 6 of their papers we have counts for
7 papers
Graphons, Geometry, and Dynamics: Forward and Inverse Perspectives
Ágnes Backhausz, Christian Kuehn, Sjoerd van der Niet
In this work, we explore the interplay between graph limit theory, the geometry of underlying probability spaces, spectral theory, and network dynamical systems. We investigate two…
The Spatiotemporal Scaling Laws of Bitcoin Transactions
Lajos Kelemen, István András Seres, Ágnes Backhausz
This study, to the best of our knowledge for the first time, delves into the spatiotemporal dynamics of Bitcoin transactions, shedding light on the scaling laws governing its geogr…
Epidemic spread, parameter sensitivity and vaccination strategies on a random graph with overlapping communities
Ágnes Backhausz, György J. Székely
Our main goal is to examine the role of communities in epidemic spread in a random graph model. More precisely, we consider a random graph model which consists of overlapping compl…
Estimating the parameters of epidemic spread on two-layer random graphs: a classical and a neural network approach
Ágnes Backhausz, Edit Bognár, Villő Csiszár +2
In this paper, we study the spread of a classical SIR process on a two-layer random network, where the first layer represents the households, while the second layer models the cont…
Virus spread and voter model on random graphs with multiple type nodes
Ágnes Backhausz, Edit Bognár
When modelling epidemics or spread of information on online social networks, it is crucial to include not just the density of the connections through which infections can be transm…
Barabási-Albert random graph with multiple type edges with perturbation
Ágnes Backhausz, Bence Rozner
In this paper we introduce the perturbed version of the Barabási-Albert random graph with multiple type edges and prove the existence of the (generalized) asymptotic degree distrib…
Entropy inequalities for factors of IID
Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi
This paper is concerned with certain invariant random processes (called factors of IID) on infinite trees. Given such a process, one can assign entropies to different finite subgra…