Indiana University

Skip to:

  1. Search
  2. Breadcrumb Navigation
  3. Content
  4. Browse by Topic
  5. Services & Resources
  6. Additional Resources
  7. Multimedia News

Media Contacts

Joe Stuteville
jstutevi@indiana.edu
812-856-3141

Last modified: Wednesday, August 9, 2006

IU informatics researchers throttle notion of search engine dominance

EMBARGOED UNTIL
5 P.M. EST
August 7, 2006

BLOOMINGTON, Ind. -- Search engines are not biased towards well-known Web sites. In fact, they actually produce an egalitarian effect as to where traffic is directed, say researchers at the Indiana University School of Informatics.

Their study, "Topical interests and the mitigation of search engine bias," appears in the Aug. 7-11 issue of the Proceedings of the National Academy of Sciences and challenges the "Googlearchy" theory -- the perception that search engines push Web traffic toward popular sites, thus creating a monopoly over lesser-known sites.

As the Web becomes larger and more complex, search engines have taken on an increased role in guiding Internet users to their destinations. Yet, some are concerned that search engines, by means of their ranking algorithms, create a vicious cycle where popular sites receive more and more hits.

Filippo Menczer image

Filippo Menczer

"Empirical data do not support the idea of a vicious cycle amplifying the rich-get-richer dynamic of the Web," said Filippo Mencer, associate professor of informatics and computer science. "Our study demonstrates that popular sites receive on average far less traffic than predicted by the Googlearchy theory and that the playing field is more even."

Menczer was joined in the study by IU post-doctoral fellow Santo Fortunato; Alessandro Flammini, assistant professor of informatics; and Alessandro Vespignani, professor of informatics.

A search engine is a complex system designed to find information stored on the Web, allowing users to look for content meeting specific criteria, typically a word or phrase. The engine then retrieves a set of references closely matching the criteria, returning a list of "hits" ranked by page relevance.

The IU team pooled its expertise in Web mining, networks and complex systems to collect empirical data from various search engines. In one scenario, users browsed the Web using only random links. In another, users visited only pages returned by the search engines.

The researchers also have studied the critical role of search engines in shaping the evolution of the Web.

"A simple ranking mechanism provides an elegant model to understand the genesis of a broad class of complex systems, including social and technological networks such as the Internet and the World Wide Web," Fortunato said. "These networks possess a peculiar 'long-tail' structure in which a few nodes attract a great majority of connections."

The long tail structure of the Web is commonly explained through rich-get-richer models that require knowledge of the prestige of each node in the network. However, those who create and link Web pages may not know the prestige values of target pages.

In another study, "Scale-free network growth by ranking," published in May by the journal Physical Review Letters, the IU researchers showed that all that is necessary to give rise to a long tail network is to have the nodes sorted according to any prestige measure, even if the exact values are unknown. If new nodes are linked to old ones according to their ranking order, a long tail emerges.

The IU researchers' model finds a striking application in understanding the evolution and social impact of search engines.

"By sorting results, search engines give us a simple mechanism to interpret how the Web grows and how traffic is distributed among Web sites," said Menczer.

The ranking model can help understand the dynamics of other complex networks besides the Web. For example, in a social system, one may be able to tell which of two people is richer without knowing their bank account balance. Such a criterion might explain the frequency and robustness of the complex structure observed in many real networks.

To arrange an interview with Filippo Menczer, please contact Joe Stuteville at (317) 946-9930, or at jstutevi@indiana.edu.