This course is available to PhD students only. All others must obtain written . ermission (email) from the instructor and forward to Sharon Burks (sharon@cs.cm. .edu) to enroll.
Information networks such as the World Wide Web are characterized by the interplay between heterogeneous content and a complex underlying link structure. This course covers recent research on algorithms for analyzing such networks, and models that abstract their basic properties. Topics include combinatorial and probabilistic techniques for link analysis, centralized and decentralized search algorithms, network models based on random graphs, and connections with work in the social sciences.