Abstract
Let P be a simple polytope with n−d=2, where d is the dimension and n is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of P terminates after O(log2n) steps, if the edges are oriented in a (pseudo-)linear fashion. We prove that the same bound holds for the more general unique sink orientations.
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.
