EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hitting Times in the Binomial Random Graph

Bertille Granet, Felix Joos, Jonathan Schrodt

Journal of Graph Theory · 2026-10 · 113 (2) · 377-393

DOI: 10.1002/jgt.70057 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 22.05.2026. Verfasst von Bertille Granet und 2 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft, Alexander von Humboldt-Stiftung.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Fix , choose , and consider . For any pair of vertices , we give a simple and precise formula for the expected number of steps that a random walk on starting at needs to first arrive at . The formula only depends on basic structural properties of . This improves and extends recent results of Ottolini and Steinerberger, as well as Ottolini, who considered this problem for constant as well as for mildly vanishing .

Förderung

  • Deutsche Forschungsgemeinschaft
  • Alexander von Humboldt-Stiftung

Zitieren

APA

Granet, B., Joos, F., & Schrodt, J. (2026). Hitting Times in the Binomial Random Graph. Journal of Graph Theory, 113(2), 377-393. https://doi.org/10.1002/jgt.70057

Vancouver

Granet B, Joos F, Schrodt J. Hitting Times in the Binomial Random Graph. Journal of Graph Theory. 2026;113(2):377-393. doi:10.1002/jgt.70057

BibTeX
@article{Granet2026,
  author = {Granet, Bertille and Joos, Felix and Schrodt, Jonathan},
  title = {Hitting Times in the Binomial Random Graph},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {113},
  number = {2},
  pages = {377--393},
  doi = {10.1002/jgt.70057}
}
Kostenlos starten →