activity
20102026
most citedGriffiths phases and localization in hierarchical modular networks

47 citations · 123 across the 16 of their papers we have counts for

collaborators

17 papers

physics.soc-ph2026

Non-Pharmaceutical Interventions Reshape Network Immunization Outcomes

Sámuel G. Balogh, Gergely Ódor, Márton Karsai

Herd immunity is shaped not only by the infection capacity of a spreading epidemic or the contact structure of the hosting population, but also by how and under what circumstances…

quant-ph2025

Preferential Attachment with Local Flexibility

Tingyu Zhao, Balázs Maga, Pierfrancesco Dionigi +6

From the formation of social ties to the budding quantum internet, growing networks often exhibit local flexibility upon new nodes attaching to an existing network. In our proposed…

physics.soc-ph2024

Epidemic paradox induced by awareness driven network dynamics

Csegő Balázs Kolok, Gergely Ódor, Dániel Keliger +1

We study stationary epidemic processes in scale-free networks with local awareness behavior adopted by only susceptible, only infected, or all nodes. We find that while the epidemi…

cs.CY2024★ 1 cited

Distinguishing mechanisms of social contagion from local network view

Elsa Andres, Gergely Ódor, Iacopo Iacopini +1

The adoption of individual behavioural patterns is largely determined by stimuli arriving from peers via social interactions or from external sources. Based on these influences, in…

physics.soc-ph2024

Epidemic-induced local awareness behavior inferred from surveys and genetic sequence data

Gergely Ódor, Márton Karsai

Behavior-disease models suggest that pandemics can be contained cost-effectively if individuals take preventive actions when disease prevalence rises among their close contacts. Ho…

math.CO2023

Switchover phenomenon for general graphs

Dániel Keliger, László Lovász, Tamás Móri +1

We study SIR type epidemics on graphs in two scenarios: (i) when the initial infections start from a well connected central region, (ii) when initial infections are distributed uni…

cs.SI2021★ 1 cited

Source Detection via Contact Tracing in the Presence of Asymptomatic Patients

Gergely Ódor, Jana Vuckovic, Miguel-Angel Sanchez Ndoye +1

Inferring the source of a diffusion in a large network of agents is a difficult but feasible task, if a few agents act as sensors revealing the time at which they got hit by the di…

physics.soc-ph2021★ 11 cited

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…

math.CO2020

On the robustness of the metric dimension of grid graphs to adding a single edge

Satvik Mashkaria, Gergely Ódor, Patrick Thiran

The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph…

math.PR2020★ 2 cited

The metric dimension of critical Galton-Watson trees and linear preferential attachment trees

Júlia Komjáthy, Gergely Ódor

The metric dimension of a graph is the minimal size of a subset of vertices of that, upon reporting their graph distance from a distingished (source) vertex ,…

cs.DS2020

The power of adaptivity in source identification with time queries on the path

Victor Lecomte, Gergely Ódor, Patrick Thiran

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph…

math.CO2019★ 8 cited

Sequential metric dimension for random graphs

Gergely Ódor, Patrick Thiran

In the localization game on a graph, the goal is to find a fixed but unknown target node with the least number of distance queries possible. In the step of the g…

q-bio.QM2016★ 40 cited

A Multi-Pass Approach to Large-Scale Connectomics

Yaron Meirovitch, Alexander Matveev, Hayk Saribekyan +8

The field of connectomics faces unprecedented "big data" challenges. To reconstruct neuronal connectivity, automated pixel-level segmentation is required for petabytes of streaming…

cs.CV2016

Hierarchical Manifold Clustering on Diffusion Maps for Connectomics (MIT 18.S096 final project)

Gergely Odor

In this paper, we introduce a novel algorithm for segmentation of imperfect boundary probability maps (BPM) in connectomics. Our algorithm can be a considered as an extension of sp…

math.OC2016

Frank-Wolfe Works for Non-Lipschitz Continuous Gradient Objectives: Scalable Poisson Phase Retrieval

Gergely Odor, Yen-Huan Li, Alp Yurtsever +4

We study a phase retrieval problem in the Poisson noise model. Motivated by the PhaseLift approach, we approximate the maximum-likelihood estimator by solving a convex program with…

cond-mat.dis-nn2015★ 47 cited

Griffiths phases and localization in hierarchical modular networks

Géza Ódor, Ronald Dickman, Gergely Ódor

We study variants of hierarchical modular network models suggested by Kaiser and Hilgetag [Frontiers in Neuroinformatics, 4 (2010) 8] to model functional brain connectivity, using…

physics.comp-ph2010★ 13 cited

Simulation of 1+1 dimensional surface growth and lattices gases using GPUs

Henrik Schulz, Géza Ódor, Gergely Ódor +1

Restricted solid on solid surface growth models can be mapped onto binary lattice gases. We show that efficient simulation algorithms can be realized on GPUs either by CUDA or by O…