Fan Chung-Graham (UC San Diego)
Random walks on Web graphs
We will discuss several types of random walk problems in connection with
ranking and searching in the Web graph.
Needless to say, these random walks are quite useful for dealing with
numerous problems arising in general networks, such as biological,
and communication networks.
Fan Chung-Graham is Professor of Mathematics and Professor of Computer Science and Enginering at the University of California, San Diego. She is also the Paul Erdos Professor in Combinatorics.
She grew up in Taiwan and earned her Ph.D. in Mathematics from the University of Pennsylvania in 1974. She then worked for 20 years at Bell Labs and Bellcore in the area of combinatorics. In 1994 she returned to the University of Pennsylvania as the Class of 1965 Professor of Mathematics, then joined the faculty of the University of California at San Diego in 1998.
Her research interests are primarily in graph theory, combinatorics, and algorithmic analysis. She specializes in spectral graph theory, extremal graph theory and quasi-randomness. Recently her work includes probabilistic analysis of complex networks and random walks with applications to ranking algorithms.
She was awarded the Allendoerfer Award by the Mathematical Association of America in 1990. She is a Fellow of the American Mathematical Society and a Fellow of the American Academy of Arts and Sciences.