Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.05663

A Decomposition of the Hitting Time Index Using the Kirchhoff Index and an Asymmetry Term

Shunya Tamura·José Luis Palacios·Aleksandar Petojević
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the hitting time index, a graph invariant defined in terms of expected hitting times of simple random walks on finite connected graphs, through its relation with the Kirchhoff index. Using the commute time identity and Tetali's formula, we decompose the hitting time index into a Kirchhoff-index term and a nonnegative asymmetry term expressed by degree-weighted effective resistance sums. We derive lower and upper bounds for the asymmetry term, together with their equality conditions, and obtain a lower bound for the hitting time index in terms of the range of the degree-weighted resistance sums. For trees, we obtain lower and upper bounds for the asymmetry term, with the upper bound expressed in terms of the Wiener index, and characterize the equality case in the lower bound. In particular, we show that among all trees of fixed order, the hitting time index is minimized uniquely by the star graph. Finally, we apply the decomposition to complete bipartite graphs, paths, and graphs obtained by conjoining complete graphs, and recover several known hitting-time formulas.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shunya Tamura, José Luis Palacios, Aleksandar Petojević. 2026-10-05. A Decomposition of the Hitting Time Index Using the Kirchhoff Index and an Asymmetry Term. https://arxiv.org/abs/2610.05663

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Entropy and the growth rate of universal covering trees

This work studies the relation between two graph parameters, $ρ$ and $Λ$. For an undirected graph $G$, $ρ(G)$ is the growth rate of its universal covering tree, while $Λ(G)$ is a weighted geometric average of the vertex degree minus one, corresponding to the rate of entropy growth for the non-backtracking random walk (NBRW). It is well known that $ρ(G) \geq Λ(G)$ for all graphs, and that graphs with $ρ=Λ$ exhibit some special properties. In this work we derive an easy to check, necessary and sufficient condition for the equality to hold. Furthermore, we show that the variance of the number of random bits used by a length $\ell$ NBRW is $O(1)$ if $ρ= Λ$ and $Ω(\ell)$ if $ρ> Λ$. As a consequence we exhibit infinitely many non-trivial examples of graphs with $ρ= Λ$.

math.CO↗
arXiv2026

Multivalued forbidden numbers of two-rowed configurations -- the missing cases

The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\{0,1,\ldots, s-1\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a configuration in a matrix $A$, denoted $F\prec A$, if it is a row/column permutation of a submatrix of $A$. $\text{Avoid}(m,s,F)$ is the set of $m$-rowed, simple $s$-matrices not containing a configuration of $F$ and $\text{forb}(m,s, F)=\max\{|A|\colon A \in \text{Avoid}(m,s,F)\}$. Dillon and Sali initiated the systematic study of $\text{forb}(m,s, F)$ for $2$-matrices $F$, and computed $\text{forb}(m,s, F)$ for all 2-rowed $F$ when $s>3$. In this paper we tackle the remaining cases when $s=3$. In particular, we determine the asymptotics of $\text{forb}(m,3,p\cdot K_2)-\text{forb}(m,3,p\cdot I_2)$ for $p>3$, where $K_2$ is the $2\times 4$ simple $2$-matrix and $I_2$ is the $2\times 2$ identity matrix, as well as the exact values of $\text{forb}(m,3,F)$ for many 2-rowed $2$-matrices $F$.

math.CO↗
arXiv2026

Classical symmetric varieties and quiver representations

The parametrization of Borel orbits on classical symmetric varieties G/K is traditionally described via the combinatorics of clans, developed by Matsuki, Oshima, Wyser, and Yamamoto. We provide a quiver-theoretic reproof of the indexing sets for G = GL_n or Sp_{2n} and K a two-block Levi subgroup using Gabriel's Theorem. This method reveals an unexpected independence from algebraic closure: while orbit counts for most symmetric varieties are sensitive to the base field, our parametrizations remain valid over arbitrary fields for GL_n, and in characteristic not 2 for Sp_{2n}. We further reformulate these sets via matchings in corona graphs to derive new enumerative results, including the ultra log-concavity of orbit counts.

math.CO↗