Graham, Fan Chung - Departments of Mathematics & Computer Science and Engineering, University of California at San Diego

• On the Spectra of General Random Graphs Mary Radcliffe
• Quasi-random graphs with given degree sequences and Ron Graham
• SIAM J. APPL. MATH. VOI. 34, No. 1, January 1978
• Open problems of Paul Erdos in graph theory F. R. K. Chung
• Braess's Paradox in Large Sparse Graphs Fan Chung and Stephen J. Young
• Eigenvalue inequalities for graphs and convex subgraphs F. R. K. Chung
• Communication Complexity and Quasi-randomness 1 Fan R.K. Chung 2 and Prasad Tetali3
• A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
• 224 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-33, NO. 2, MARCH 1987 The Forwarding Index of
• A chip-firing game and Dirichlet eigenvalues Fan Chung and Robert Ellis
• A Harnack inequality for Dirichlet eigenvalues University of California at San Diego
• Finding and Visualizing Graph Clusters Using PageRank Optimization
• An upper bound for the Turan number t3(n, 4) and Linyuan Lu
• Using PageRank to Locally Partition a Graph Reid Andersen
• Strati ed random walks on the n-cube F. R. K. Chung
• JOURNAL OF COMBINATORIAL THEORY, Series B 24, 14-23 (1978) On Graphs which Contain Ail Small Trees
• Local Partitioning for Directed Graphs Using PageRank Reid Andersen1, Fan Chung2, and Kevin Lang3
• SIAM J. ALG. DlSC. METH. Vol. 4, No. 4, December 1983
• Diameter of random spanning trees in a given graph
• The spectral gap of a random subgraph of a graph We examine the relationship of a graph G and its random subgraphs which are defined by in-
• Maximizing Data Locality in Distributed Systems Fan Chung, Ronald Graham, Ranjita Bhagwan,
• Distance realization problems with applications to Internet tomography
• JOURNALOF COMBINATORIAL THEORY, Series A 32,241-251 (1982) Minimal Decompositions of Hypergraphs into
• On sparse sets hitting linear forms Paul Erdos
• Discrete Mathematics 111 (1993) 125-129 North-Holland
• Dynamic location problems with limited look-ahead and Ronald Graham
• Random walks and local cuts in graphs For a specified subset S of vertices in a graph G we consider local cuts
• Laplacian and vibrational spectra for homogeneous graphs
• Distributing antidote using PageRank vectors University of California, San Diego
• Finding Favorites We investigate a new type of information-theoretic identification problem, suggested
• Maximum subsets of (0, 1] with no solutions to x + y = kz
• Tiling polygons with lattice triangles Steve Butler
• GENERALIZATIONS OF POLYA'S URN PROBLEM FAN CHUNG, SHIRIN HANDJANI, AND DOUG JUNGREIS
• Even Cycles in Directed Graphs F. R. K. Chung
• Spanning trees in subgraphs of lattices University of California, San Diego
• Discrete Mathematics 75 (1989) 113-119 North-Holland
• Several generalizations of Weil sums Fan R. K. Chung
• A local graph partitioning algorithm using heat kernel pagerank University of California at San Diego, La Jolla CA 92093, USA,
• UPPER BOUNDS FOR EIGENVALUES OF THE DISCRETE AND CONTINUOUS LAPLACE OPERATORS
• Eigenvalues of graphs F. R. K. Chung
• Isoperimetric inequalities for cartesian products of graphs
• Coverings, heat kernels and spanning trees Fan Chung
• Dirichlet PageRank and Trust-based Ranking Fan Chung , Alexander Tsiatas, and Wensong Xu
• Classification: Physical Sciences, Mathematics The heat kernel as the pagerank of a graph
• Packing equal squares into a large square Let s(x) denote the maximum number of non-overlapping unit squares
• The Diameter of Sparse Random Graphs Linyuan Lu
• Random walks on generating sets for finite groups F. R. K. Chung 1
• IOURNAL OF COMBINATORIAL THEORY, Series A 43, 23-37 (1986) Some Intersection Theorems for
• Coupling on-line and off-line analyses for random power law graphs
• Mathematics and the Buckyball Fan Chung and Shlomo Sternberg
• SIAM J. COMPUT. Vol. 21, No. 1, pp. 151-162, February 1992
• The spectra of random graphs with given expected degrees In the study of the spectra of power law graphs, there are basically two competing approaches.
• A sharp PageRank algorithm with applications to edge ranking and graph sparsification
• Modeling the Small-World Phenomenon with Local Network Flow Reid Andersen
• SIAM J. ALG. DISC. METH. Vol. 2, No. 1, March 1981
• Fan Chung 10
• JOURNAL OF COMBINATORIAL THEORY @) 18, 164-169 (1975) On Multicolor Ramsey Numbers for
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 38, NO. 4, JULY 1992 1429 where the definition of Cl( * ,., ) is obvious from above. We note
• SIAM J. Disc. MATH. VOI. 2, NO. 2, pp. 145-155, May 1989
• Annals of Combinatorics 7 (2003) 21-33 0218-0006/03/010021-13
• Edge flipping in graphs and Ron Graham
• Quasi-random hypergraphs revisited Corrigendum: Quasi-random classes of hypergraphs,
• Graph Theory in the Information Age
• PageRank and random walks on graphs Fan Chung and Wenbo Zhao
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• The giant component in a random subgraph of a given graph Fan Chung1 , Paul Horn1, and Linyuan Lu2
• PageRank as a discrete Green's function Originally, PageRank was a way to assign quantitative ranking to web-
• A whirlwind tour of random graphs April 1, 2008
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Local Graph Partitioning using PageRank Vectors Reid Andersen
• De Bruijn Covering Codes for Rooted Hypergraphs
• Universal Juggling Cycles Fan Chung y
• Concentration inequalities and martingale inequalities --a survey
• The volume of the giant component of a random graph with given expected degrees
• Editor's Preface A brief overview of network algorithms
• A spectral Turan theorem If all nonzero eigenvalues of the (normalized) Laplacian of a graph G are close to 1, then G is t-Turan
• Drawing power law graphs Reid Andersen
• Drawing Power Law Graphs using a Local/Global Decomposition Reid Andersen
• Analyzing the small world phenomenon using a hybrid model with local network flow
• GUESSING SECRETS WITH INNER PRODUCT QUESTIONS
• Internet Mathematics Vol. 1, No. 2: 177-192 Guessing Secrets with Inner
• Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines
• De Bruijn Cycles for Covering Codes Fan Chung,1
• Discrete Isoperimetric Inequalities University of California at San Diego
• On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks
• The small world phenomenon in hybrid power Fan Chung and Linyuan Lu1
• Connected components in random graphs with given expected degree sequences
• Random evolution in massive graphs William Aiello
• Random evolution in massive graphs William Aiello
• Discrete Green's functions University of California, San Diego
• Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs
• A Random Graph Model for Power Law Graphs William Aiello
• On polynomials of spanning trees University of California, San Diego
• The Maximum Upper Density of a Set of Positive Real Numbers with no solutions to x +y = kz
• Article No. eujc.1999.0311 Available online at http://www.idealibrary.com on
• Logarithmic Sobolev techniques for random walks on graphs F. R. K. Chung
• Forced convex n-gons in the plane F. R. K. Chungy
• On Optimal Strategies for Stealing Cycles in Clusters of Workstations
• A combinatorial trace formula F. R. K. Chung
• Laplacians of graphs and Cheeger inequalities F. R. K. Chung
• 336 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL 14, NO 3, MARCH 1996 Optical Wavelength Routing, Translat
• On sampling with Markov chains F. R. K. Chung
• Eigenvalues of graphs and Sobolev inequalities F. R. K. Chung
• Salvage-Embeddings of Complete Trees Sandeep N. Bhatt
• On the cover polynomial of a digraph F. R. K. Chung
• Groups and the Buckyball Fan R. K. Chung , Bertram Kostant and Shlomo Sternberg
• SIAM J. DISCRETE MATH. Vol. 7, No. 3, pp. 513-530, August 1994
• CHORDAL COMPLETIONS OF PLANAR GRAPHS F. R. K. CHUNG AND DAVID MUMFORD
• A report on reliable software and communication We discuss the general state of affairs in a variety of related areas ranging from software safety,
• SIAM J. DISCRETE MATH. Vol. 7, No. 3, pp. 443-457, August 1994
• JOURNAL OF COMBINATORIAL THEORY, Series A, 61. 6486 (1992) Quasi-Random Subsets of Z,
• Discrete Applied Mathematics 37138 (1992) 73-94 North-Holland
• Discrete Mathematics 81(1990) 129-135 North-Holland
• SIAM J. DISC. MATH. Vol. 2, No. 4, pp. 467-472, November 1989
• Discrete Mathematics 72 (1988) 15-19 North-Holland
• SIAM J. Disc. MATH. Vol. 1, No. 3, August 1988
• Order 1 (198.5), 351-369. 0167-8094/85.15. 0 1985 by D. Reidel Publishing Company.
• JOURNAL OF COMBINATORIAL THEORY, Series B 38, 248-260 (1985) Extremal Subgraphs for Two Graphs
• SIAM J. ALG. DISCR. METH. Vol. 6, No. 2, April 1985
• Discrete Mathematics 50 (1984) 15-28 North-Holland
• Inorg. Chem. 1984, F, = -0 of a given polyhedron, the X value remains un-
• SIAM J. ALG. DISC. METH. Vol. 3, No. 1, March 1982
• JOURNALOF COMBINATORIAL THEORY.S~~~~S B 31,348-355 (1981) Universal Caterpillars
• SIAM J. ALG. DISC. METH. Vol. 1, No. 4, December 1980
• SIAM J. ALG. DISC. METH. Vol. 1, No. 3, September 1980
• KNJRNAL OF COMBINATORIAL THEORY, Series A 29, 267-279 (1980) On Unimodal Subsequences
• Discre':.e Mathematics 30 (1980) 89-93. @ No th-Holland Publishing Company
• JOURNAL OF COMBINATORIAL THEORY, Series A 27, 397400(1979) Maximum Antichains of Rectangular Arrays
• 1282 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL.COM-26, NO. 8, AUGUST 1978 from that of Gaussian. It may be noted that this characteristic
• A Random Graph Model for Power Law Graphs William Aiello
• SIAM J. ALG. DISC. METH. Voi. 8, No. 1, January 1987
• DESCENT POLYNOMIALS FOR PERMUTATIONS WITH BOUNDED DROP SIZE
• A combinatorial Laplacian with vertex weights F. R. K. Chung
• Fan Chung * Guessing secrets
• Contemporary Mathematics Weighted Laplacians and the Sigma Function of a Graph
• The diameter and Laplacian eigenvalues of directed graphs
• Optimal Emulations by Butterfly-Like Networks Sandeep N. Bhatt
• Camp. & Mu/h xtrh Appls. Vol IO. No. I. pp. 43.60. 1984 Pnnted in Great Bnta~n
• Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Tradeo
• A Network Coloring Game Kamalika Chaudhuri1
• A symmetrical Eulerian identity We give three proofs for the following symmetrical identity involving binomial coefficients
• The average distance in a random graph with given expected degrees
• Spectra of random graphs with given expected degrees
• JOURNAL OF COMPUTATIONAL BIOLOGY Volume 10, Number 5, 2003
• Primitive Juggling Sequences Fan Chung Ron Graham
• Lectures on Spectral Graph Theory
• Weighted Graph Laplacians and Isoperimetric Inequalities University of California, San Diego
• Combinatorics for the East model Persi Diaconis
• Logarithmic Harnack inequalities F. R. K. Chung
• A Harnack inequality for homogeneous graphs and subgraphs F. R. K. Chung
• Laplacians and the Cheeger inequality for directed graphs
• Eigenvalues and diameters for manifolds and graphs F.R.K. Chung *
• Oblivious and Adaptive Strategies for the Majority and Plurality Problems
• JOURNAL OF COMBINATORIALTHEORY, Series A 35,252-262 (1983) Unavoidable Stars in 3-Graphs
• JOURNAL OF COMBINATORIAL THEORY, SeriesA 38, 21&216 (1985) Quantitative Forms of a Theorem of Hilbert
• JOURNAL OF COMBINATORIAL THEORY, Series A 24, 382-394 (1978) The Number of Baxter Permutations
• Hypergraph coloring games and voter models Fan Chung Alexander Tsiatas
• Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust
• Graphlets: a Spectral Perspective for Graph University of California, San Diego
• Hypergraph coloring games and voter models Fan Chung Alexander Tsiatas