The best attachment consists in finding a good strategy that allows a node inside a network to achieve a high rank. This is an open issue due to its intrinsic computational complexity and to the giant dimension of the involved networks. The ranking of a node has an important impact both in economics and structural term e.g., a higher rank could leverage the number of contacts or the trusting of the node. This paper presents a heuristics aiming at finding a good solution whose complexity is Nlog N. The results show that better rank improvement comes by acquiring long distance in-links whilst human intuition would suggest to select neighbours. The paper discusses the algorithm and simulation on random and scale-free networks.

Climbing Ranking Position via Long-Distance Backlinks

Carchiolo, V.;Longheu, A.;Malgeri, M.;Mangioni, G.
2018

Abstract

The best attachment consists in finding a good strategy that allows a node inside a network to achieve a high rank. This is an open issue due to its intrinsic computational complexity and to the giant dimension of the involved networks. The ranking of a node has an important impact both in economics and structural term e.g., a higher rank could leverage the number of contacts or the trusting of the node. This paper presents a heuristics aiming at finding a good solution whose complexity is Nlog N. The results show that better rank improvement comes by acquiring long distance in-links whilst human intuition would suggest to select neighbours. The paper discusses the algorithm and simulation on random and scale-free networks.
9783030027377
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: http://hdl.handle.net/20.500.11769/361759
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact