2 papers
cs.SI2026
Bringing order to network centrality measures
G. Exarchakos, R. van der Hofstad, O. Nagy +1
We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually s…
math.PR2024
Are giants in random digraphs `almost' local?
Remco van der Hofstad, Manish Pandey
Recently, the first author showed that the giant in random undirected graphs is `almost' local. This means that, under a necessary and sufficient condition, the limiting proportion…