Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit.

Letizia, E., Barucca, P., Lillo, F. (2018). Resolution of ranking hierarchies in directed networks. PLOS ONE, 13(2), e0191604-e0191604-25 [10.1371/journal.pone.0191604].

Resolution of ranking hierarchies in directed networks

Lillo, Fabrizio
2018

Abstract

Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit.
2018
Letizia, E., Barucca, P., Lillo, F. (2018). Resolution of ranking hierarchies in directed networks. PLOS ONE, 13(2), e0191604-e0191604-25 [10.1371/journal.pone.0191604].
Letizia, Elisa*; Barucca, Paolo; Lillo, Fabrizio
File in questo prodotto:
File Dimensione Formato  
journal.pone.0191604.pdf

accesso aperto

Tipo: Versione (PDF) editoriale
Licenza: Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione 3.12 MB
Formato Adobe PDF
3.12 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/622729
Citazioni
  • ???jsp.display-item.citation.pmc??? 4
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 12
social impact