20 citations · 61 across the 13 of their papers we have counts for
16 papers
Switchover phenomenon induced by epidemic seeding on geometric networks
Gergely Ódor, Domonkos Czifra, Júlia Komjáthy +2
It is a fundamental question in disease modelling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. Research in this topic has primari…
Random homomorphisms into the orthogonality graph
Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequen…
Locally common graphs
Endre Csóka, Tamás Hubai, László Lovász
Goodman proved that the sum of the number of triangles in a graph on nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a…
Compact graphings
László Lovász
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a proced…
Finitely forcible graphons with an almost arbitrary structure
Daniel Kral, László Miklós Lovász, Jonathan A. Noel +1
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities,…
Identifiability for graphexes and the weak kernel metric
Christian Borgs, Jennifer T. Chayes, Henry Cohn +1
In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over -finite measur…