Abstract
AbstractA pure random walk is the motion on a graph of a particle that is not allowed to rest and that chooses the next move equiprobably among all possible ones available. This section opens with the classical random walks on Z and Z3 and the pure random walk on a graph of which the one-dimensional symmetric random walk on Z is the simplest example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
