Hitting times on the lollipop graph

Abstract We consider the moments and the distribution of hitting times on the lollipop graph which is the graph exhibiting the maximum expected hitting time among all the graphs having the same number of nodes. We obtain recurrence relations for the moments of all order and we use these relations to analyze the asymptotic behavior of the hitting time distribution when the number of nodes tends to infinity.

Authors

Institutions

Publication Details

Journal
Probability in the Engineering and Informational Sciences
Published
2025-03-07
DOI
https://doi.org/10.1017/s0269964825000026
Citations
3
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
8.18
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hitting times on the lollipop graph

Bruno Sericola, François Castella
3 citations
Probability in the Engineering and Informational Sciences
Graph theory and applications
8.18
article

Hitting times on the lollipop graph

Bruno Sericola, François Castella
article en
3 citations

Abstract

Abstract We consider the moments and the distribution of hitting times on the lollipop graph which is the graph exhibiting the maximum expected hitting time among all the graphs having the same number of nodes. We obtain recurrence relations for the moments of all order and we use these relations to analyze the asymptotic behavior of the hitting time distribution when the number of nodes tends to infinity.

Probability in the Engineering and Informational SciencesVol. 39(4)
Centre National de la Recherche Scientifique (FR), Institut de Recherche en Informatique et Systèmes Aléatoires (FR), Université de Rennes (FR)
Openalex Percentile: Top 5%
Graph theory and applications
8.18
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hitting times on the lollipop graph — Bruno Sericola, François Castella · Probability in the Engineering and Informational Sciences (2025) | TGRS Research Map | TGRS