IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v377y2020ics0096300320301193.html
   My bibliography  Save this article

Graph-theoretical derivation of brain structural connectivity

Author

Listed:
  • Giacopelli, G.
  • Migliore, M.
  • Tegolo, D.

Abstract

Brain connectivity at the single neuron level can provide fundamental insights into how information is integrated and propagated within and between brain regions. However, it is almost impossible to adequately study this problem experimentally and, despite intense efforts in the field, no mathematical description has been obtained so far. Here, we present a mathematical framework based on a graph-theoretical approach that, starting from experimental data obtained from a few small subsets of neurons, can quantitatively explain and predict the corresponding full network properties. This model also changes the paradigm with which large-scale model networks can be built, from using probabilistic/empiric connections or limited data, to a process that can algorithmically generate neuronal networks connected as in the real system.

Suggested Citation

  • Giacopelli, G. & Migliore, M. & Tegolo, D., 2020. "Graph-theoretical derivation of brain structural connectivity," Applied Mathematics and Computation, Elsevier, vol. 377(C).
  • Handle: RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301193
    DOI: 10.1016/j.amc.2020.125150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320301193
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2020.125150?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. Li, Chao & Wang, Li & Sun, Shiwen & Xia, Chengyi, 2018. "Identification of influential spreaders based on classified neighbors in real-world complex networks," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 512-523.
    3. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    4. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Dynamical attraction in parallel network models," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 874-888.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    2. Yao, Hongxing & Memon, Bilal Ahmed, 2019. "Network topology of FTSE 100 Index companies: From the perspective of Brexit," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1248-1262.
    3. Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    4. Keng, Ying Ying & Kwa, Kiam Heong & Ratnavelu, Kurunathan, 2021. "Centrality analysis in a drug network and its application to drug repositioning," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    5. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    6. Wang, Zhishuang & Guo, Quantong & Sun, Shiwen & Xia, Chengyi, 2019. "The impact of awareness diffusion on SIR-like epidemics in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 134-147.
    7. Teqi Dai & Tiantian Ding & Qingfang Liu & Bingxin Liu, 2022. "Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing," Sustainability, MDPI, vol. 14(22), pages 1-14, November.
    8. Xu, Paiheng & Zhang, Rong & Deng, Yong, 2018. "A novel visibility graph transformation of time series into weighted networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 201-208.
    9. Li, Huichun & Zhang, Xue & Zhao, Chengli, 2021. "Explaining social events through community evolution on temporal networks," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    10. Federico Karagulian & Gaetano Valenti & Carlo Liberto & Matteo Corazza, 2022. "A Methodology to Estimate Functional Vulnerability Using Floating Car Data," Sustainability, MDPI, vol. 15(1), pages 1-15, December.
    11. Agryzkov, Taras & Tortosa, Leandro & Vicent, Jose F., 2019. "A variant of the current flow betweenness centrality and its application in urban networks," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 600-615.
    12. Wang, Weiping & Guo, Junjiang & Wang, Zhen & Wang, Hao & Cheng, Jun & Wang, Chunyang & Yuan, Manman & Kurths, Jürgen & Luo, Xiong & Gao, Yang, 2021. "Abnormal flow detection in industrial control network based on deep reinforcement learning," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    13. Curado, Manuel & Tortosa, Leandro & Vicent, Jose F., 2021. "Identifying mobility patterns by means of centrality algorithms in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    14. da Cunha, Éverton Fernandes & da Fontoura Costa, Luciano, 2022. "On hypercomplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    15. Hernández Serrano, Daniel & Sánchez Gómez, Darío, 2020. "Centrality measures in simplicial complexes: Applications of topological data analysis to network science," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    16. Zhu, Linhe & Liu, Mengxue & Li, Yimin, 2019. "The dynamics analysis of a rumor propagation model in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 118-137.
    17. Liu, Wanping & Wu, Xiao & Yang, Wu & Zhu, Xiaofei & Zhong, Shouming, 2019. "Modeling cyber rumor spreading over mobile social networks: A compartment approach," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 214-229.
    18. Bodaghi, Amirhosein & Goliaei, Sama & Salehi, Mostafa, 2019. "The number of followings as an influential factor in rumor spreading," Applied Mathematics and Computation, Elsevier, vol. 357(C), pages 167-184.
    19. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    20. De Masi, G. & Giovannetti, G. & Ricchiuti, G., 2013. "Network analysis to detect common strategies in Italian foreign direct investment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(5), pages 1202-1214.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301193. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.