메뉴 건너뛰기




Volumn 82, Issue 2, 2010, Pages

Effect of tumor resection on the characteristics of functional brain networks

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; BEFORE AND AFTER; BRAIN AREAS; BRAIN NETWORKS; BRAIN TUMORS; COGNITIVE PERFORMANCE; FUNCTIONAL INTERACTION; GLOBAL TRANSPORT; INFORMATION TRANSFERS; LARGEST EIGENVALUES; LINK WEIGHTS; SUBGRAPHS; TUMOR RESECTION; VIRUS SPREADING; WEIGHTED NETWORKS;

EID: 77956110597     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.82.021924     Document Type: Article
Times cited : (35)

References (43)
  • 1
    • 0038718854 scopus 로고    scopus 로고
    • 10.1137/S003614450342480
    • M. E. J. Newman, SIAM Rev. 45, 167 (2003). 10.1137/S003614450342480
    • (2003) SIAM Rev. , vol.45 , pp. 167
    • Newman, M.E.J.1
  • 14
    • 37749039287 scopus 로고    scopus 로고
    • 10.1103/PhysRevE.76.066106
    • J. J. Ramasco and B. Gonçalves, Phys. Rev. E 76, 066106 (2007). 10.1103/PhysRevE.76.066106
    • (2007) Phys. Rev. e , vol.76 , pp. 066106
    • Ramasco, J.J.1    Gonçalves, B.2
  • 16
    • 58949094701 scopus 로고    scopus 로고
    • 10.1093/brain/awn262
    • C. J. Stam, Brain 132, 213 (2009). 10.1093/brain/awn262
    • (2009) Brain , vol.132 , pp. 213
    • Stam, C.J.1
  • 17
    • 77951249162 scopus 로고    scopus 로고
    • 10.1371/journal.pone.0008081
    • E. van Dellen, PLoS ONE 4, e8081 (2009). 10.1371/journal.pone.0008081
    • (2009) PLoS ONE , vol.4 , pp. 8081
    • Van Dellen, E.1
  • 18
    • 0037087387 scopus 로고    scopus 로고
    • 10.1016/S0167-2789(01)00386-4
    • C. J. Stam and B. W. van Dijk, Physica D 163, 236 (2002). 10.1016/S0167-2789(01)00386-4
    • (2002) Physica D , vol.163 , pp. 236
    • Stam, C.J.1    Van Dijk, B.W.2
  • 24
    • 77956113623 scopus 로고    scopus 로고
    • A weight-reshuffled graph can be obtained by collecting all the link weights in the original network and by randomly reassigning them to the links in the original network topology. Equivalently, half, e.g., upper right of the original adjacency matrix is randomly shuffled and then is mapped to the lower-left part of the adjaceny matrix, whose symmetry is reserved in this weight-reshuffling process
    • A weight-reshuffled graph can be obtained by collecting all the link weights in the original network and by randomly reassigning them to the links in the original network topology. Equivalently, half, e.g., upper right of the original adjacency matrix is randomly shuffled and then is mapped to the lower-left part of the adjaceny matrix, whose symmetry is reserved in this weight-reshuffling process.
  • 25
    • 0001884644 scopus 로고
    • 10.2307/3001968
    • F. Wilcoxon, Biometrics 1, 80 (1945). 10.2307/3001968
    • (1945) Biometrics , vol.1 , pp. 80
    • Wilcoxon, F.1
  • 26
    • 77956102282 scopus 로고    scopus 로고
    • With N=150, we are able to compare the link weight correlation around a node via ( si + sj ) /2 (N-1 ) versus wij in networks measured before and after neurosurgery, because almost the same link weight distribution is followed
    • With N = 150, we are able to compare the link weight correlation around a node via (s i + s j) / 2 (N - 1) versus w i j in networks measured before and after neurosurgery, because almost the same link weight distribution is followed.
  • 27
    • 77956123047 scopus 로고    scopus 로고
    • Instead of making scatter plots of all [ ( si + sj ) /2 (N-1 ) , wij ] pairs which heavily overlap, we divide the link weight range [0,1] into 100 bins, and over each bin we calculate the average ( si + sj ) /2 (N-1 ) corresponding to those wij that belong to the same bin
    • Instead of making scatter plots of all [(s i + s j) / 2 (N - 1), w i j] pairs which heavily overlap, we divide the link weight range [0,1] into 100 bins, and over each bin we calculate the average (s i + s j) / 2 (N - 1) corresponding to those w i j that belong to the same bin.
  • 29
    • 77956110373 scopus 로고    scopus 로고
    • ij
    • ij.
  • 30
    • 70350674995 scopus 로고
    • 10.1090/S0002-9939-1956-0078686-7
    • Joseph B. Kruskal, Proc. Am. Math. Soc. 7, 48 (1956). 10.1090/S0002-9939-1956-0078686-7
    • (1956) Proc. Am. Math. Soc. , vol.7 , pp. 48
    • Kruskal, J.B.1
  • 32
    • 77956102688 scopus 로고    scopus 로고
    • Transport is assumed to follow the shortest paths
    • Transport is assumed to follow the shortest paths.
  • 35
    • 0001560594 scopus 로고
    • 10.2307/1970008
    • E. Wigner, Ann. Math. 67, 325 (1958). 10.2307/1970008
    • (1958) Ann. Math. , vol.67 , pp. 325
    • Wigner, E.1
  • 36
  • 38
  • 39
    • 77956102907 scopus 로고    scopus 로고
    • Weighted network analysis could be noisy if the weakest link weights may not represent real coupling, but statistical fluctuations in the coupling measure
    • Weighted network analysis could be noisy if the weakest link weights may not represent real coupling, but statistical fluctuations in the coupling measure.
  • 40
    • 77956096236 scopus 로고    scopus 로고
    • min (MaST )
    • The construction of a MaST shows that, if node i is the last node to join the MaST by including link (i, k), w i k = w min (MaST) and w i k must be the largest link weight among all links connected to node i, or else node i can join the MaST by another link incident to it, but with higher link weight. Any other subgraph G s (N) spanning all nodes must contain at least one link connected to node i, whose weight is smaller or equal to w i k = w min (MaST) and which can be larger than w min (G s (N)). Hence, w min (G s (N)) ≤ w min (MaST).
  • 41
    • 77956111379 scopus 로고    scopus 로고
    • Thus, E [D] /N=20% of the original links with the highest link weights are included, resulting in a small number of networks with only few disconnected nodes. These disconnected nodes, although small in number, are all taken into account in the unweighted analysis, because such disconnectivity also reveals information about the weighted networks
    • Thus, E [D] / N = 20 % of the original links with the highest link weights are included, resulting in a small number of networks with only few disconnected nodes. These disconnected nodes, although small in number, are all taken into account in the unweighted analysis, because such disconnectivity also reveals information about the weighted networks.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.