Seen in Brownian motion, this is, FTP, what type of process by which the next movement of a particle or object is dependent on probability alone.
The P?ya constant is a measure for a given number of dimensions that this process will return to the origin in a lattice.  In graphs, it is aperiodic if the graph is bipartite, and it is irreducible if the graph is connected, while it is called ergodic if the graph is connected but not bipartite.  Google's PageRank uses one while crawling the web, and it is a Markov process because the next state is not dependent on any previous move.  Seen in Brownian motion, this is, FTP, what type of process by which the next movement of a particle or object is dependent on probability alone.
The P?ya constant is a measure for a given number of dimensions that this process will return to the origin in a lattice.  
random walk