31 citations · 53 across the 12 of their papers we have counts for
19 papers
Spectral theory of dense hypergraph limits
Ágnes Backhausz, Christian Kuehn, Sjoerd van der Niet +1
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in…
Typicality and entropy of processes on infinite trees
Ágnes Backhausz, Charles Bordenave, Balázs Szegedy
Consider a uniformly sampled random -regular graph on vertices. If is fixed and goes to then we can relate typical (large probability) properties of such ra…
Action convergence of operators and graphs
Agnes Backhausz, Balazs Szegedy
We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general limits)…
Asymptotic degree distribution in preferential attachment graph models with multiple type edges
Ágnes Backhausz, Bence Rozner
We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the -…
On the dense Preferential Attachment Graph models and their graphon induced counterpart
Ágnes Backhausz, Dávid Kunszenti-Kovács
Letting denote the space of finite measures on , and denote the Poisson distribution with parameter , the function $W:[0,1]^2\to\ma…
On the almost eigenvectors of random regular graphs
Agnes Backhausz, Balazs Szegedy
Let be fixed and be a large random -regular graph on vertices. We show that if is large enough then the entry distribution of every almost eigenvector …