Recurrent graph
= Recurrent graph
A connected <locally finite graph> is recurrent if its <simple random walk> returns to its starting vertex <almost surely>. In that case the walk hits every fixed vertex <almost surely> from every starting vertex.