4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.PR2014
Random-step Markov processes
Neal Bushaw, Karen Gunderson, Steven Kalikow
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, has a station…
math.CO2014★ 4 cited
The typical structure of graphs with no large cliques
József Balogh, Neal Bushaw, Maurício Collares Neto +3
In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed , almost every -vertex -free graph is -partite. In this paper we extend this…