English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Graph products have been extensively applied to model complex networks withstriking properties observed in real-world complex systems. In this paper, westudy the hitting times for random walks on a class of graphs generatediteratively by edge corona product. We first derive recursive solutions to theeigenvalues and eigenvectors of the normalized adjacency matrix associated withthe graphs. Based on these results, we further obtain interesting quantitiesabout hitting times of random walks, providing iterative formulas for two-nodehitting time, as well as closed-form expressions for the Kemeny's constantdefined as a weighted average of hitting times over all node pairs, as well asthe arithmetic mean of hitting times of all pairs of nodes.

Hitting Times of Random Walks on Edge Corona Product Graphs