40 citations · 80 across the 10 of their papers we have counts for
10 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…
Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs
Júlia Komjáthy, John Lapinskas, Johannes Lengler
We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. rando…
Distance evolutions in growing preferential attachment graphs
Joost Jorritsma, Júlia Komjáthy
We study the evolution of the graph distance and weighted distance between two fixed vertices in dynamically growing random graph models. More precisely, we consider preferential a…
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 ,…
Phase transition in random intersection graphs with communities
Remco van der Hofstad, Júlia Komjáthy, Viktória Vadon
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own inte…
Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs
Júlia Komjáthy, Bas Lodewijks
In this paper we study weighted distances in scale-free spatial network models: hyperbolic random graphs (HRG), geometric inhomogeneous random graphs (GIRG) and scale-free percolat…
Degrees and distances in random and evolving Apollonian networks
István Kolossváry, Júlia Komjáthy, Lajos Vágó
This paper studies Random and Evolving Apollonian networks (RANs and EANs), in d dimension for any d>=2, i.e. dynamically evolving random d dimensional simplices looked as graphs i…
Degree distribution of shortest path trees and bias of network sampling algorithms
Shankar Bhamidi, Jesse Goodman, Remco van der Hofstad +1
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determi…
First Passage Percolation on Inhomogeneous Random Graphs
István Kolossváry, Júlia Komjáthy
We investigate first passage percolation on inhomogeneous random graphs. The random graph model G(n,kappa) we study is the model introduced by Bollobás, Janson and Riordan, where e…
Uniform mixing time for Random Walk on Lamplighter Graphs
Júlia Komjáthy, Jason Miller, Yuval Peres
Suppose that $\CG$ is a finite, connected graph and is a lazy random walk on $\CG$. The lamplighter chain associated with is the random walk on the wreath prod…