• Login
    View Item 
    •   SMARTech Home
    • College of Computing (CoC)
    • Algorithms and Randomness Center (ARC)
    • ARC Talks and Events
    • View Item
    •   SMARTech Home
    • College of Computing (CoC)
    • Algorithms and Randomness Center (ARC)
    • ARC Talks and Events
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Random walks on the chambers of a hyperplane arrangement

    Thumbnail
    View/Open
    nestoridi.mp4 (290.7Mb)
    nestoridi_videostream.html (1.012Kb)
    transcription.txt (24.08Kb)
    Date
    2018-05-15
    Author
    Nestoridi, Evita
    Metadata
    Show full item record
    Abstract
    The Bidigare-Hanlon-Rockmore random walk on the chambers of a real hyperplane arrangement is a Markov chain that generalizes famous examples, such as the Tsetlin library and riffle shuffles. We will introduce lower bounds for the separation distance and a strong stationary time, which allow for the first time to study cutoff for hyperplane arrangement walks under certain conditions. We will also discuss how the method for the lower bound can be used to prove a uniform lower bound for the mixing time of Glauber dynamics on a monotone system, such as the Ising model, reproving a result of Ding and Peres.
    URI
    http://hdl.handle.net/1853/59714
    Collections
    • ARC Talks and Events [84]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology

    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology