Eigentime identity of the weighted (m,n)-flower networks

The eigentime identity for random walks on the weighted networks is the expected time for a walker going from a node to another node. Eigentime identity can be studied by the sum of reciprocals of ...