The cover time of random walks on a graph has found wide practical applications in different
fields of computer science, such as crawling and searching on the World Wide Web and …

For an undirected graph, its Kemeny's constant is defined as the mean hitting time of random
walks from one vertex to another chosen randomly according to the stationary distribution …

Kemeny's constant for random walks on a graph is defined as the mean hitting time from one
node to another selected randomly according to the stationary distribution. It has found …

The function or performance of a network is strongly dependent on its robustness, which
quantifies the ability of the network to continue functioning under perturbations. While a wide …

The mean hitting time of a Markov chain on a graph from an arbitrary node to a target node
randomly chosen according to its stationary distribution is called Kemeny's constant, which …

It is well known that in many real networks, such as brain networks and scientific
collaboration networks, there exist higher order nonpairwise relations among nodes, ie …

We study resistance eccentricity, a fundamental metric in network science for measuring the
structural significance of a node. For a node in a graph, the resistance eccentricity is its …

Given a stochastic matrix P partitioned in four blocks P ij, i, j= 1, 2, Kemeny's constant κ (P) is
expressed in terms of Kemeny's constants of the stochastic complements P 1= P 11+ P 12 …

Spatial networks are ubiquitous in the real world, with examples including Internet, power
grids, neural networks, and so on. In this paper, based on a proposed disk packing, we …

Resistance distance has been studied extensively in the past years, with the majority of
previous studies devoted to undirected networks, in spite of the fact that various realistic …