Photo by saffu from unsplash
The eigentime identity for random walks on networks is the expected time for a walker going from a node to another node. In this paper, our purpose is to calculate… Click to show full abstract
The eigentime identity for random walks on networks is the expected time for a walker going from a node to another node. In this paper, our purpose is to calculate the eigentime identities of flower networks by using the characteristic polynomials of normalized Laplacian and recurrent structure of Markov spectrum.
Keywords:
eigentime identities;
identities fractal;
fractal flower;
flower networks
Journal Title: Fractals
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Fractals
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!