Abstract
For complex network, the eigentime identity is the expected time taken randomly by a walker starting from a node to another node. In this paper, we study a family of self-similar and symmetric networks named potting networks. We obtain eigentime identities of potting networks based on the recurrent structure of Markov spectrum.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
