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
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Random graph, Random regular graph and Indifference graph. In general Discrete mathematics, his work in Pathwidth, Line graph, Vertex and Graph partition is often linked to Power law linking many areas of study. As part of his studies on Combinatorics, he often connects relevant subjects like Eigenvalues and eigenvectors.
His biological study spans a wide range of topics, including Integral graph and Directed graph. His work on Giant component as part of general Random graph research is often related to Exponent, thus linking different fields of science. His Spectral graph theory study combines topics from a wide range of disciplines, such as Algebraic connectivity and Rayleigh quotient.
Fan Chung focuses on Combinatorics, Discrete mathematics, Graph, Random graph and Random walk. In his research, Laplace operator is intimately related to Eigenvalues and eigenvectors, which falls under the overarching field of Combinatorics. His Discrete mathematics research focuses on Almost surely and how it connects with Degree.
His Random walk studies intersect with other disciplines such as PageRank, Heat kernel, Stationary distribution and Laplacian matrix. The concepts of his PageRank study are interwoven with issues in Conductance and Algorithm. His study ties his expertise on Graph product together with the subject of Indifference graph.
His primary areas of investigation include Combinatorics, Discrete mathematics, Random walk, Graph and PageRank. His primary area of study in Combinatorics is in the field of Random graph. His work deals with themes such as Random regular graph, Graph enumeration, Convergence, Class and Limit, which intersect with Random graph.
Fan Chung usually deals with Graph and limits it to topics linked to Almost surely and Expander graph and Linear number. His work carried out in the field of PageRank brings together such families of science as Algorithm, Mathematical optimization and Approximation algorithm. Fan Chung focuses mostly in the field of Eigenvalues and eigenvectors, narrowing it down to topics relating to Laplace operator and, in certain cases, Sigma.
His main research concerns Discrete mathematics, Combinatorics, PageRank, Random walk and Algorithm. The various areas that Fan Chung examines in his Discrete mathematics study include Boundary value problem and Log sum inequality. His Permutation, Edge and Chordal graph study in the realm of Combinatorics connects with subjects such as Joint probability distribution and Eulerian path.
His research in PageRank intersects with topics in Approximation algorithm and Cluster analysis. The study incorporates disciplines such as Scheduling, Processor scheduling, Graph theory and The Intersect in addition to Algorithm. His studies in Heat kernel integrate themes in fields like 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.
IEEE Transactions on Information Theory (1989)
A random graph model for massive graphs
William Aiello;Fan Chung;Linyuan Lu.
symposium on the theory of computing (2000)
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)
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)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
University of California, San Diego
University of Massachusetts Amherst
Harvard University
Hungarian Academy of Sciences
University of British Columbia
Stanford University
Sharif University of Technology
Russian Academy of Sciences
Nokia (United States)
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: