Advertisement

Web Marshals Fighting Curly Link Farms

  • Fabrizio Luccio
  • Linda Pagli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

Abstract

Graphides cincinnatae (also known as circulant graphs) Ci n (L) of n vertices are studied here as link farms in the Web, built automatically by a spammer to promote visibility of a page T. These graphs are k-consecutive, denoted by Cin,k, if each vertex v i is connected to vi + j and vi − j with j = 1,2,...,k. Graphides cirratae are cincinnatae with some irregularities. We discuss how to fight this phenomenon with a set of Web marshals, that is autonomous agents that visit the farm for cutting the links to T. The farm reacts reconstructing the links through majority voting among its pages. We prove upper and lower bounds on the number of marshals, and of link hops, needed to dismantle the farm. We consider both synchronous and asynchronous operations.

Regular Keywords: Circulant graph, Web graph, Page-rank, Web spam, Link farm, Autonomous agent, Majority rule.

Elegant Keywords: Graphis cincinnata, Graphis cirrata, Curly graph, Web marshal.

Keywords

Mobile Agent Majority Rule Autonomous Agent Great Element Vertex Degree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Becchetti, L., et al.: Link-Based Characterization and Detection of Web Spam. In: Proc. AIRWeb’06, Seattle (2006)Google Scholar
  2. 2.
    Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Redwood City,CA (1990)zbMATHGoogle Scholar
  3. 3.
    Du, Y., Shi, Y., Zhao, X.: Using Spam Farm to Boost Page Rank, Manuscript under publication (2006)Google Scholar
  4. 4.
    Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous Search in the Hypercube for Capturing an Intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symp. Denver, pp. 62–71. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  5. 5.
    Gori, M., Witten, I.: The Bubble of Web Visibility. Communications of the ACM 48(3), 115–117 (2005)CrossRefGoogle Scholar
  6. 6.
    Gyöngyi, Z., Garcia-Molina, H.: Web Spam Taxonomy. In: Proc. AIRWeb’05, Chiba (2005)Google Scholar
  7. 7.
    Gyöngyi, Z., Garcia-Molina, H.: Link Spam Alliances. In: Proc. VLDB’05, Trondheim, pp. 517–528 (2005)Google Scholar
  8. 8.
    Luccio, F., Pagli, L., Santoro, N.: Network Decontamination with Local Immunization. In: Proc. APDCM’06, Rhodes (2006)Google Scholar
  9. 9.
    Peleg, D.: Size Bounds for Dynamic Monopolies. In: Proc. SIROCCO 97, Ascona, pp. 151–161 (1997)Google Scholar
  10. 10.
    West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2000)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Fabrizio Luccio
    • 1
  • Linda Pagli
    • 1
  1. 1.Dipartimento di Informatica, Università di PisaItaly

Personalised recommendations