5 citations · 7 across the 7 of their papers we have counts for
6 papers · 1 filter
Forest formulas of discrete Green's functions
Fan Chung, Ji Zeng
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of…
Extreme values of the stationary distribution of random walks on directed graphs
Sinan Aksoy, Fan Chung, Xing Peng
We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of…
Juggling card sequences
Steve Butler, Fan Chung, Jay Cummings +1
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial…
Harnack inequalities for graphs with non-negative Ricci curvature
Fan Chung, Yong Lin, Shing-Tung Yau
We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results f…
Descent polynomials for permutations with bounded drop size
Fan Chung, Anders Claesson, Mark Dukes +1
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating s…
De Bruijn Covering Codes for Rooted Hypergraphs
Joshua N. Cooper, Fan Chung
What is the length of the shortest sequence of reals so that the set of consecutive -words in form a covering code for permutations on of radius ?…