3 citations · 8 across the 8 of their papers we have counts for
Showing 2004 · math.COShow all
2 papers · 2 filters
math.CO2004★ 3 cited
Simulating a Random Walk with Constant Error
Joshua N. Cooper, Joel Spencer
We analyze Jim Propp's P-machine, a simple deterministic process that simulates a random walk on to within a constant. The proof of the error bound relies on several estimate…
math.CO2004★ 1 cited
How Complex are Random Graphs in First Order Logic?
Jeong Han Kim, Oleg Pikhurko, Joel Spencer +1
It is not hard to write a first order formula which is true for a given graph G but is false for any graph not isomorphic to G. The smallest number $(G) of nested quantifiers in a…