Barabasi's research may soon allow us to not just understand and predict network behavior, but also to control it.In the beginning, though, Barabási, like Euler, was mostly interested in mapping complex systems. He was particularly interested in the -Erdös-Rényi model, which held that complex networks were random, and if they grew large enough each node would have roughly the same number of links as any other node over time. In 1998, Barabási and his students at Notre Dame saw an opportunity to study the implications of that theory on a really big data set: 325,000 pages from Notre Dame's Web domain. When they ran the numbers, nearly all the pages did in fact have about the same number of links. But a few dozen were different. They had upward of 1,000 incoming links. At the time, Google's PageRank was already exploiting this quality to produce more-relevant search results, but to network theorists the notion was radical and had implications far beyond the Web. Barabasi later wrote that "we caught a glimpse of a new and unsuspected order within networks, one that displayed an uncommon beauty and coherence."