IDEAS home Printed from https://ideas.repec.org/a/bjf/ijltem/v15y2026i6a16.html

Link-Spam-Resistant Domain Ranking: A Comparative Evaluation of PageRank, HITS, and TrustRank Under Simulated Link-Farm Attacks Using Common Crawl Web Graphs

Author

Listed:
  • Romelyn J. Banaybanay

    (Initao College, Initao, Misamis Oriental, Philippines)

  • Reagan B. Ricafort

    (AMA University, Makati City, Philippines)

Abstract

Link-based ranking is still an important part of web information retrieval, but it remains vulnerable to coordinated link-farm attacks. This study examined the resistance of PageRank, HITS, and TrustRank to link spam using simulated attacks on domain-level web graphs extracted from Common Crawl. A quantitative, comparative, and controlled experimental design was used. Five independent base graphs were prepared, with each graph containing 100,000 legitimate domain nodes. Four link-farm structures were tested: star-centered, bounded-density clique, bipartite, and mixed. The attacks were applied at four intensity levels: 1%, 3%, 5%, and 10% of the legitimate graph size. Across all conditions, the experiment produced 480 attacked graph instances and 1,440 verified algorithm-level runs. The algorithms were compared using spam target promotion, spam score share, top-1000 spam infiltration, legitimate-domain displacement, ranking stability, execution time, peak memory use, and iteration count. The results showed that PageRank was the most vulnerable algorithm. It had the highest spam target promotion, highest spam score share, measurable top-1000 spam infiltration, greater legitimate-domain displacement, and lowest ranking stability. HITS showed the strongest overall resistance and computational efficiency. It recorded near-zero spam score share, zero top-1000 infiltration, zero legitimate-domain displacement, highest stability, fastest runtime, and fewest iterations. TrustRank also blocked top-1000 infiltration and legitimate-domain displacement, although it allowed higher target promotion than HITS. The bounded-density clique structure caused the most damage to PageRank, while higher attack intensity increased spam impact in most cases. The findings show that link-spam resistance depends on the ranking algorithm, attack structure, attack intensity, and evaluation metric used. A single ranking score or attack model is not enough to evaluate resistance to link-farm manipulation.

Suggested Citation

  • Romelyn J. Banaybanay & Reagan B. Ricafort, 2026. "Link-Spam-Resistant Domain Ranking: A Comparative Evaluation of PageRank, HITS, and TrustRank Under Simulated Link-Farm Attacks Using Common Crawl Web Graphs," International Journal of Latest Technology in Engineering, Management & Applied Science, RSIS International, vol. 15(6), pages 174-185, July.
  • Handle: RePEc:bjf:ijltem:v:15:y:2026:i:6:a:16
    DOI: 10.51583/IJLTEMAS.2026.150600016
    as

    Download full text from publisher

    File URL: https://www.ijltemas.in/submission/online/article/view/5114/6961
    Download Restriction: no

    File URL: https://www.ijltemas.in/submission/online/article/view/5114
    Download Restriction: no

    File URL: https://libkey.io/10.51583/IJLTEMAS.2026.150600016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bjf:ijltem:v:15:y:2026:i:6:a:16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dr. Pawan Verma (email available below). General contact details of provider: https://www.ijltemas.in/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.