Showing math.COShow all
2 papers · 1 filter
math.CO2026
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
Aida Abiad, Yusaku Nishimura
For any given vertices and in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex starting at…
math.CO2025
Universal graph series, chromatic functions, and their index theory
Tsuyoshi Miezaki, Akihiro Munemasa, Yusaku Nishimura +2
In the present paper, we introduce the concept of universal graph series. We then present four invariants of graphs and discuss some of their properties. In particular, one of thes…