Decay of connection probabilities with distance in 2D and 3D neuronal networks

被引:5
作者
Goriachkin, Vasilii [1 ]
Turova, Tatyana [1 ]
机构
[1] Lund Univ, Fac Sci, Math Ctr, Solvegatan 18, S-22100 Lund, Sweden
基金
瑞典研究理事会;
关键词
Randomly grown network; Random graphs; Connection probabilities; PERCOLATION; OUTGROWTH; RULE;
D O I
10.1016/j.biosystems.2019.103991
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
We study connectivity in a model of a growing neuronal network in dimensions 2 and 3. Although the axon-to-dendrite proximity is an insufficient condition for establishing a functional synapse, it is still a necessary one. Therefore we study connection probabilities at short distances between the randomly grown axon trees and somas as probabilities of potential connections between the corresponding neurons. Our results show that, contrary to a common belief, these probabilities do not necessarily decay polynomially or exponentially in distance, but there are regimes of parameter values when the probability of proximity is not sensitive to the distance. In particular, in 3 dimensions the Euclidean distance between the neuronal cell body centers of neurons seems to play a very subtle role, as the probabilities of connections are practically constant within a certain finite range of distance. The model has a sufficient number of parameters to assess networks of neurons of different types. Our results give a firm basis for further modelling of the neuronal connectivity taking into account some realistic bouton distributions for establishing synaptic connections.
引用
收藏
页数:7
相关论文
共 25 条
[1]   Networks of random trees as a model of neuronal connectivity [J].
Ajazi, Fioralba ;
Chavez-Demoulin, Valerie ;
Turova, Tatyana .
JOURNAL OF MATHEMATICAL BIOLOGY, 2019, 79 (05) :1639-1663
[2]   Structure of a randomly grown 2-d network [J].
Ajazi, Fioralba ;
Napolitano, George M. ;
Turova, Tatyana ;
Zaurbek, Izbassar .
BIOSYSTEMS, 2015, 136 :105-112
[3]   Spread-out percolation in Rd [J].
Bollobas, Bela ;
Janson, Svante ;
Riordan, Oliver .
RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (02) :239-246
[4]   A Developmental Approach to Predicting Neuronal Connectivity from Small Biological Datasets: A Gradient-Based Neuron Growth Model [J].
Borisyuk, Roman ;
al Azad, Abul Kalam ;
Conte, Deborah ;
Roberts, Alan ;
Soffe, Stephen R. .
PLOS ONE, 2014, 9 (02)
[5]   Structural and functional properties of a probabilistic model of neuronal connectivity in a simple locomotor network [J].
Ferrario, Andrea ;
Merrison-Hort, Robert ;
Soffe, Stephen R. ;
Borisyuk, Roman .
ELIFE, 2018, 7
[6]   Graph analysis of the human connectome: Promise, progress, and pitfalls [J].
Fornito, Alex ;
Zalesky, Andrew ;
Breakspear, Michael .
NEUROIMAGE, 2013, 80 :426-444
[7]   Rich cell-type-specific network topology in neocortical microcircuitry (vol 20, pg 1004, 2017) [J].
Gal, Eyal ;
London, Michael ;
Globerson, Amir ;
Ramaswamy, Srikanth ;
Reimann, Michael W. ;
Muller, Eilif ;
Markram, Henry ;
Segev, Idan .
NATURE NEUROSCIENCE, 2017, 20 (07) :1004-+
[8]   A random-matrix theory of the number sense [J].
Hannagan, T. ;
Nieder, A. ;
Viswanathan, P. ;
Dehaene, S. .
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES, 2018, 373 (1740)
[9]   Statistical connectivity provides a sufficient foundation for specific functional connectivity in neocortical neural microcircuits [J].
Hill, Sean L. ;
Wang, Yun ;
Riachi, Imad ;
Schuermann, Felix ;
Markram, Henry .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2012, 109 (42) :E2885-E2894
[10]   A Simple Rule for Axon Outgrowth and Synaptic Competition Generates Realistic Connection Lengths and Filling Fractions [J].
Kaiser, Marcus ;
Hilgetag, Claus C. ;
van Ooyen, Arjen .
CEREBRAL CORTEX, 2009, 19 (12) :3001-3010