2014
DOI: 10.1103/physreve.90.032809
|View full text |Cite
|
Sign up to set email alerts
|

Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights

Abstract: We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks with long-range dynamics providing a general framework for anomalous diffusion and navigation, and inducing dynamically the small-world property on any network. We obtained exact results for the stationary probability distribution, the average fractional return probability,… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

11
166
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 87 publications
(177 citation statements)
references
References 50 publications
(68 reference statements)
11
166
0
Order By: Relevance
“…It can be seen that the smaller αβ the more narrowly the waiting time PDF is concentrated at small t-values close to t = 0 . This behavior can also be identified in view of Laplace transform (34) 35) and (36). We depict with dashed lines the case when αβ = 1.…”
Section: Generalization Of the Fractional Poisson Processmentioning
confidence: 68%
See 1 more Smart Citation
“…It can be seen that the smaller αβ the more narrowly the waiting time PDF is concentrated at small t-values close to t = 0 . This behavior can also be identified in view of Laplace transform (34) 35) and (36). We depict with dashed lines the case when αβ = 1.…”
Section: Generalization Of the Fractional Poisson Processmentioning
confidence: 68%
“…, N . The topology of the network is described by the positive-semidefinite N × N Laplacian matrix which is defined by [8,12,36,37,38,39,40] L…”
Section: Continuous-time Random Walk On Networkmentioning
confidence: 99%
“…This issue has been already addressed in the previous literatures1314 and is not the main scope of this paper. Nonetheless, we think one can use several excellent algorithms such as the preprocessing algorithm31, which is one possible solution for this problem.…”
Section: Discussionmentioning
confidence: 88%
“…This limitation is circumvented by the natural of Lévy walks model1112. Recently, intensive attention has been devoted to anomalous random walks on networks, such as Lévy walks131415, traditional web surfing16, and even electric signals transmitted in brain networks10. One striking feature of anomalous random walks is having the long-range hopping (i.e., the walker can hop to far away nodes not directly connected to its current position).…”
mentioning
confidence: 99%
“…In this work, we address this matter, following the framework introduced in Refs. [16][17][18]. Our study considers the fractional diffusion of node-centric continuous-time RWs on undirected multiplex with two layers.…”
Section: Introductionmentioning
confidence: 99%