Difference between revisions of "Stam et al 2006"
| Line 27: | Line 27: | ||
== Related Papers == | == Related Papers == | ||
| − | [1] | + | [1] v Latora, M Marchiori(2001). [[RelatedPaper::Efficient behavior of small-world networks]]. |
| − | |||
| − | |||
Latest revision as of 21:27, 29 March 2011
Citation
C.J.Stam, B.F.Jones, G.Nolte, M.Breakspear and Ph.Scheltens, Small-World Networks and Functional Connectivity in Alzheimer's Disease, 2006
Online Version
You can find the paper [1]
Problem
In this paper, the authors address the question whether functional brain networks in Alzheimer's Disease(AD) are characterized by a loss of small-world features such as high cluster coefficient and a short path length.
Summary
People use synchronization likelihood (SL) to investigate the connectivity or interdependencies within a dynamical system framework such as human's brain. It has been suggested that a small-world network architecture may be optimal for synchronizing neural activity between different brain regions. In this paper, the authors convert the brain network into a binary graph (vertices with undirected edges). By varying the a threshold T which controls the generation of such graphs, the authors verify that small-world phenomenon does exist in AD patients' brains.
Dataset
In this paper, the authors used 28 subjects as their data.
Analysis
In the experiments, the authors show a nonsignificant trend to lower values of cluster coefficient in AD patients and the path length is larger for those patients.
You can find the result of AD using small-world
Related Papers
[1] v Latora, M Marchiori(2001). Efficient behavior of small-world networks.
