Publications
Preprints
 (With Arthur L.B. Yang) A combinatorial identity on GaltonWatson
process, submitted.
 (With Richard P. Anstee)
Unavoidable Multicoloured
Families of Configurations, submitted.
 (With Shoudong Man) Connected Hypergraphs with Small Spectral Radius, Linear Algebra and its Application, 509, (2016), 206227.
 (With Travis Johnston)
Strong Jumps and Lagrangians of NonoUniform Hypergraphs, submitted.
 (With Xing Peng) High Order Phase Transition in Random Hypergrpahs, in preprint.
(2015+)
 (With Kevin G. Milans)
Set families with forbidden
subposets, J. Combin. Theory Ser. A., to appear.
 (With Travis Johnston and Kevin Milans)
Boolean algebras and Lubell
functions, J. Combin. Theory Ser. A., to appear
 (With Laszlo Szekely) A new
asymptotic enumeration technique: the Lovasz Local
Lemma, J. Combin. Theory Ser., to appear.
(2014)
 (With Travis Johnston)
Turan
Problems on Nonuniform Hypergraphs, Electronic Journal of
Combinatorics, 21 (4), (2014), P22.
 (With Edward Boehnlein, Peter Chin, and Amit Sinha)
Computing Diffusion State Distance using Green's Function and Heat
Kernel on Graphs, accepted by
the 11th Workshop on
Algorithms and Models for the Web Graph, WAW2014.
 On crownfree families of subsets, J. Combin. Theory Ser. A., 126, (2014), Pages 216231.
 (With Yong Lin and S.T. Yau) Ricciflat graphs with girth at least five, to appear in Communications in Analysis and Geometry.
 (With Steve Butler and Ron Graham)
Unrolling residues to avoid progressions, Math. Mag. 87 (2014) 8394.
(2013)
 (With Xing Peng) Spectra of edgeindependent random graphs, Electronic Journal of Combinatorics, 20 (4), (2013) P27.
 (With Richard Anstee) Repeated columns and an old chestnut,
Electronic Journal of Combinatorics, 20 (4), (2013) P2.
 (With Jingfen Lan) Diameter of Graphs with Spectral Radius at most ^{3}⁄_{2}√2, Linear Algebra and its Application, 438, No. 11, (2013), 43824407.
 (With Austin Mohr and Laszlo Szekely)
Connected Balanced Subgraphs in Random Regular Multigraphs
Under the Configuration Model, accepted by JCMCC.
 (With Xing Peng) Highordered Random Walks and Generalized Laplacians on Hypergraphs, Internet Mathematics, 9, No. 1, (2013) 332.
(2012)
 (With Austin Mohr and Laszlo Szekely)
Quest for Negative Dependency Graphs,
in Recent Advances in Harmonic Analysis and Applications: In Honor of Konstantin Oskolkov
(Eds. D. Bilyk, L. DeCarli, A. Petukhov, A. M. Stokolos, B. D. Wick)
Springer Proceedings in Mathematics & Statistics, (2012),
243258.
 (With Xing Peng) The fractional chromatic number of trianglefree graphs with maximum degrees at most 3,
Discrete Mathematics
312, No. 24, (2012), 35023516.
 (With Jingfen Lan, Lingsheng Shi) Graphs with Diameter $ne$ Minimizing the Spectral Radius, Linear Algebra and its Applications , 437, No. 11, (2012), 28232850.
 (With Xing Peng) Loose Laplacian spectra of random hypergraphs , Random Structures & Algorithms,
41 No. 4, (2012), 521545.
 (With Sang P. Chin and Elizabeth Reilly)
Finding structures in largescale graphs, In Proceedings of SPIE, vol. 8408, (2012)
p. 840805.
 (With Xing Peng)
Monochromatic 4term arithmetic progressions in 2colorings of Z_{n},
J. Combin. Theory Ser. A., 119 No. 5, (2012), 10481065.
 (With Andrew D. King, Xing Peng) A fractional analogue of Brooks' Theorem, SIAM J. Discrete Math.
26, No. 2, 452471.
 (With Xing Peng) On Meyniel's conjecture of the cop number, Journal of Graph Theory, 71, No. 2, (2012),192205.
 (With Jerry Griggs, WeiTian Li)
Diamondfree Families, J. Combin. Theory Ser. A. 119 (2012) 310322.
 (With Paul Horn and Fan Chung)
Diameter of random spanning trees in a given graph, Journal of Graph Theory, 69 No.3 (2012), 223240.
(2011)
 (With Yong Lin, S.T. Yau) Ricci Curvature of graphs, Tohoku mathematics journal, 63 No. 4, (2011), 605627.
 (With Xing Peng) Highordered Random Walks and Generalized Laplacians on Hypergraphs (exended abstract), Algorithms and Models for the WebGraph: 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 2729, 2011, Proceedings.
 (With Yiting Yang)
A theorem on Randic index and the diameter of a graph
Discrete Mathematics
Volume 311, Issue 14, (2011) 13331343.
 (With Joshua Cooper) Graphs with Asymptotically Invariant Degree Sequence
under Restriction, Internet Mathematics, 7 1, (2011), 6780.
(2010)
 (With WeiTian Li and Yiting Yang)
Routing numbers of Cycles, Complete Bipartite Graphs, and Hypercubes,
SIAM J. Discrete Math. 24, (2010), pp. 14821494.
 (With Yiting Yang)
A Lower bound of transposition diameter for permutations,
SIAM J. Discrete Math. 24 (2010) 12421249.
(2009)
 (With Paul Horn and Fan Chung)
The giant component in a random subgraph of a given graph,
Proceedings of WAW2009, Lecture Notes in Computer Science 5427, 3849.
 (With Paul Horn and Fan Chung)
Percolation in General Graphs, Internet Mathematics, 6 (2009), No. 3, 331347.
 (With Jerry Griggs)
On families of subsets with a forbidden subposet, Combinatorics, Probability and Computing,
Volume 18, Special Issue 05, (2009), 731748.
 (With Yi Zhao)
An exact result and its application
on hypergraph Turan numbers,
SIAM J. Discrete Math. 23 (2009) 13241334.
(20042008)

Explicit construction of small Folkman graphs,
Siam Journal of Discrete Math, 21 No. 4 (2008), 10531060.
 (With Szekely)Using Lovasz Local Lemma in the space of random injections,
The Electronic Journal of Combinatorics, Volume 14(1) #63 (2007).
 (With Reid Andersen and Fan Chung),
Drawing power law graphs
using a local/global decomposition, Algorithmica
47 (2007), no. 4, 379397.
 (With Fan Chung)
Concentration inequalities and martingale inequalities  a survey
, Internet Mathematics,
3 (2006), No. 1, 79127.
 (With Fan Chung)
The volume of the giant component for a random graph with given expected
degrees,
SIAM J. Discrete Math.,
20 (2006), No. 2, 395411.
 Reid Andersen, Fan Chung, and Linyuan Lu,
Modeling the smallworld Phenomenon with local network flow,
Internet Mathematics vol. 2 (2005), No 3, 359385.
 Reid Anderson, Fan Chung, and Linyuan Lu,
Drawing power law graph, (extended abstract), in Graph Drawing,
Lecture Notes in Computer Science 3383, (2005), 1217.
 Fan Chung and Linyuan Lu,
Coupling online and offline analyses for random
power law graphs,
Internet Mathematics,
1 No. 4, (2004), 409461.
 Reid Anderson, Fan Chung, and Linyuan Lu Analyzing the small world phenomenon using
a hybrid model with local network flow,
Third Workshop on Algorithms and Models for the WebGraph (WAW 2004),
October 2004 Rome, Italy.
 (With Fan Chung) The Small World Phenomenon in Hybrid Power Law Graphs,
Lect. Notes Phys., 650, 89104, (2004).
 Fan Chung, Ronald Graham, Linyuan Lu,
Guessing Secrets with Inner Product Questions
(full paper),
Internet Mathematics 1 (2), 2004, 177192.
(20012003)
 Fan Chung, Linyuan Lu, and Van Vu,
The spectra of random graphs with given expected degrees,
Proceedings of National Academy of Science,
100, No. 11, (2003), 63136318.
 Fan Chung, Linyuan Lu, Gregory Dewey, and David J. Galas.
Duplication models for biological
networks, Journal of Computational Biology, 10, No. 5
(2003), 677688.
 Fan Chung, Linyuan Lu, and Van Vu,
Eigenvalues of random power law graphs,
Annals of Combinatorics 7, (2003), 2133.
 Ju Wang, Linyuan Lu and Andrew. A. Chien,
Tolerating
denialofservice attacks using overlay networks  Impact of overlay
network topology, Proceedings of the 2003 ACM workshop on Survivable
and selfregenerative systems: in association with 10th ACM Conference
on Computer and Communications Security, (2003), 4352.
 Fan Chung, Linyuan Lu,
The average distance in random graphs with given expected degrees (full paper),
Internet Mathematics 1 (1), 2003, 91114.
 Fan Chung and Linyuan Lu.
Connected components in a random graph with given degree
sequences, Annals of Combinatorics, 6 (2002), 125145.
 Fan Chung and Linyuan Lu
The average distance in random graphs with given expected
degrees,
Proceedings of National Academy of Science,
99 (2002), 1587915882.
 Fan Chung, Ronald Graham, and Linyuan Lu.
Guessing secrets with inner product questions (extended abstract),
Proceedings of the Thirteenth ACMSIAM Symposium on Discrete
Algorithms, (2002), 247253.
 Ke Liang, Zixin Hou, and Linyuan Lu,
On sheets of orbit covers for classical semisimple Lie Groups,
Sci. China Ser. A, 45(2), (2002), 155164.
 Linyuan Lu.
The diameter of random massive graphs,
Proceedings of the Twelfth ACMSIAM Symposium on Discrete
Algorithms, (2001), 912921.
 William Aiello, Fan Chung, and Linyuan Lu.
Random evolution in
massive graphs (extended abstract),
Proceedings of the FortySecond Annual
Symposium on Foundations of Computer Science, (2001), 510519.
 Fan Chung and Linyuan Lu.
The diameter of random sparse graphs,
Adv. in Appl. Math. 26
(2001), 257279.
(before 2000)
 William Aiello, Fan Chung, and Linyuan Lu.
A random graph model for power law graphs,
Experiment. Math. 10(1), (2000), 5366.
 William Aiello, Fan Chung, and Linyuan Lu.
A random graph model for massive graphs,
Proceedings of the ThirtySecond Annual ACM
Symposium on Theory of Computing, (2000), 171180.
 Fan Chung and Linyuan Lu,
An upper bound for the Turán number
t_{3}(n,4)
, J. Combin. Theory Ser. A
87(2), (1999), 381389.
 Zixin Hou and Linyuan Lu. A class of homogeneous semisimple
spaces,
Chinese Ann. Math. Ser. B 19(3), (1998), 321330.
 Ke Liang and Linyuan Lu. Sheets
and rigid orbit covers of exceptional Lie groups,
Chinese Sci. Bull. 43(20), (1998), 17021706.
