19 citations · 98 across the 40 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math-ph2016★ 11 cited
Positive speed self-avoiding walks on graphs with more than one end
Zhongyang Li
A self-avoiding walk (SAW) is a path on a graph that visits each vertex at most once. The mean square displacement of an -step SAW is the expected value of the square of the dis…
math.CO2016
Cubic graphs and the golden mean
Geoffrey R. Grimmett, Zhongyang Li
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. We investigate the validity of the ine…