Estimating complex cortical networks via surface recordings-A critical note

被引:27
作者
Antiqueira, Lucas [1 ]
Rodrigues, Francisco A. [2 ]
van Wijk, Bernadette C. M. [3 ]
Costa, Luciano da F. [1 ]
Daffertshofer, Andreas [3 ]
机构
[1] Univ Sao Paulo, Inst Fis Sao Carlos, Grp Computacao Interdisciplinar, BR-13560970 Sao Carlos, SP, Brazil
[2] Univ Sao Paulo, Inst Ciencias Matemat & Computacao, Dept Matemat Aplicada & Estat, BR-13560970 Sao Carlos, SP, Brazil
[3] Vrije Univ Amsterdam, Res Inst MOVE, NL-1081 BT Amsterdam, Netherlands
基金
巴西圣保罗研究基金会;
关键词
Graph theory; Sampling; Canonical variable analysis; Encephalography; GRAPH-THEORETICAL ANALYSIS; SMALL-WORLD NETWORKS; FUNCTIONAL CONNECTIVITY; SCALE-FREE; ORGANIZATION;
D O I
10.1016/j.neuroimage.2010.06.018
中图分类号
Q189 [神经科学];
学科分类号
071006 ;
摘要
We discuss potential caveats when estimating topologies of 3D brain networks from surface recordings. It is virtually impossible to record activity from all single neurons in the brain and one has to rely on techniques that measure average activity at sparsely located (non-invasive) recording sites Effects of this spatial sampling in relation to structural network measures like centrality and assortativity were analyzed using multivariate classifiers A simplified model of 3D brain connectivity incorporating both short- and long-range connections served for testing. To mimic M/EEG recordings we sampled this model via non-overlapping regions and weighted nodes and connections according to their proximity to the recording sites We used various complex network models for reference and tried to classify sampled versions of the "brain-like" network as one of these archetypes It was found that sampled networks may substantially deviate in topology from the respective original networks for small sample sizes For experimental studies this may imply that surface recordings can yield network structures that might not agree with its generating 3D network. (C) 2010 Elsevier Inc All rights reserved
引用
收藏
页码:439 / 449
页数:11
相关论文
共 44 条
[11]  
Costa L., 2001, SHAPE ANAL CLASSIFIC
[12]   Characterization of complex networks: A survey of measurements [J].
Costa, L. Da F. ;
Rodrigues, F. A. ;
Travieso, G. ;
Boas, P. R. Villas .
ADVANCES IN PHYSICS, 2007, 56 (01) :167-242
[13]   A generalized approach to complex networks [J].
Costa, LD ;
da Rocha, LEC .
EUROPEAN PHYSICAL JOURNAL B, 2006, 50 (1-2) :237-242
[14]   The hierarchical backbone of complex networks [J].
Costa, LD .
PHYSICAL REVIEW LETTERS, 2004, 93 (09) :098702-1
[15]   Hierarchical characterization of complex networks [J].
Costa, Luciano da Fontoura ;
Silva, Filipi Nascimento .
JOURNAL OF STATISTICAL PHYSICS, 2006, 125 (04) :845-876
[16]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[17]   Exploring networks with traceroute-like probes:: Theory and simulations [J].
Dall'Asta, L ;
Alvarez-Hamelin, I ;
Barrata, A ;
Vázquez, A ;
Vespignani, A .
THEORETICAL COMPUTER SCIENCE, 2006, 355 (01) :6-24
[18]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[19]  
Fukunaga K, 1990, INTRO STAT PATTERN R, V2nd
[20]  
Hall M., 2009, SIGKDD Explor Newsl, V11, P10, DOI DOI 10.1145/1656274.1656278