⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

October 18, 2026Journal of Algebra Combinatorics Discrete Structures and ApplicationsOpen Access

On the average hitting times of weighted Cayley graphs

View Full Paper

Ask AI

Bookmark

Share

Abstract

In this paper, we give exact formulas for the average hitting times of random walks from one vertex to any other vertex on certain weighted Cayley graphs. Received: 26 November 2024 | Revised: 31 May 2026 | Accepted: 09 July 2026

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Yuuho Tanaka (2026) studied this question.

synapsesocial.com/papers/6ad703deb86d1d35b5093b61 https://doi.org/10.13069/jacodesmath.v14i1.358

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1An algebraic framework for finding the average hitting times in graphs with high regularityOriginal Research · 2026
2A central limit theorem for the average target hitting time for a random walk on a random graph2025
3Cover and hitting times of hyperbolic random graphs2024
4Concentration of hitting times in Erdős‐Rényi graphs2024 · 3 citations
5Hitting times in the stochastic block model2024

More related papers

Almost zero transfer in continuous-time quantum walks on weighted tree graphs2024
The spectrum of asymptotic Cayley trees2024
Maximum hitting time of random walks on unicyclic graphs with given diameter2025

More from Journal of Algebra Combinatorics Discrete Structures and Applications

Partitions with unique largest part and their generating functionsSun,
Projective systems and bounds on the length of codes of non-zero defectSun,