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

On the meeting of random walks on random DFA

Author

Listed:
  • Quattropani, Matteo
  • Sau, Federico

Abstract

We consider two random walks evolving synchronously on a random out-regular graph of n vertices with bounded out-degree r≥2, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with respect to the generation of the graph, the meeting time of the two walks is stochastically dominated by a geometric random variable of rate (1+o(1))n−1, uniformly over their starting locations. Further, we prove that this upper bound is typically tight, i.e., it is also a lower bound when the locations of the two walks are selected uniformly at random. Our work takes inspiration from a recent conjecture by Fish and Reyzin (2017) in the context of computational learning, the connection with which is discussed.

Suggested Citation

  • Quattropani, Matteo & Sau, Federico, 2023. "On the meeting of random walks on random DFA," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    • Handle: RePEc:eee:spapps:v:166:y:2023:i:c:s0304414923001898
    DOI: 10.1016/j.spa.2023.104225
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414923001898
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2023.104225?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.

    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:166:y:2023:i:c:s0304414923001898. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.