Csegő Balázs Kolok, Gergely Ódor, Dániel Keliger, Márton Karsai
Published in Phys. Rev. Research, 2025
One sentence abstract:We study stationary epidemic processes in scale-free networks with local awareness behavior adopted by only infected or all nodes, and paradoxically, we find and prove that the former scenario results in a smaller infection while more nodes can be aware in the latter.
Elsa Andres, Gergely Ódor, Iacopo Iacopini, Márton Karsai
Published in npj Complexity, 2025
One sentence abstract:We propose a novel perspective on distinguishing simple and complex contagion processes at the egocentric level.
Dániel Keliger, László Lovász, Tamás Móri and Gergely Ódor
Published in Journal of Graph Theory, 2024
One sentence abstract:We rigorously prove the existence of the switchover phenomenon claim under mild, deterministic assumptions on the underlying graph.
Gergely Ódor, Márton Karsai
Published in arxiv, 2024
One sentence abstract:We observe a drop in awareness behavior during the COVID-19 Omicron wave in survey and clinical genetic sequence datasets analysed by a new methodological framework.
Gergely Ódor, Jana Vuckovic, Miguel-Angel Sanchez Ndoye, Patrick Thiran
Published in Applied Network Science, 2023
One sentence abstract:We define and prove rigorous results about a new source identification framework, where the network is initially not known to the algorithm, but must be explored through queries (similarly to the node infection times), and we evaluate our algorithms on realistic datasets.
Satvik Mashkaria, Gergely Ódor, Patrick Thiran
Published in Discrete Applied Mathematics, 2022
One sentence abstract:We prove that if we add an extra edge to a (large enough) d-dimensional grid graph, then the resulting graph will have metric dimension between d and 2d, and we almost completely settle the case for d=2.
Victor Lecomte, Gergely Ódor, and Patrick Thiran
Published in Theoretical Computer Science, 2022
One sentence abstract:We provide the first theoretical results on the query complexity of the source identification problem when queried nodes report their infection time; in the adaptive case we need only Θ(loglog(n)) queries, while in the non-adaptive case Θ(n) queries are needed.
Gergely Ódor and Patrick Thiran
Published in Journal of Applied Probability, 2021
One sentence abstract:We prove that the sequential version of the metric dimension (where the landmarks can be chosen adaptively to distinguish every pair of nodes based on distances) is only a multiplicative constant factor smaller than the (non-adaptive) metric dimension in Erdos-Renyi graphs
Gergely Ódor, Domonkos Czifra, Júlia Komjáthy, László Lovász, Márton Karsai
Published in Proceedings of the National Academy of Sciences, 2021
One sentence abstract:We observe empirically and prove theoretically a new phenomenon related to how the initial seeding affects the outcome of an epidemic.
Júlia Komjáthy, Gergely Ódor
Published in European Journal of Combinatorics, 2021
One sentence abstract:Building on the literature of fringe trees, we prove law of large numbers type results for the metric dimension of various random trees.