Work

Hitting Times in the Binomial Random Graph

Year: 2026

Type: article

Abstract: ABSTRACT 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 .

Source: Journal of Graph Theory

DOI: 10.1002/jgt.70057

Authors: Bertille Granet, Felix Joos, Jonathan Schrodt

Institutions: University of Warwick, Heidelberg University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funders: Alexander von Humboldt-Stiftung, Deutsche Forschungsgemeinschaft