2023 - Research.com Mathematics in United States Leader Award
2015 - SIAM Fellow For contributions to combinatorics, graph theory, and their applications.
2013 - Fellow of the American Mathematical Society
1998 - Fellow of the American Academy of Arts and Sciences
Her main research concerns Discrete mathematics, Combinatorics, Random graph, Random regular graph and Indifference graph. Her work on Pathwidth, Line graph, Vertex and Graph partition is typically connected to Power law as part of general Discrete mathematics study, connecting several disciplines of science. Many of her studies involve connections with topics such as Eigenvalues and eigenvectors and Combinatorics.
Her Eigenvalues and eigenvectors study combines topics from a wide range of disciplines, such as Integral graph and Directed graph. The Integral graph study combines topics in areas such as Sobolev inequality, Isoperimetric inequality and Graph energy. Her work on Giant component as part of general Random graph study is frequently connected to Exponent, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
Combinatorics, Discrete mathematics, Graph, Random graph and Random walk are her primary areas of study. Her study looks at the relationship between Combinatorics and fields such as Eigenvalues and eigenvectors, as well as how they intersect with chemical problems. The Discrete mathematics study which covers Almost surely that intersects with Degree.
Other disciplines of study, such as PageRank, Heat kernel, Stationary distribution and Laplacian matrix, are mixed together with her Random walk studies. Her research in PageRank intersects with topics in Conductance and Algorithm. Her work on Graph product expands to the thematically related Indifference graph.
Her primary areas of study are Combinatorics, Discrete mathematics, Random walk, Graph and PageRank. She is interested in Random graph, which is a branch of Combinatorics. Her Random graph research includes elements of Random regular graph, Graph enumeration, Convergence, Class and Limit.
As a member of one scientific family, Fan Chung mostly works in the field of Graph, focusing on Almost surely and, on occasion, Expander graph and Linear number. Her PageRank research incorporates elements of Algorithm, Mathematical optimization and Approximation algorithm. In her research on the topic of Eigenvalues and eigenvectors, Sigma is strongly related with Laplace operator.
Fan Chung spends much of her time researching Discrete mathematics, PageRank, Combinatorics, Random walk and Algorithm. Her study in the field of Induced subgraph and Bipartite graph is also linked to topics like Sample size determination and Importance sampling. Her studies in PageRank integrate themes in fields like Approximation algorithm, Edge and Cluster analysis.
Fan Chung works in the field of Combinatorics, focusing on Permutation in particular. In general Algorithm study, her work on Computation often relates to the realm of List scheduling, thereby connecting several areas of interest. Her Heat kernel research includes themes of Graph, Laplacian matrix and Bounded function.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Spectral Graph Theory
Fan R K Chung.
(1996)
Spectral grouping using the Nystrom method
C. Fowlkes;S. Belongie;F. Chung;J. Malik.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)
Optical orthogonal codes: design, analysis, and applications
F. R. K. Chung;J. A. Salehi;V. K. Wei.
international symposium on information theory (1989)
The average distances in random graphs with given expected degrees
Fan Chung;Linyuan Lu.
Proceedings of the National Academy of Sciences of the United States of America (2002)
A random graph model for massive graphs
William Aiello;Fan Chung;Linyuan Lu.
symposium on the theory of computing (2000)
Local Graph Partitioning using PageRank Vectors
R. Andersen;Fan Chung;K. Lang.
foundations of computer science (2006)
Connected Components in Random Graphs with Given Expected Degree Sequences
Fan Chung;Linyuan Lu.
Annals of Combinatorics (2002)
Complex Graphs and Networks
Fan Chung;Linyuan Lu.
(2006)
The Spectra of Random Graphs with Given Expected Degrees
Fan R. K. Chung;Linyuan Lu;Van H. Vu.
Internet Mathematics (2004)
Laplacians and the Cheeger Inequality for Directed Graphs
Fan Chung.
Annals of Combinatorics (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, San Diego
University of Massachusetts Amherst
Tsinghua University
Hungarian Academy of Sciences
University of British Columbia
Stanford University
Sharif University of Technology
Bielefeld University
Nokia (United States)
University of Cambridge
Heriot-Watt University
Zhejiang University
University of California, Berkeley
University of Stuttgart
Konkuk University
Centre for Agricultural Research
Nihon University
Ludwig-Maximilians-Universität München
Vrije Universiteit Brussel
Jönköping University
University of Pisa
University of Washington
Guangzhou Medical University
University of Amsterdam
MIT