IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v153y2022icp145-182.html
   My bibliography  Save this article

Linking the mixing times of random walks on static and dynamic random graphs

Author

Listed:
  • Avena, Luca
  • Güldaş, Hakan
  • van der Hofstad, Remco
  • den Hollander, Frank
  • Nagy, Oliver

Abstract

In this paper, which is a culmination of our previous research efforts, we provide a general framework for studying mixing profiles of non-backtracking random walks on dynamic random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph tends to infinity. Subject to mild general conditions, we link two mixing times: one for a static version of the random graph, the other for a class of dynamic versions of the random graph in which the edges are randomly rewired but the degrees are preserved. With the help of coupling arguments we show that the link is provided by the probability that the random walk has not yet stepped along a previously rewired edge.

Suggested Citation

  • Avena, Luca & Güldaş, Hakan & van der Hofstad, Remco & den Hollander, Frank & Nagy, Oliver, 2022. "Linking the mixing times of random walks on static and dynamic random graphs," Stochastic Processes and their Applications, Elsevier, vol. 153(C), pages 145-182.
  • Handle: RePEc:eee:spapps:v:153:y:2022:i:c:p:145-182
    DOI: 10.1016/j.spa.2022.07.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414922001740
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spa.2022.07.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Avena, Luca & Güldaş, Hakan & Hofstad, Remco van der & Hollander, Frank den, 2019. "Random walks on dynamic configuration models:A trichotomy," Stochastic Processes and their Applications, Elsevier, vol. 129(9), pages 3360-3375.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:153:y:2022:i:c:p:145-182. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.