Eigentime identities of flower networks with multiple branches

Abstract For the fractal networks, the eigentime identity is the expected time for a walker going from one node to another. In this paper, we study a family of flower networks that have k parallel paths with lengths m 1 , m 2 , … , m k . Let C t be the eigentime identity of the flower networks in generation t , then the obtained result shows that the eigentime identity is C t ≈ ( ∑ i = 1 k m i ) ∕ ( ∑ i = 1 k m i − 1 ) t .