This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\setremarkmarkup

(#2)

Variability of collective dynamics in random tree networks of strongly-coupled stochastic excitable elements

Ali Khaledi-Nasab ali.khaledi1989@gmail.com Department of Physics and Astronomy, Ohio University, Athens, Ohio 45701, USA Neuroscience Program, Ohio University, Athens, Ohio 45701, USA    Justus A. Kromer jkromer@stanford.edu Stanford University, Department of Neurosurgery, Stanford, CA, 94305, USA    Lutz Schimansky-Geier alsg@physik.hu-berlin.de Department of Physics and Astronomy, Ohio University, Athens, Ohio 45701, USA Department of Physics, Humboldt-Universität zu Berlin, Newtonstrasse 15, 12489 Berlin, Germany Bernstein Center for Computational Neuroscience, Berlin, Germany    Alexander B. Neiman neimana@ohio.edu Department of Physics and Astronomy, Ohio University, Athens, Ohio 45701, USA Neuroscience Program, Ohio University, Athens, Ohio 45701, USA
(August 22, 2025)
Abstract

We study the collective dynamics of strongly diffusively coupled excitable elements on small random tree networks. Stochastic external inputs are applied to the leaves causing large spiking events. Those events propagate along the tree branches and, eventually, exciting the root node. Using Hodgkin-Huxley type nodal elements, such a setup serves as a model for sensory neurons with branched myelinated distal terminals. We focus on the influence of the variability of tree structures on the spike train statistics of the root node. We present a statistical description of random tree network and show how the structural variability translates into the collective network dynamics. In particular, we show that in the physiologically relevant case of strong coupling the variability of collective response is determined by the joint probability distribution of the total number of leaves and nodes. We further present analytical results for the strong coupling limit in which the entire tree network can be represented by an effective single element.

pacs:
87.19.ll, 87.19.lb, 87.19.lc, 05.45.Xt, 05.10.Gg

I Introduction

The study of the dynamical properties of complex networks of nonlinear elements Newman (2010); Barabási and Pósfai (2016) is an important trend in nonlinear science Boccaletti et al. (2006); Arenas et al. (2008). In particular, networks of coupled stochastic excitable elements are commonly used as model systems for a wide range of natural phenomena, such as pattern formation in chemical reactions Kiss and Hudson (2003); Mikhailov and Ertl (2012), the dynamics of gene regulatory networks Farkas, Helbing, and Vicsek (2002); Borgatti et al. (2009); Newman (2002); Chen et al. (2015), the electrical activity of single London and Häusser (2005); Kinouchi and Copelli (2006); Gollo, Kinouchi, and Copelli (2013) neurons and large neuronal populations Bullmore and Sporns (2009).

Network topology strongly influences the collective dynamics of coupled excitable elements Boccaletti et al. (2006); Ocker et al. (2017a). For instance, coherent collective oscillations can emerge for certain coupling strengths or particular choices of network connectivity Lindner et al. (2004); Sagués, Sancho, and Garc´ıa-Ojalvo (2007). Furthermore, the emergent correlated activity of large recurrent neural networks can be linked to their connectivity Ocker et al. (2017b). The sensitivity of complex networks to external signals and the dynamic range of the network’s collective response can be maximized for the so-called critical networks Chialvo (2010), i.e being on the verge of a phase transition. This criticality can be achieved either by tuning the coupling strength and signal propagation parameters in the network Kinouchi and Copelli (2006); Gollo, Kinouchi, and Copelli (2013) or by tuning its topology Larremore, Shew, and Restrepo (2011).

The majority of works in this area are devoted to large networks with well-defined statistical properties such as degree distributions and spectra of the adjacency or Laplace matrices Newman (2002); Boccaletti et al. (2006); Arenas et al. (2008). Due to the large number of nodes and interconnections one can average over the network structure. Then, the emergent collective dynamics can be related the statistical properties of the network’s architecture Buice, Cowan, and Chow (2010); Ocker et al. (2017b, a). The situation is different when the collective dynamics of small random networks is studied. Although the network topology can be specified in terms of statistical properties, such as degree distributions, etc. , individual network realizations may differ significantly. In consequence, a detailed analysis of the relation between the collective dynamics and statistical properties of the network topology require studies of ensembles of networks realizations.

Refer to caption
Figure 1: Examples of connectivity of nodes of Ranvier in myelinated branching terminals of muscle spindle afferents (a–c) from Banks et al. (1997); Banks, Barker, and Stacey (1982) and of a touch receptor afferent (d) from Lesniak et al. (2014). Red semicircles represent heminodes (leaf nodes) which receive external inputs. Internal nodes of Ranvier are marked by blue circles; the green circle marks the root node.

In the present paper we focus on a class of small networks: small random trees of strongly-coupled stochastic excitable elements. Such networks serve as models for certain types of peripheral sensory neurons whose morphology includes tree-like branched myelinated distal terminals. Examples of such sensory neurons include cutaneous mechanoreceptors Lesniak et al. (2014); Marshall et al. (2016), pain receptors Besson (1999), mechanoreceptors in lungs (pulmonary afferents) Yu and Zhang (2004); Lee and Yu (2014), some electroreceptors Rogers, Neiman, and Russell (2013), and muscle spindles Quick, Kennedy, and Poppele (1980); Bewick and Banks (2015). Terminal branches of such neurons are wrapped by myeline which is interrupted at the nodes of Ranvier, located at branching points. Figure 1 exemplifies such networks for terminal branching of muscle spindle afferent neurons and for a touch receptor afferent. Starting from a primary node (green circle), branching continues for a few generations (2 – 5), terminating at leaves, called heminodes, at which myeline ends. Heminodes receive sensory inputs from thinner neurite processes. In response, the sensory neuron generates a sequence of action potentials. The number of nodes and heminodes, their connectivity and the size of terminals vary among individual neurons.

Due to the high density of voltage-gated Na+ ion channels at the heminodes, an action potential (AP) can be triggered at any heminode. Therefore, such neurons obey multiple stimulus encoding zones Quick, Kennedy, and Poppele (1980). Furthermore, despite the inevitable randomness of input signals to the individual spatially-separated terminal endings, these sensory neurons often exhibit pacemaker-like activity, characterized by noisy periodic spiking Banks et al. (1997). Several dynamic mechanisms were proposed in order to explain AP generation, the periodicity of firing, and the observed nonlinear responses of these neurons. Those mechanisms include random mixing Eagles and Purple (1974), nonlinear competition between multiple pacemakers, associated with heminodes Banks et al. (1997), and additional mechanical coupling between sensory receptors Carr, Gregory, and Proske (1998). In an alternative approach, the low resistance of myelinated segments, interconnecting the individual nodes of Ranvier, leads to strong coupling of their activity. In consequence, the stochastic firing of heminodes and nodes is synchronized and the whole branched terminal can be viewed as a single effective excitable system, which produces the corresponding firing statistics Kröller, Grüsser, and Weiss (1990). This proposal was supported by modeling studies using star Kromer, Schimansky-Geier, and Neiman (2016) and regular tree Kromer et al. (2017) networks of stochastic excitable elements. In particular, in Kromer et al. (2017), a strong-coupling theory was developed, allowing prediction of the firing rate and spike train variability of strongly coupled excitable elements.

Reconstructions of myelinated terminals of sensory neurons revealed that their tree structures varies among neurons Banks et al. (1997); Banks, Barker, and Stacey (1982); Lesniak et al. (2014), see Fig. 1. This gives rise to a description of those terminals using random tree networks as models. Within this paradigm the specific coupling structure in a single myelinated terminal is just one possible realization of a random branching process, which generates random tree networks with certain statistical properties. Those properties can, for instance, be specified by providing a branching probability mass function, which, back in the experimental setup, would characterize myelinated terminal of a certain kind of neuron. As terminals of individual neurons may differ significantly, this raises the question of how this structural variability affects the statistics of neuronal firing Lesniak et al. (2014).

The present paper is organized as follows. In Sec.II.1 we describe a model of Hodgkin-Huxley type excitable elements coupled on random tree network. The deterministic dynamics and measures of spike train variability for a tree network are described in Sec. II B,C. In Section II D we introduce a statistical description of random tree networks. The latter is then applied for particular examples of random binary trees in Sec.III A. Section III B and AppendixC are devoted to the strong coupling theory, which is applied to three examples of random trees in Sec.III C. We end with our conclusions in Sec. IV.

II Model and methods

In the present paper, we study the collective dynamics of excitable elements located at the branching points of random tree networks. Elements are interconnected by passive branches. This setup is illustrated in Fig. 1.

II.1 Hodgkin-Huxley type model

We assume that all nodes and passive links are identical, except for the leaf nodes, representing heminodes, which receive external inputs. Given a tree with 𝒩\mathcal{N} nodes, the dynamics of the nodes’ membrane potentials are approximated by a discrete cable model Ermentrout and Terman (2010) in which the membrane potential of the nnth node is governed by

CV˙n=Iion+κj=1𝒩An,j(VjVn)+𝒥n(t).C\dot{V}_{n}=-I_{\text{ion}}+\kappa\sum_{j=1}^{\mathcal{N}}A_{n,j}(V_{j}-V_{n})+\mathcal{J}_{n}(t). (1)

Here the index n=1,2,,𝒩n=1,2,...,\mathcal{N} marks the respective node. In particular, n=1n=1 refers to the root node. In Eq. (1) CC is the nodal membrane capacitance and the term IionI_{\text{ion}} represents the nodal ionic currents. In the following, we use a Hodgkin-Huxley type (HH) model for the ionic currents of nodes of Ranvier, which is a simplified version of the model used in McIntyre, Richardson, and Grill (2002). Ionic currents are represented by Na+ and leak currents, Iion=INa+ILI_{\text{ion}}=I_{\text{Na}}+I_{\text{L}}, Kromer, Schimansky-Geier, and Neiman (2016); Kromer et al. (2017). The Na+ current is INa=gNam3h(VVNa)I_{\text{Na}}=g_{\text{Na}}m^{3}h(V-V_{\text{Na}}), where gNa=1100g_{\text{Na}}=1100 mS/cm2 is the maximal value of the sodium conductance and VNa=50V_{\text{Na}}=50 mV is the Na+ reversal potential. The gating activation and inactivation variables obey the dynamics

m˙=αm(V)(1m)βm(V)m,h˙=αh(V)(1h)βh(V)h,\dot{m}=\alpha_{m}(V)(1-m)-\beta_{m}(V)m,\quad\dot{h}=\alpha_{h}(V)(1-h)-\beta_{h}(V)h, (2)

with the following rate functions:

αm(V)=1.314(V+20.4)/[1exp[(V+20.4)/10.3]],\displaystyle\alpha_{m}(V)=1.314(V+20.4)/[1-\exp[-(V+20.4)/10.3]], (3)
βm(V)=0.0608(V+25.7)/[1exp[(V+25.7)/11]],\displaystyle\beta_{m}(V)=-0.0608(V+25.7)/[1-\exp[(V+25.7)/11]], (4)
αh(V)=0.068(V+114)/[1exp[(V+114)/11]],\displaystyle\alpha_{h}(V)=-0.068(V+114)/[1-\exp[(V+114)/11]], (5)
βh(V)=2.52/[1+exp[(V+31.8)/13.4]].\displaystyle\beta_{h}(V)=2.52/[1+\exp[-(V+31.8)/13.4]].

The leak current is given by IL=gL(VVL)I_{\text{L}}=g_{\text{L}}(V-V_{\text{L}}) with gL=20g_{\text{L}}=20 mS/cm2, VL=80V_{\text{L}}=-80 mV, and the nodal capacitance is set to C=2C=2 μ\muF/cm2.

In Eq. (1) the coupling between nodes is described by κj=1NAn,j(VjVn)\kappa\sum_{j=1}^{N}A_{n,j}(V_{j}-V_{n}), where 𝐀\mathbf{A} is the adjacency matrix of the undirected rooted tree graph. It is a 𝒩×𝒩\mathcal{N}\times\mathcal{N} symmetric matrix with elements Ai,j=1A_{i,j}=1 for connected nodes ii and jj, and Ai,j=0A_{i,j}=0 for unconnected nodes, see Appendix A for more details. In the following the coupling strength, κ\kappa, is used as a control parameter. However, the physiologically-relevant values of κ\kappa can be estimated from the sizes of a node, the myelinated links, and the axoplasmic resistivity Ermentrout and Terman (2010), giving the range of \approx 125 – 1500 mS/cm2 Kromer, Schimansky-Geier, and Neiman (2016); Kromer et al. (2017). The external currents 𝒥n\mathcal{J}_{n} are applied to the leaves only and consist of a constant and a noisy part, i.e

𝒥n(t)=δn,l[J+2Sξl(t)],\mathcal{J}_{n}(t)=\delta_{n,l}[J+\sqrt{2S}\,\xi_{l}(t)], (6)

where ll denotes indices of leaf nodes; δn,l\delta_{n,l} is the Kronecker delta. The zero-mean Gaussian white noise ξl(t)\xi_{l}(t) with intensity SS is uncorrelated for different leaves, i.e. ξi(t)=0\langle\xi_{i}(t)\rangle=0, ξi(t)ξj(t+τ)=δi,jδ(τ)\langle\xi_{i}(t)\xi_{j}(t+\tau)\rangle=\delta_{i,j}\,\delta(\tau). Thus, leaf nodes receive random uncorrelated inputs. Other sources of noise, e.g. due to fluctuations of nodal ion channel conductances are neglected. In contrast to regular tree networks where inputs are administered only to nodes in the last generation of a tree Kromer et al. (2017), leaves can occur at any generation in random tree networks, see Fig. 1.

Eqs.(16) were integrated numerically using the explicit Euler - Maruyama method with time step of 0.10.1 μ\mus for 60 – 600  seconds long simulation runs.

II.2 Deterministic dynamics

We first discuss repetitive action potential generation at the root node for deterministic input currents, S=0S=0 in Eq. (6). Qualitatively different dynamical operation modes of the root node are separated by a threshold value, JthJ_{\text{th}}, of the constant current, JJ, applied to leaf nodes. While APs evoked at the leaf nodes do not fire up the root node for low currents, values of JJ exceeding JthJ_{\text{th}} result into sustained periodic firing of the root node. This is reminiscent of the dynamic behavior of a single isolated node. The latter is at resting state in the absence of external input, 𝒥=0\mathcal{J}=0. A sufficiently high constant current results in an Andronov-Hopf bifurcation of the equilibrium state rendering an isolated node to fire a periodic sequence of action potentials (APs). For a single node this Andronov-Hopf bifurcation occurs at JAH29.06μJ_{\text{AH}}\approx 29.06~\muA/cm2 Kromer et al. (2017).

As in Ref. Kromer et al. (2017), we numerically calculated the threshold current JthJ_{\text{th}}, which is the minimum constant current applied to the leaf nodes, which for a given coupling strength, results in the repetitive sustained generation of full-size APs (a voltage spike of at least 60 mV magnitude) at the root node. As for regular trees Kromer et al. (2017), the threshold current depends on the coupling strength, Jth(κ)J_{\text{th}}(\kappa), as exemplified in Fig. 2b.

Refer to caption
Figure 2: Sufficiently-strong input current to leaf nodes fires up the root node. (a): A sample tree with 𝒩=17\mathcal{N}=17 nodes. The =8\mathcal{H}=8 leaf nodes are marked by red semicircles. The root node is marked by the green circle. Star symbols point at ”recording” sites of voltage traces shown in Fig. 3b. The shown tree structure reproduces a reconstruction of an experimentally-observed muscle spindle afferent neuron presented in Ref. Banks, Barker, and Stacey (1982). (b): Threshold current, JthJ_{\text{th}}, for the onset of repetitive firing of the root node, as a function of the coupling strength, κ\kappa, for the tree shown in panel (a). The dashed horizontal line marks the theoretical estimate of the threshold current in the strong coupling limit, J=(𝒩/)JAH=61.75μJ_{\infty}=(\mathcal{N}/\mathcal{H})J_{\text{AH}}=61.75~\muA/cm2, see in Sec. III.2.

As the coupling strength increases, more input current is required to sustain firing of the root node. In consequence, the threshold current increases with κ\kappa and, finally, saturates at the limiting value J:=limκJth(κ)J_{\infty}:=\lim_{\kappa\to\infty}J_{\text{th}}(\kappa) for strong coupling. The strong coupling regime spans the range of physiologically realistic values, κ>100\kappa>100 mS/cm2, for branched myelinated terminals of sensory neurons Kromer, Schimansky-Geier, and Neiman (2016); Kromer et al. (2017).

For a given value of κ\kappa the root node shows a sustained sequence of APs, if values of the input current are above Jth(κ)J_{\text{th}}(\kappa), shown in Fig. 2b, and no APs if the value of 𝒥n\mathcal{J}_{n} is below that curve. These two regimes are referred to as oscillatory and excitable, respectively, in the following. Note that for weak coupling the dynamics of the tree can be quite complex, e.g. not every AP generated at leaf nodes may propagate all the way to the root node. Such regimes will be studied elsewhere.

For strong enough coupling and sufficient input current, all nodes in the tree are synchronized and fire periodic sequences of APs. As in the case of regular trees, the limiting value of the threshold current for strong coupling, JJ_{\infty}, matches the threshold value of the current of an effective single node with parameters re-scaled by the ratio of the number of inputs (leaf nodes) and the total number of nodes as, J=(𝒩/)JAHJ_{\infty}=(\mathcal{N}/\mathcal{H})J_{\text{AH}}, see dashed line in Fig. 2b. This value is derived in Sec. III.2 and Appendix C.

II.3 Spike train statistics

In the presence of noise, the AP generation becomes stochastic. We are particularly interested in statistical properties of spike trains generated at the root node. We extracted a sequence of spike times of the root node, {ti}\{t_{i}\}, from 6060060-600 s long simulation runs. The sequence of interspike intervals (ISIs), τi=ti+1ti\tau_{i}=t_{i+1}-t_{i}, is characterized by the firing rate, rr, and by the coefficient of variation (CV), 𝒞τ\mathcal{C}_{\tau},

r=(τ¯)1,στ2=τ2¯(τ¯)2,𝒞τ=rστ,r=\left(\overline{\tau}\right)^{-1},\quad\sigma^{2}_{\tau}=\overline{\tau^{2}}-(\overline{\tau})^{2},\quad\mathcal{C}_{\tau}=r\sigma_{\tau}, (7)

where τ¯\overline{\tau} and στ\sigma_{\tau} are the mean and the SD of the sequence of ISIs, respectively. The bar stands for the averaging over all ISIs in the spike train of the root node. The CV quantifies the ISI variability.

Refer to caption
Figure 3: Stochastic dynamics of excitable elements coupled on the tree network shown in Fig. 2a. (a): Time traces of the membrane potentials of two leaf nodes and the root marked by stars in Fig. 2a, for the indicated coupling strengths. (b,c): Firing rate, rr, and coefficient of variation, 𝒞τ\mathcal{C}_{\tau} for spike trains generated at the root node as a function of coupling strength. Dashed lines in panels (b) and (c) refer to theoretical estimates of the firing rate and CV in the strong coupling limit. The parameters of input currents to leaves are: J=50J=50 μ\muA/cm2, S=500S=500 (μ\muA/cm2)2ms.

Figure 3 exemplifies the stochastic firing dynamics for the tree shown in Fig. 2a. The constant current was chosen such that the tree is in the excitable regime for κ>20\kappa>20 mS/cm2. As in regular trees Kromer et al. (2017), the firing rate, r(κ)r(\kappa), depends non-monotonously on the coupling strength. For weak coupling, spikes generated at the leaves often fail to propagate to the root, leading to its sparse firing, Fig. 3a. This results in low values of the firing rate and large values of the CV. Furthermore, the root and leaf nodes fire asynchronously. Increasing the coupling strength leads to stronger interaction between nodes. In consequence, synchronous coherent firing with large firing rates and small CVs emerges, see middle panel of Fig. 3a. As the coupling increases, more input current is required to sustain the network firing, see Fig. 2b. Consequently, for constant input current the firing rate decrease again. Competition of these two tendencies results in a maximum of the root node firing rate as a function of the coupling strength. For strong coupling, nodal firing is perfectly synchronized, see rightmost traces in Fig. 3a, and the firing rate and the CV saturate at their limiting values, indicated by dashed lines in Fig. 3b,c. In Sec. III.2 we show that in the case of strong coupling, a tree can be well represented by its root node which receives effective input with rescaled constant current and noise intensity.

II.4 Statistical description of random trees networks

An ensemble of random trees can be constructed as a set of realizations of a stochastic branching process Drmota (2009). In this paradigm, the tree shown in Fig. 2a is just one possible realization of a random tree network. Each network realization causes certain statistical properties of its root node’s firing characteristics, such as those depicted in Fig. 3.

In each realization, branching starts at the root and continues up to a prescribed maximal number of generations, GG, or until all branches end in leaf nodes. Each node in a certain generation gg is located at the same path distance, gg, from the root. The latter defines the generation g=0g=0. Furthermore, each node in the gg-th generation, g<Gg<G, is a parent to a random number of offspring in the (g+1)(g+1)-st generation. However, each child node has only one parent.

The kk-th realization of a tree network consists of several generations each containing a random number of nodes, 𝒟g,k\mathcal{D}_{g,k}, which we model by using the Galton-Watson process Harris (2002),

𝒟g+1,k=igen.gdg,i,k,g=0,1,,G1,𝒟0,k=1.\mathcal{D}_{g+1,k}=\sum_{i\in\text{gen.}g}d_{g,i,k},\quad g=0,1,...,G-1,\quad\mathcal{D}_{0,k}=1. (8)

Here gg indicates the generation and k=1,2,k=1,2,\ldots indicates a particular realization of a tree network. The sum runs over all nodes in generation gg. The number of offspring, dg,i,kd_{g,i,k}, of a certain parent node ii in generation gg is an independent random variable generated from the probability mass function (PMF), pg(d)p_{g}(d). In the following sections, we will consider several examples of branching PMFs.

We consider basic properties of a single tree network realization, first. The total number of nodes 𝒩k\mathcal{N}_{k} of a tree network realization kk is a random variable and obtained by summing 𝒟g,k\mathcal{D}_{g,k} over all generations,

𝒩k=g=0G𝒟g,k=g=0𝒢k𝒟g,k,\mathcal{N}_{k}=\sum_{g=0}^{G}\mathcal{D}_{g,k}=\sum_{g=0}^{\mathcal{G}_{k}}\mathcal{D}_{g,k}, (9)

where 𝒢kG\mathcal{G}_{k}\leq G is the height of the tree and is given by the actual number of generations in the current tree network realization. Thus, there might be no nodes in the outer generations for particular realizations of the Galton-Watson process, Eq. (8). The number of leaf nodes in a particular generation gg is also a random variable given by

hg,k=igen.gδdg,i,k,0.h_{g,k}=\sum_{i\in\text{gen.}g}\delta_{d_{g,i,k},0}. (10)

By construction, branching terminates at the maximum generation GG and all nodes in that generation are leaf nodes. In general, however, leaf nodes can be found in any but the 0-th generation. Thus, a node ii in generation 0<gG0<g\leq G becomes a leaf node with probability pg(0)p_{g}(0), i.e. if dg,i,k=0d_{g,i,k}=0. The total number of leaf nodes, k\mathcal{H}_{k}, is a random variable, obtained by summing hg,kh_{g,k} over all generations, i.e.

k=g=1Ghg,k.\mathcal{H}_{k}=\sum_{g=1}^{G}h_{g,k}. (11)

In the special case of no extinction, i.e. if pg(0)=0p_{g}(0)=0 for 0g<G0\leq g<G, all leaf nodes are in the peripheral generation, g=𝒢k=Gg=\mathcal{G}_{k}=G and k=𝒟G,k\mathcal{H}_{k}=\mathcal{D}_{G,k}.

Next, given the branching PMF, pg(d)p_{g}(d), and the maximum allowed number of generations, GG, some statistical properties of random trees formed by the Galton-Watson process, such as the mean number of total nodes and leaves, their variances, etc. can be determined by the standard method of probability generating functions Harris (2002); Drmota (2009); Newman (2010). In the present paper, we are mainly interested in the influences of structural variability, as arising from different tree network realizations for the same branching PMF, on the firing statistics of the root node. We characterize that statistics for a single tree network realization kk by calculating the firing rate, rk(J,S,κ)r_{k}(J,S,\kappa), and the CV, 𝒞k(J,S,κ)\mathcal{C}_{k}(J,S,\kappa) according to Eqs. (7). Note that these quantities depend not only on the network realization with the particular coupling structure, but also on input current, i.e. JJ and SS, and the coupling strength κ\kappa.

The variability of a certain quantity QkQ_{k}, of the kk-th tree realization, can be assessed by calculating its ensemble average mean and standard deviation (SD):

Q=limK1Kk=1KQk,σQ2=limK1Kk=1KQk2Q2.\langle Q\rangle=\lim_{K\to\infty}\frac{1}{K}\sum_{k=1}^{K}Q_{k},\quad\sigma^{2}_{Q}=\lim_{K\to\infty}\frac{1}{K}\sum_{k=1}^{K}Q^{2}_{k}-\langle Q\rangle^{2}. (12)

This yields the ensemble averaged firing rate r(J,S,κ)\langle r(J,S,\kappa)\rangle and its normalized standard deviation:

𝒞r(J,S,κ)=σr(J,S,κ)r(J,S,κ).\mathcal{C}_{r}(J,S,\kappa)=\frac{\sigma_{r}(J,S,\kappa)}{\langle r(J,S,\kappa)\rangle}. (13)

The latter provides a measure of variability for the root nodes’ firing rates resulting from tree network realizations from the same branching PMF with respective input currents and coupling strengths.

By defining sets of identical or isomorphic trees in an ensemble, averaging can be performed using the probability distribution of sets of identical trees. Denoting the set of parameters, which uniquely defines trees by {Tk}\{T_{k}\}, the kk-th realization of the quantity QQ is denoted as Qk:=Q({Tk})Q_{k}:=Q(\{T_{k}\}). Its average can be formally written as, Q={T}Q({T})P({T})\langle Q\rangle=\sum_{\{T\}}Q(\{T\})\,P(\{T\}), where P({T})P(\{T\}) is the PMF of non-identical trees and the summation run over all possible values of the parameters set, {T}\{T\}. Various levels of coarse-graining methods can be used to simplify the ensemble averaging.

In the present paper we restrict to identical nodes and interconnections except for the external input, which is only applied to leaf nodes. As a first way of coarse-graining, we consider trees with the same number of nodes and leaf nodes in each generation as identical. We get (2G1)(2G-1)-tuple {Tk}=(𝒟1,k,,𝒟G,k,h1,k,,hG1,k)=({Dk},{hk})\{T_{k}\}=(\mathcal{D}_{1,k},...,\mathcal{D}_{G,k},h_{1,k},...,h_{G-1,k})=(\{D_{k}\},\{h_{k}\}). We note that trees with identical tuples ({Dk},{hk})(\{D_{k}\},\{h_{k}\}) may still possess different connectivities. The ensemble of trees is then characterized by the joint (2G1)(2G-1)-dimensional PMF of number of the nodes and leaves in all generations, P2G1(𝒟1,,𝒟G;h1,,hG1)P2G1({𝒟},{h})P_{2G-1}(\mathcal{D}_{1},...,\mathcal{D}_{G};h_{1},...,h_{G-1})\equiv P_{2G-1}(\{\mathcal{D}\},\{h\}). The tree-ensemble averages, Eqs. (12), are then approximated by

Q(J,S,κ){𝒟},{h}Q(J,S,κ,{𝒟},{h})P2G1({𝒟},{h}),\displaystyle\langle Q(J,S,\kappa)\rangle\approx\sum_{\{\mathcal{D}\},\{h\}}Q(J,S,\kappa,\{\mathcal{D}\},\{h\})P_{2G-1}(\{\mathcal{D}\},\{h\}),
σQ2(J,S,κ){𝒟},{h}Q2(J,S,κ,{𝒟},{h})P2G1({𝒟},{h})Q(J,S,κ)2,\displaystyle\sigma^{2}_{Q}(J,S,\kappa)\approx\sum_{\{\mathcal{D}\},\{h\}}Q^{2}(J,S,\kappa,\{\mathcal{D}\},\{h\})P_{2G-1}(\{\mathcal{D}\},\{h\})-\langle Q(J,S,\kappa)\rangle^{2}, (14)

where the summations run over all possible values of 𝒟1,,𝒟G\mathcal{D}_{1},...,\mathcal{D}_{G} and h1,,hG1h_{1},...,h_{G-1}. As a second way of coarse-graining, we consider trees with the same total number of nodes and leaf nodes as identical. As we will show in Sec. III.2, this simplification yields sufficient results in the strong-coupling limit κ\kappa\rightarrow\infty. We parameterize a particular realization of tree network by the tuples (k,𝒩k)(\mathcal{H}_{k},\mathcal{N}_{k}) and then carry out averaging similar to Eq. (14), but with 2-dimensional PMF of the total number of leaves and nodes, P2(,𝒩)P_{2}(\mathcal{H},\mathcal{N}).

Throughout the paper we focus on small trees, 2<G42<G\leq 4, with branching supported on a bounded interval. This is consistent with the topology of branched myelinated terminals of sensory neurons Banks, Barker, and Stacey (1982); Banks et al. (1997); Lesniak et al. (2014); Marshall et al. (2016). For such trees the number of configurations with distinct tuples ({𝒟},{h})(\{\mathcal{D}\},\{h\}) in the same ensemble, is rather small. In particular, for binary trees this enables us to list all non-identical trees in the ensemble and calculate the corresponding joint PMF. Furthermore, dynamical measures, such as the firing rate and CV, can be calculated numerically for the complete small set of trees. Thus, the structure-induced variability of these measures can be calculated according to Eq. (14).

III Results

We use small binary trees for illustration. However, our approach is applicable to any random tree network, generated by the Galton-Watson process, as we demonstrate at the end of this section.

III.1 Statistics of binary random trees

In binary trees each node has at most two offspring. Here we consider two types of binary trees: full and non-full binary trees. The so-called full binary tree, is a tree in which every internal node has two offspring and leaves have none. In contrast, in non-full binary trees, which we term as general binary trees, the number of offspring of any internal node can be either one or two.

III.1.1 Full binary trees

To avoid a large number of short trees in the ensemble, we allow extinction only after 22-nd generation. In consequence, the smallest tree possesses two generations, each with branching two. In our particular example branching after the 22-nd generation is characterize by the PMF:

pg(d)={δd,2,0<g2p0δd,0+(1p0)δd,2,2<g<G,δd,0,g=G.\displaystyle p_{g}(d)=\begin{cases}\delta_{d,2},&0<g\leq 2\\ p_{0}\delta_{d,0}+(1-p_{0})\delta_{d,2},&2<g<G,\\ \delta_{d,0},&g=G.\end{cases} (15)

The resulting ensemble is parameterized by two quantities: the probability of zero branching, p0p_{0}, and the maximum number of generations, GG. For such trees the numbers of nodes in the first two generations are fixed, 𝒟1=2\mathcal{D}_{1}=2, 𝒟2=4\mathcal{D}_{2}=4, while the numbers of nodes in higher generations are random variables ranging from 0 to 2g2^{g}, for g>2g>2.

The limit p00p_{0}\to 0 corresponds to a tree with 𝒩=2G+11\mathcal{N}=2^{G+1}-1 nodes and =2G\mathcal{H}=2^{G} leaf nodes, located in shell GG. In the opposite limit, p01p_{0}\to 1, trees are extinct after the 22-nd generation, resulting in a tree with the total number of nodes and leaf nodes 𝒩=7\mathcal{N}=7 and =4\mathcal{H}=4, respectively.

Refer to caption
Figure 4: Tree networks for all 2525 possible configurations of 22-tuples of (𝒟3,𝒟4)(\mathcal{D}_{3},\mathcal{D}_{4}) resulting for the branching PMF given by Eq. (15) for G=4G=4. Leaves are marked red, the root node is marked green and internal nodes are depicted as blue circles. Trees are arranged in columns with the same total number of leaves and nodes, (,𝒩)(\mathcal{H},\mathcal{N}), shown on the bottom. The ratio of the total number of nodes to leaves, 𝒩/\mathcal{N}/\mathcal{H}, increases from left to right, from 1.75 to 1.9375 respectively.

In the following, we consider a particular ensemble of full binary trees with at most G=4G=4 generations. While the numbers of nodes in 11-st and 22-nd generation are fixed, the number of nodes in 33rd and 44th generation are random integers. The latter take even values in the intervals 0𝒟380\leq\mathcal{D}_{3}\leq 8 and 0𝒟4160\leq\mathcal{D}_{4}\leq 16. Furthermore, the numbers of leaf nodes in the 22nd and 33rd generation are determined by the number of nodes in those shells as, h2=4𝒟3/2h_{2}=4-\mathcal{D}_{3}/2 and h3=𝒟3𝒟4/2h_{3}=\mathcal{D}_{3}-\mathcal{D}_{4}/2 Drmota (2009). In consequence, trees with the same numbers of nodes in the third and fours generation can be considered as identical. This leads to 2525 unique 22-tuples of (𝒟3,𝒟4)(\mathcal{D}_{3},\mathcal{D}_{4}), or equivalently to 2525 distinct trees in the ensemble, shown in Fig. 4. The joint PMF, P2(𝒟3,𝒟4)P_{2}(\mathcal{D}_{3},\mathcal{D}_{4}), describing this ensemble, is given by (see Appendix B)

P2(𝒟3,𝒟4)=(4n3)(2n3n4)p04+n3n4(1p0)n3+n4,\displaystyle P_{2}(\mathcal{D}_{3},\mathcal{D}_{4})=\displaystyle\binom{4}{n_{3}}\displaystyle\binom{2n_{3}}{n_{4}}p_{0}^{4+n_{3}-n_{4}}(1-p_{0})^{n_{3}+n_{4}}, (16)
𝒟3=2n3,𝒟4=2n4,n3=0,1,..,4,n4=0,1,,8.\displaystyle\mathcal{D}_{3}=2n_{3},\quad\mathcal{D}_{4}=2n_{4},\quad n_{3}=0,1,..,4,\quad n_{4}=0,1,...,8.

This two-dimensional joint PMF is shown in Fig. 5a.

Refer to caption
Figure 5: Node statistics of full binary trees with the branching PMF given by Eq. (15) with p0=0.5p_{0}=0.5 and G=4G=4. (a): The joint probability mass function of numbers of nodes in 33rd and 44th generation, P2(𝒟3,𝒟4P_{2}(\mathcal{D}_{3},\mathcal{D}_{4}). All 2525 connectivity states are shown by filled circles. Probabilities for realizing the respective trees are indicated by circle diameter and color. (b): The PMF of respective combinations of total number of leaf nodes and nodes given by Eq. (17).

Of particular interest is the statistics of the total number of nodes and leaf nodes. As we show in Sec. III.2, both are used to derive approximations for certain measures of spike train statistics of the root node in the strong coupling limit. The number of distinct tuples, (k,𝒩k)(\mathcal{H}_{k},\mathcal{N}_{k}), i.e. the number of trees with identical total numbers of leaves and nodes, is smaller than the number of trees with identical (𝒟3,𝒟4)(\mathcal{D}_{3},\mathcal{D}_{4}) tuples, as trees with different numbers of nodes in certain generations may possess the same total number nodes and leaves. This is illustrated for the example of full binary tree ensemble in Fig. 4. As illustrated in the figure for G=4G=4, the number of distinct tuples (k,𝒩k)(\mathcal{H}_{k},\mathcal{N}_{k}) is 1313 and thereby smaller than the total of 2525 distinct trees in the ensemble. Furthermore, for the considered example of full binary trees, the number of leaves is exclusively determined by the number of nodes as =4+(𝒩7)/2\mathcal{H}=4+(\mathcal{N}-7)/2. Therefore, the statistics of the total number of nodes and leaves is characterized by the one-dimensional PMF of the total number of nodes, P1(𝒩)P_{1}(\mathcal{N}) (see Appendix B),

P1(𝒩)=[n3=04n4=02n3δn3+n4,m(4n3)(2n3n4)p04+n3n4](1p0)m,m=(𝒩7)/2.P_{1}(\mathcal{N})=\displaystyle\left[\sum_{n_{3}=0}^{4}\sum_{n_{4}=0}^{2n_{3}}\delta_{n_{3}+n_{4},m}\displaystyle\binom{4}{n_{3}}\binom{2n_{3}}{n_{4}}p_{0}^{4+n_{3}-n_{4}}\right](1-p_{0})^{m},\quad m=(\mathcal{N}-7)/2. (17)

The PMF P1(𝒩)P_{1}(\mathcal{N}) is depicted in Fig. 5b.

III.1.2 General binary trees

In general binary trees, each node has either zero, one, or two offspring. In our particular example, general binary trees are generated from the following branching PMF:

pg(d)={12(δd,1+δd,2),0g<1,p0δd,0+1p02(δd,1+δd,2),1g<G,δd,0,g=G.\displaystyle p_{g}(d)=\begin{cases}\displaystyle\frac{1}{2}\left(\delta_{d,1}+\delta_{d,2}\right),&0\leq g<1,\\ \displaystyle p_{0}\delta_{d,0}+\frac{1-p_{0}}{2}\left(\delta_{d,1}+\delta_{d,2}\right),&1\leq g<G,\\ \delta_{d,0},&g=G.\end{cases} (18)

The root node may have either one or two offspring with equal probability. Other nodes may have either zero offspring, with probability p0p_{0}, or either one or two offspring, each with probability (1p0)/2(1-p_{0})/2. As in the case of full binary trees, an ensemble of general binary trees is parametrized by the probability of zero branching, p0p_{0}, and by the maximal number of generations, GG. In full binary trees, the number of nodes in each generation is an even number. In contrast, for general binary trees with the branching PMF (18) both odd and even number of nodes allowed. Compared to full binary trees, this leads to a larger number of trees with distinct tuples ({𝒟},{h})(\{\mathcal{D}\},\{h\}).

In order to reduce computational costs, we consider trees with the branching PMF (18) and set G=3G=3. The resulting network ensemble possesses 5050 trees with distinct sequences of numbers of nodes and leaves, {𝒟1,𝒟2,𝒟3,h1,h2}\{\mathcal{D}_{1},\mathcal{D}_{2},\mathcal{D}_{3},h_{1},h_{2}\}. It is characterized by a 55-dimensional joint PMF, P5(𝒟1,𝒟2,𝒟3;h1,h2)P_{5}(\mathcal{D}_{1},\mathcal{D}_{2},\mathcal{D}_{3};h_{1},h_{2}), which we calculated numerically for various values of the zero-branching probability p0p_{0}. Figure 6a shows a small sample of possible tree realizations. The limit p0=0p_{0}=0 corresponds to non-extinct binary trees, i.e. all leaf nodes are located in the 33rd generation. The opposite limit, p0=1p_{0}=1, results in only two possible configurations with a total number of either 22 or 33 nodes (one or two leaf nodes, respectively).

In contrast to full binary trees, where the total number of nodes uniquely determines the total number of leaf nodes, general binary trees allow for several distinct configurations with the same total number of leaf nodes, but different total numbers of nodes. For the considered case of G=3G=3 and p00p_{0}\neq 0, the PMF given in Eq. (18) leads to 2828 distinct tuples (,𝒩)(\mathcal{H},\mathcal{N}), whose PMF function is illustrated in Fig. 6b. It shows the multiplicity of possible total numbers of nodes for the same total number of leaf nodes.

Refer to caption
Figure 6: Realizations and statistics for general binary trees with the branching PMF (18) and maximal allowed number of generation, G=3G=3. (a): A sample of 1212 different realizations of general binary trees. (b): The PMF of the total number of nodes and leaves, P2(,𝒩)P_{2}(\mathcal{H},\mathcal{N}); 2828 possible trees with distinct total numbers of nodes and leaves are shown by filled circles, whose diameter and color represent probability values.

III.2 Strong coupling approximation

In the physiologically-relevant case of strong coupling, the stochastic firing of all nodes is synchronized. In the synchronized state, the dynamics of individual tree network realizations, Eqs. (16), can be approximated by that of an effective single node (see Appendix C):

CV˙k=Iion[Vk,mk,hk]+𝒥eff,k(t).\displaystyle C\dot{V}_{k}=-I_{\text{ion}}[V_{k},m_{k},h_{k}]+\mathcal{J}_{\text{eff},k}(t). (19)

Here Vk(t)V_{k}(t) is the effective membrane potential and 𝒥eff,k(t)\mathcal{J}_{\text{eff},k}(t) is the effective stochastic input current. The index kk refers to the actual tree realization. The latter encodes the tree structure. The nodal ionic current, Iion[Vk,mk,hk]I_{\text{ion}}[V_{k},m_{k},h_{k}], and the gating variables, mkm_{k} and hkh_{k}, are given by the same equations as for the network model in Sec. II.1. Equations for 𝒥eff,k(t)\mathcal{J}_{\text{eff},k}(t) for regular trees were derived in Kromer et al. (2017). In Appendix C, we extend their approach to random trees and obtain,

𝒥eff,k(t)=Jeff,k+2Seff,kξ(t)=,kJ+2S𝒮,kξ(t),\displaystyle\mathcal{J}_{\text{eff},k}(t)=J_{\text{eff},k}+\sqrt{2S_{\text{eff},k}}\,\xi(t)=\mathcal{R}_{\infty,k}\,J+\sqrt{2S\mathcal{S}_{\infty,k}}\,\xi(t),
,k=k𝒩k,𝒮,k=k𝒩k2.\displaystyle\mathcal{R}_{\infty,k}=\frac{\mathcal{H}_{k}}{\mathcal{N}_{k}},\quad\mathcal{S}_{\infty,k}=\frac{\mathcal{H}_{k}}{\mathcal{N}^{2}_{k}}. (20)

Here JJ and SS are the constant current and the noise intensity, respectively. Both specify the strengths of the noisy input current applied to the leaves in the actual tree realization; ξ(t)\xi(t) is Gaussian white noise.

In the following, we use Eqs. (19) and (III.2) as an approximation for the dynamics of the root node, i.e. vk(t)V1,k(t)v_{k}(t)\approx V_{1,k}(t), in the strong coupling limit. Thus, we replace the ensemble of trees by an ensemble of their effective root nodes. The respective total numbers of nodes and leaves, (k,𝒩k)(\mathcal{H}_{k},\mathcal{N}_{k}), in the individual tree realization determine the effective current, kJ\mathcal{R}_{k}J, and noise intensity, S𝒮kS\mathcal{S}_{k}, in Eq. (III.2).

III.2.1 Spike train statistics of tree realizations

The strong-coupling theory allows for several important predictions. In the strong coupling limit, the dynamics of tree nodes is determined by the total numbers of leaves and nodes, {k,𝒩k}\{\mathcal{H}_{k},\mathcal{N}_{k}\}, only. In consequence, it does not depend on the particular configurations with unique sequences of numbers of nodes in shells, {𝒟1,k,,𝒟G,k}\{\mathcal{D}_{1,k},...,\mathcal{D}_{G,k}\}, on particular locations of leaves within shells, {h1,k,,hG,k}\{h_{1,k},...,h_{G,k}\}, as well as on nodal connectivity. Thus a set of distinct trees with identical total numbers of nodes and leaves, would show identical dynamics in the strong-coupling limit.

In the deterministic case, S=0S=0, inputs to leaf nodes larger than the threshold current of a tree realization result in a sustained repetitive firing of the root node. From Eq. (III.2), we find for the threshold current

J,k=,k1JAH,J_{\infty,k}=\mathcal{R}^{-1}_{\infty,k}J_{\text{AH}}, (21)

where JAHJ_{\text{AH}} is the threshold current of a single isolated node.

In the stochastic case, the firing statistics of the whole ensemble of trees can be predicted by evaluating the effective currents and noise intensities for all possible tuples (k,𝒩k)(\mathcal{H}_{k},\mathcal{N}_{k}). For a single effective node, the firing rate, r~(Jeff,Seff)\widetilde{r}(J_{\text{eff}},S_{\text{eff}}), and the CV, 𝒞~τ(Jeff,Seff)\widetilde{\mathcal{C}}_{\tau}(J_{\text{eff}},S_{\text{eff}}), solely depend on these effective parameters. For a certain tree realization, k, in the strong-coupling limit this yields,

r(J,S,κ,{𝒟k},{hk})r~(Jeff,k,Seff,k),\displaystyle r(J,S,\kappa,\{\mathcal{D}_{k}\},\{h_{k}\})\approx\widetilde{r}(J_{\text{eff},k},S_{\text{eff},k}),
𝒞τ(J,S,κ,{𝒟k},{hk})𝒞~τ(Jeff,k,Seff,k),\displaystyle\mathcal{C}_{\tau}(J,S,\kappa,\{\mathcal{D}_{k}\},\{h_{k}\})\approx\widetilde{\mathcal{C}}_{\tau}(J_{\text{eff},k},S_{\text{eff},k}), (22)

where the tilde symbol indicates the firing rate and the CV of the effective node. This relation is illustrated in Fig. 7. The figure shows a heat map of r~(Jeff,Seff)\widetilde{r}(J_{\text{eff}},S_{\text{eff}}), where symbols mark combinations of effective parameters that can actually be realized in the presented tree network ensembles.

Refer to caption
Figure 7: Heat map of the firing rate of a single HH node vs input current and noise intensity, r~(Jeff,Seff)\widetilde{r}(J_{\text{eff}},S_{\text{eff}}). Symbols mark combinations of Jeff,kJ_{\text{eff},k} and Seff,kS_{\text{eff},k} (III.2) of realizations of binary trees for the indicated ensembles. The magenta symbols (circles and squares) represent all possible full binary trees with branching PMF (15) and G=4G=4. Black star symbols mark all possible general binary trees with branching PMF (18) and G=3G=3. Parameters: S=500S=500 (μ\muA/cm2)2ms; J=38.5J=38.5 μ\muA/cm2 (unfilled stars and circles) and J=70J=70 μ\muA/cm2 (filled stars and squares).

III.2.2 Spike train statistics of tree ensembles

As follows from the previous subsection, the ensemble-averaged dynamics and its variability can be predicted from the dynamics of a single isolated node, see Eq. (19III.2.1), and statistics of the total numbers of nodes and leaves. This enables us to derive strong-coupling approximations for ensemble-averaged quantities such as the root node’s firing rate. As the effective parameters in Eq. (19) solely depend on the total number of nodes and leaf nodes, ensemble averaging in Eq. (14) can equivalently be performed using the two-dimensional joint PMF of total number of nodes and leaf nodes, P2(,𝒩)P_{2}(\mathcal{H},\mathcal{N}). Then, the ensemble averages of the firing rates and CV can be calculated by using the 22-dimensional PMF, P2(𝒩,)P_{2}(\mathcal{N},\mathcal{H}), in Eqs. (14) as described in section II.4 before. As we restrict on finite ranges of possible branching, it is also possible to determine bounds of corresponding quantities, such as maximal and minimal firing rates and CVs of the ISI sequence.

III.3 Onset of repetitive spiking

The randomness of tree ensembles may lead to qualitatively different dynamics of individual network realizations. In the present section we consider its consequence for the threshold current setting the onset of repetitive spiking of the tree’s root node in the case of deterministic input currents, i.e S=0S=0.

We numerically calculate the threshold current as a function of coupling strength for each of 2525 distinct full binary trees depicted in Fig. 4. This results in one curve for each tree network realization, each one similar to the curve shown in Fig. 2b. Besides its dependence on the coupling strength κ\kappa, the threshold current for a single tree network realization, Jth,kJ_{\text{th},k}, is also a function of the number of nodes in the 33-rd and 44-th generation, i.e. Jth,k=Jth(κ,𝒟3,k,𝒟4,k)J_{\text{th},k}=J_{\text{th}}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k}). It can be expressed in units of JAHJ_{\text{AH}} by introducing the dimensionless scaling factor 1(κ,𝒟3,k,𝒟4,k)\mathcal{R}^{-1}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k}), i.e. Jth,k=Jth(κ,𝒟3,k,𝒟4,k)=1(κ,𝒟3,k,𝒟4,k)JAHJ_{\text{th},k}=J_{\text{th}}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k})=\mathcal{R}^{-1}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k})J_{\text{AH}}. At J=JAHJ=J_{\text{AH}} a single isolated node enters the repetitive spiking regime by undergoing an Andronov Hopf bifurcation. We will refer to 1(κ,𝒟3,k,𝒟4,k)\mathcal{R}^{-1}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k}) as the normalized threshold current in the following. For strong coupling the threshold current of a single tree network realization approaches its limiting value, J,k(,𝒩)J_{\infty,k}(\mathcal{H},\mathcal{N}), given by Eq. (21). The latter depends only on the total number of nodes and leaf nodes, i.e. J(,𝒩)=1(k,𝒩k)JAH=(𝒩k/k)JAHJ_{\infty}(\mathcal{H},\mathcal{N})=\mathcal{R}^{-1}_{\infty}(\mathcal{H}_{k},\mathcal{N}_{k})J_{\text{AH}}=(\mathcal{N}_{k}/\mathcal{H}_{k})J_{\text{AH}}. Here limκ(κ,𝒟3,k,𝒟4,k)=(k,𝒩k)=k/𝒩k\lim_{\kappa\to\infty}\mathcal{R}(\kappa,\mathcal{D}_{3,k},\mathcal{D}_{4,k})=\mathcal{R}_{\infty}(\mathcal{H}_{k},\mathcal{N}_{k})=\mathcal{H}_{k}/\mathcal{N}_{k}.

Refer to caption
Figure 8: Normalized threshold current, 1(κ,{𝒟k},{hk})=Jth(κ,{𝒟k},{hk})/JAH\mathcal{R}^{-1}(\kappa,\{\mathcal{D}_{k}\},\{h_{k}\})=J_{\text{th}}(\kappa,\{\mathcal{D}_{k}\},\{h_{k}\})/J_{\text{AH}}, as a function of coupling strength κ\kappa for two tree network ensembles. (a) curves for all 2525 full binary trees of Fig. 4, (b) same for 5050 general binary trees with all possible numbers of nodes and leaf nodes, with maximal number of generations, G=3G=3. Curves are color-coded according to the tree’s normalized threshold currents in the strong coupling limit, R,k1=𝒩k/kR^{-1}_{\infty,k}=\mathcal{N}_{k}/\mathcal{H}_{k}. Dashed horizontal lines show the value of the applied constant current, J=38.5J=38.5 μ\muA/cm2, used for stochastic simulations in Fig. 9. (c,d): Normalized threshold current for κ=1000\kappa=1000 mS/cm2 versus its theoretical strong-coupling limit, R,k1=𝒩k/kR^{-1}_{\infty,k}=\mathcal{N}_{k}/\mathcal{H}_{k} for full (c) and general (d) binary trees.

Normalized threshold currents are shown in Fig. 8(a,b). We find that it increases monotonically with the coupling strengths and finally saturates for strong coupling. For weak coupling, the actual tree structure matters as it determines the paths action potentials have to travel in order to excite the root node. Here trees with various configurations, but identical numbers of leaves and nodes, fall into tight clusters around distinct values of 1\mathcal{R}^{-1}. With the increase of coupling the clusters blur. For general binary trees, Fig. 8(b), the range of threshold currents is significantly larger than for full binary trees, Fig. 8(a). Finally, for strong coupling curves for individual sample trees saturate. Their limiting values are well approximated by the theoretically predicted strong coupling limit J,k=(𝒩k/k)JAHJ_{\infty,k}=(\mathcal{N}_{k}/\mathcal{H}_{k})J_{\text{AH}}, as illustrated in Fig. 8(c,d).

These results indicate that for weak and moderate coupling the onset of spike generation may be strongly affected by the particular tree structure. However, for physiologically relevant coupling strengths, κ>100\kappa>100 mS/cm2, threshold currents are close to their strong-coupling limits and their values mainly depend on the statistics of the total number of nodes and leaf nodes.

III.4 Stochastic dynamics

For stochastic input currents, i.e. S>0S>0, variability in tree structures interacts with variability caused by stochastic inputs. In order to study the stochastic dynamics we prepare ensembles of excitable trees, i.e. no spike generation at the root node if the input current had no stochastic component. To this end, we set the value of the constant input current such that it is below the sample trees’ threshold currents for strong coupling, but causes non-vanishing firing rates, >2>2 Hz, of all possible tree realizations. For the two types of binary trees, used in the previous section, this is achieved by using a constant input current of J=38.5μJ=38.5~\muA/cm2. This corresponds to the normalized threshold current, 1=1.325\mathcal{R}^{-1}=1.325, shown by the dashed lines in Fig. 8a,b. For the coupling strengths, κ>30\kappa>30 mS/cm2, all curves of the threshold current in Fig. 8a,b lie above the dashed lines, indicating that all trees are indeed excitable.

Then, we simulated Eqs.(16) for all possible non-identical tree network realizations and estimated the firing rate and CV of their root nodes, r(κ,{𝒟},{h})r(\kappa,\{\mathcal{D}\},\{h\}) and 𝒞τ(κ,{𝒟},{h})\mathcal{C}_{\tau}(\kappa,\{\mathcal{D}\},\{h\}), respectively.

Refer to caption
Figure 9: Spike train statistics of ensembles of excitable trees. The upper panels (a,b,c) show results for all 2525 full binary trees of Fig. 4; the lower panels (d,e,f) refer to 5050 general binary trees with at most G=3G=3 generations and with all possible numbers of nodes and leaf nodes. Trees’ firing rates (a,d) and CVs (b,e) as functions of coupling strength. Lines are color-coded according to the scaling factor, ,k=k/𝒩k\mathcal{R}_{\infty,k}=\mathcal{H}_{k}/\mathcal{N}_{k}, for the strong coupling limit; dashed horizontal lines show lower and upper limits of corresponding quantities, obtained from the strong-coupling approximation. (c,f): Firing rate as a function of the CV for κ=1000\kappa=1000 mS/cm2 for simulated trees (crosses) and for single root nodes (circles) with input current rescaled according to (III.2). The parameters for numerical simulations are: J=38.5J=38.5 μ\muA/cm2, S=500S=500 (μ\muA/cm2)2ms.

The obtained measures of spike train statistics are shown in Fig. 9. For individual tree realizations, theses measures show qualitatively similar a dependences on the coupling strength. In more detail, we find that firing rates become maximal at intermediate coupling strengths for both full and general binary trees. CVs attain their minimum values at similar coupling strengths. This indicates most regular firing of the root node at intermediate coupling strengths. Note that this is in qualitative agreement with previous results on regular tree networks presented in Kromer et al. (2017).

Considering the spike train statistics of the entire tree ensemble, we find that structural variability hardly affects firing rates and CVs for weak coupling. In contrast, firing rates and CVs of individual tree realizations strongly differ for physiologically relevant strong coupling. For such coupling, the spike train statistics of individual tree realizations are well-approximated by those of single isolated nodes with effective currents and noise intensities given by Eq. (III.2). This is further illustrated in Fig. 9(c,f), where the ISIs statistics of root nodes of tree realizations is compared to those of effective isolated nodes according to the strong-coupling approximation.

Importantly, the strong-coupling approximation also allows for the prediction of lower and upper bounds of the firing rates and CVs, shown by the dashed lines in Fig. 9a–d. The scaling parameters ,k\mathcal{R}_{\infty,k} and 𝒮,k\mathcal{S}_{\infty,k} of the effective current in Eq. (III.2) define the range of the trees’ firing rates and CVs at strong coupling, see Fig. 7. In that sense, they provide bounds for the influence of structural variability on the spike train statistics of the root node. Since all tree realizations are excitable for strong coupling, the highest values of scaling parameters ,k\mathcal{R}_{\infty,k} yield the highest firing rate and lowest CV. In contrast, small values of ,k\mathcal{R}_{\infty,k} yield low effective currents, Eq.(III.2), and drive the network deep into the excitable regime. This causes Poisson-like statistics of spike generation resulting in low firing rates and CVs close to one.

Refer to caption
Figure 10: Ensemble-averaged ISI statistics as function of coupling strength for the indicated values of the zero-branching probability. (a,b): Ensemble averaged firing rate, r\langle r\rangle, and CV 𝒞τ\langle\mathcal{C}_{\tau}\rangle for full binary tress with G=4G=4; (c,d): r\langle r\rangle and 𝒞τ\langle\mathcal{C}_{\tau}\rangle for general binary trees with G=3G=3. Dashed lines show predictions of the strong-coupling theory, obtained by ensemble averaging of corresponding values for isolated single nodes with the effective current and noise intensity according to Eq. (III.2). Parameters: J=38.5J=38.5 μ\muA/cm2, S=500S=500 (μ\muA/cm2)2ms.

Next we consider the ensemble-averaged ISI statistics. It is obtained by averaging the firing rates and CVs according to Eq.(14). Averaging is simplified for the full binary trees, as the joint PMF, Eq. (16), for G=4G=4 depends only on the numbers of nodes in the 33-rd and 44-th generations. For the general binary trees with G=3G=3 the ensemble averaging is performed using the 55-dimensional joint PMF, P5(𝒟1,𝒟2,𝒟3;h1,h2)P_{5}(\mathcal{D}_{1},\mathcal{D}_{2},\mathcal{D}_{3};h_{1},h_{2}) which we estimated numerically. Ensemble-averaged measures of spike train statistics are shown in Fig. 10 for different values of the zero-branching probability p0p_{0}. The ensemble-averaged firing rates and CVs follow curves that are qualitatively similar to those for individual trees. However, p0p_{0} strongly affects the ensemble-averaged statistics in the strong coupling regime. Low probabilities cause on average taller sample trees with smaller fractions of leaf nodes. In consequence, the effective current and noise intensity in Eq. (III.2) become smaller, which drives the network deep into the excitable regime, and results in low firing rates and large CVs. Larger values of p0p_{0}, refer to an increased fraction of short trees with larger fractions of leaves, which receive inputs. The latter results in higher firing rates and smaller CVs.

Refer to caption
Figure 11: Variability of the firing rate due to structural variability. Upper and lower panels show the ensemble averaged firing rate, r\langle r\rangle, and its normalized SD, 𝒞r\mathcal{C}_{r}, (14, 13) as a function of the probability of zero branching, p0p_{0}, for the full binary trees and for general binary trees, respectively. Solid lines show results of direct simulations of trees; dashed blue lines show prediction of the strong-coupling theory. Other parameters are the same as in Fig. 10.

In order to quantify the influence of structural variability on the firing statistics of root nodes, we consider the normalized standard deviation, 𝒞r\mathcal{C}_{r}, of the distribution of firing rates, see Eq. (13). We find that firing rate distributions of general binary trees show larger variability than those for full binary trees. Besides the previously noticed fact that the structural variability is most pronounced for strong coupling, we find a maximum of the 𝒞r\mathcal{C}_{r} for a finite value of zero-branching probability. For full binary trees the number of possible distinct trees approaches one for p00p_{0}\rightarrow 0, i.e. only the regular tree with branching two, and p01p_{0}\rightarrow 1, i.e. only the regular tree with the minimal number of generations. The pronounced maximum of 𝒞r\mathcal{C}_{r} expresses the trade-off between trees becoming more regular as p0p_{0} approaches either one of those limits. In general binary trees, however, the limit p00p_{0}\rightarrow 0 still results in an ensemble of 17 possible trees with distinct pairs of number of nodes and leaf nodes, as all combinations of branching one and two are possible. Consequently, the normalized SD at p0=0p_{0}=0 remains finite.

Refer to caption
Figure 12: Normalized standard deviation of the distribution of root nodes firing rates, 𝒞r=𝒞r(p0,J)\mathcal{C}_{r}=\mathcal{C}_{r}(p_{0},J), among ensembles of full (a) and general (b) binary tries as a function of the constant input current to leaf nodes and the zero-branching probability for the strong-coupling limit. Other parameters are the same as in Fig. 10.

The variability of the root node’s firing rates indeed depends on the input current to the leaves. For strong coupling a particular coupling structure is imprinted in the scaling of input current according to Eq.(III.2), and so the spread of effective input currents for trees in the ensemble translates into the spread of their firing rates. This can be seen in Fig.7 by comparing locations of tree realizations for two values of input currents to leaves. For J=38.5μJ=38.5~\muA/cm2, all tree realizations are in the excitable regime and their positions in the heat map cut across a wide range of firing rates. For J=70μJ=70~\muA/cm2, however, most tree realizations are in oscillatory regime, cutting across a narrower range of firing rates. A decrease of the input current shifts trees to the left in Fig. 7, i.e. deeper to the excitable regime. The increase of JJ moves trees to the right and trees become oscillatory. As a result, the ensemble variability of firing rate is high for small input currents and low for large currents. These results are summarized in Fig. 12, which shows the dependence of the normalized SD of firing rate, 𝒞r\mathcal{C}_{r}, on the input current and the zero-branching probability for the strong-coupling limit. Except for small input currents, J<30μJ<30~\muA/cm2, the firing rate variability of general binary trees is larger than that of full binary trees, as they cut across wider ranges of scaling factors of input current in Eq. (III.2).

III.5 Non-binary trees

We finally consider an example of random non-binary trees. In this example, random branching is drawn from a uniform distribution with at most 44 offspring for each node, and trees with at most G=4G=4 generations are allowed. To avoid short trees we set the zero branching probability to zero, pg(d)=0p_{g}(d)=0, for generations g=0,1,2g=0,1,2, as in the example of full binary trees. Thus, the branching PMF is given by

pg(d)={14i=14δd,i,0<g2,15i=04δd,i,2<g<4,δd,0,g=4.\displaystyle p_{g}(d)=\begin{cases}\displaystyle\frac{1}{4}\sum^{4}_{i=1}\delta_{d,i},&0<g\leq 2,\\ \displaystyle\frac{1}{5}\sum^{4}_{i=0}\delta_{d,i},&2<g<4,\\ \delta_{d,0},&g=4.\end{cases} (23)

The PMF in Eq. (23) yields a large number of non-identical trees, i.e. trees that differ in the their numbers of nodes and leaf nodes per generation. Figure 13a exemplifies 33 non-identical tree network realizations obtained from the PMF. Instead of counting distinct trees and calculating their corresponding probabilities, we analyzed tree network ensembles obtained from the PM using a brute-force approach. We generated an ensemble of 20002000 tree network realizations and then proceeded with the analyses of collective dynamics of coupled HH nodes as in previous sections.

For deterministic inputs, the threshold current as a function of coupling strength possesses a similar shape as those for binary trees (data not shown). This included the strong coupling regime, where threshold currents approached the value predicted by the strong coupling theory, J,k=(𝒩k/k)JAHJ_{\infty,k}=(\mathcal{N}_{k}/\mathcal{H}_{k})J_{\text{AH}}.

Refer to caption
Figure 13: Firing rate statistics of non-binary random trees with uniform branching according to the PMF Eq. (23). (a) Three examples of tree networks; pairs of total number of nodes and leaf nodes are: (49,70) for the upper panel, (4,10) for the lower left, and (24,40) for the lower right panel, respectively. (b) Heat map of the firing rate of a single HH node as a function of input current and noise intensity, r~(Jeff,Seff)\widetilde{r}(J_{\text{eff}},S_{\text{eff}}). Symbols mark combinations of effective parameters, Jeff,kJ_{\text{eff},k} and Seff,kS_{\text{eff},k} in Eq.(III.2), for the ensemble of 20002000 network realizations. (c) Probability distributions of the firing rate of the root nodes for the indicated values of coupling strengths. For strong coupling, κ=1000\kappa=1000 mS/cm2, solid and dashed lines compare direct simulations of trees realizations and simulations of effective single nodes, respectively.

We then set the constant input current at J=38.5J=38.5 μ\muA/cm2, for which all network realizations resulted in excitable trees for coupling κ>100\kappa>100 mS/cm2. Firing statistics of root nodes of the 20002000 tree realizations showed qualitatively similar dependences on the coupling strength as for binary trees of Fig. 9 (not shown). As for binary trees, structural variability of the firing rate of non-binary trees is small for weak and intermediate coupling and large for strong coupling. This is illustrated in Fig. 13c, by the probability distribution of the firing rate of root nodes. The latter broadens as the coupling strength increases.

As for binary trees, the firing statistics of non-binary tree network realizations can be predicted using the strong-coupling theory of Sec.III.2. In order to compare the firing rate statistics obtained from simulations for the 20002000 tree network realizations with that resulting from the strong coupling approximation, we first calculate the pairs of effective current and noise intensity for each tree realization using Eq. (III.2). The locations of those pairs in the current noise intensity space is shown in Fig. 13b. The figure also shows a heat map of the firing rate of a single node r~\tilde{r} as a function of current and noise intensity. Then, using Eq. (III.2.1) we obtain an approximate of the firing rate for each pair of effective currents, i.e. for each tree network realization. The resulting distribution of firing rate approximates (single) is compared to the root nodes’ firing rates for different coupling strengths as obtained from simulations of network activity in Fig. 13c.

IV Conclusion

We studied the influence of network structure on the root node’s spike train statistics in random tree networks of excitable elements in which only the leaf nodes receive stochastic inputs. This setup was motivated by the morphology of certain sensory neurons which possess branched myelinated terminals with excitable nodes of Ranvier at the branch points. Myelination ends at the so-called heminodes, representing leaves of a tree, receive sensory inputs. As inputs excite heminodes, action potentials synchronously jump over myelinated branches and ultimately fire up the root node.

Branched myelinated terminals can be represented by small random tree networks which differ in height (number of generations), numbers of nodes and heminodes, as well as nodal connectivity Banks, Barker, and Stacey (1982); Banks et al. (1997); Marshall et al. (2016); Walsh, Bautista, and Lumpkin (2015). Thus, the resulting spike train variability may be sensitive to the network structure.

We developed a probabilistic framework to study the collective response of stochastic excitable elements coupled on random trees whose structure is generated by Galton-Watson random branching processes. We investigated the variability of the spike train statistics resulting from variations of network structure within a tree ensemble. We have shown that in the physiologically relevant strong coupling regime the firing statistics of the root node is determined by the number of nodes and leaf nodes, while being hardly affected by a particular nodal connectivity. Thus, trees in the ensemble can be distinguished by the total number of nodes and leaf nodes, which simplifies the calculation of the ensemble averages significantly. Furthermore, the collective response of the tree network can be predicted from a single node with an effective input, rescaled according to the number of nodes and leaf nodes. Given a joint probability distribution of the total number of nodes and leaf nodes, this allows for the calculation of the ensemble averaged firing rate and coefficient of variation as well as for setting lower and upper bounds of firing rate statistics.

Using two types of binary random trees and an example of random trees with a uniform branching we found that structural variability, resulting from different realizations of the network connectivity, strongly affects the root node’s spike train statistics for strong coupling. In particular, ensembles of realizations of excitable tree networks show a wide range of firing rates and coefficients of variations, consistent with experimental findings on touch receptors Wellnitz et al. (2010); Lesniak et al. (2014).

While we considered uniform inputs to heminodes (leaf nodes), an additional level of randomness can be introduced by non-uniform random inputs to heminodes, as in Lesniak et al. (2014). This would lead to additional variability across tree realizations. Interestingly, recent work yielded experimental evidence for structural plasticity of Merkel cell touch receptor complexes in healthy skin Marshall et al. (2016). The study documented that the number of heminodes of a touch receptor afferent adjusts to the inputs from Merkel cells, which varies over a time span of several days. In our framework such an afferent remodeling corresponds to the variation of inputs, accompanied by structural changes of corresponding tree network. Strong-coupling approximation then can be used for prediction of neuronal responses during remodeling cycles.



Acknowledgements
The authors thank W. Just for his valuable comments and suggestions and D.F. Russell for discussions which inspired this work. AKN and ABN acknowledge support by the Neuroscience Program and by Quantitative Biology Institute at Ohio University. LSG thanks Ohio University for hospitality and support.

Appendix A Construction of Adjacency matrix

The adjacency matrix was used in numerical simulations of coupled nodes, Eqs. (1-6). Throughout the appendices we drop the index kk referring to a particular tree network realization. In order to construct a single tree network realization, we generate a sequence of random numbers, {dg}\{d_{g}\}, according to the branching PMF, pg(d)p_{g}(d). Then, the numbers of nodes in each generation, 𝒟0,𝒟1,,𝒟G\mathcal{D}_{0},\mathcal{D}_{1},\ldots,\mathcal{D}_{G} are calculated from Eq. (8). The total number of nodes (9) yields the dimensions of the symmetric adjacency matrix, 𝐀\mathbf{A}.

To construct the adjacency matrix, nodes in a tree are indexed by jj, starting from the root node j=1j=1 in the 0-th generation and then proceeding with the nodes’ offspring. The number of nodes until generation gg, g\mathcal{M}_{g}, is given by

g=i=0g𝒟i,g=0,,G.\displaystyle\mathcal{M}_{g}=\sum_{i=0}^{g}\mathcal{D}_{i},\quad g=0,\ldots,G.

In the first generation, the d0,1d_{0,1} nodes are indexed as j=2,,1j=2,...,\mathcal{M}_{1}; nodes in the second generation are indexed in the order of their parent nodes, i.e. j=1+1,1+2,,1+d1,2j=\mathcal{M}_{1}+1,\mathcal{M}_{1}+2,...,\mathcal{M}_{1}+d_{1,2} for d1,2d_{1,2} offspring of node j=2j=2 in generation g=1g=1 and so on. This is illustrated in Fig. 14(a). Thus, node indexes run from j=1j=1 to j=G=𝒩j=\mathcal{M}_{G}=\mathcal{N}.

Refer to caption
Figure 14: Example of a random tree network with G=4G=4 (a) and corresponding adjacency matrix (b), constructed following Eqs. (24,25).

As the full adjacency matrix follows from symmetry, we restrict our description to the upper triangular matrix 𝐀up\mathbf{A}^{\text{up}}. Its first row contains all connections to the root node:

Aj,1up=A1,j={1,j=2,,1,0,else.\displaystyle A^{\text{up}}_{j,1}=A_{1,j}=\begin{cases}1,\quad j=2,\ldots,\mathcal{M}_{1},\\ 0,\quad\text{else}.\end{cases} (24)

Interconnections between a node jj in generation gg and its offspring in generation g+1g+1 result in a sequences of ones of lengths dg,jd_{g,j} in the jjth row of AupA^{\text{up}}, where dg,jd_{g,j} is the number of offspring of jjth node, which is part of generation gg. In more detail,

Aj,iup={1,i=(l+1),j=(g+1),.,(g+dg,l+1)1,i=(l+2),j=(g+1+dg,l+1),,(g+dg,l+1+dg,l+2)1,i=(l+𝒟g)=g,j=(g+1+b=1𝒟g1dg,l+b),,(g+b=1𝒟gdg,l+b=g+1)0,else,1g𝒢1,\displaystyle A^{\text{up}}_{j,i}=\begin{cases}1,\quad i=(\mathit{l}+1),~~~~~~~~~~~~~\quad j=(\mathcal{M}_{g}+1),\ldots\ldots\ldots.,(\mathcal{M}_{g}+d_{g,\mathit{l}+1})\\ 1,\quad i=(\mathit{l}+2),~~~~~~~~~~~~~\quad j=(\mathcal{M}_{g}+1+d_{g,\mathit{l}+1}),\ldots,(\mathcal{M}_{g}+d_{g,\mathit{l}+1}+d_{g,\mathit{l}+2})\\ \quad\vdots~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\vdots\\ 1,\quad i=(\mathit{l}+\mathcal{D}_{g})=\mathcal{M}_{g},~\quad j=\big{(}\mathcal{M}_{g}+1+\displaystyle\sum_{b=1}^{\mathcal{D}_{g}-1}d_{g,\mathit{l}+b}\big{)},\ldots,\big{(}\mathcal{M}_{g}+\sum_{b=1}^{\mathcal{D}_{g}}d_{g,\mathit{l}+b}=\mathcal{M}_{g+1}\big{)}\\ 0,\quad\text{else}\end{cases},1\leq g\leq\mathcal{G}-1,
(25)

where l=g1\mathit{l}=\mathcal{M}_{g-1}. Finally, the full adjacency matrix follows from symmetry.

Appendix B Probability mass function of numbers of nodes and leaves for full binary trees

For full binary trees with a maximum of G=4G=4 generations and branching PMF (15) the joint PMF of the number of nodes and leaf nodes in 3rd and 4th generations, P2(𝒟3,𝒟4,h2,h3)=P2(𝒟3,𝒟4)P_{2}(\mathcal{D}_{3},\mathcal{D}_{4},h_{2},h_{3})=P_{2}(\mathcal{D}_{3},\mathcal{D}_{4}) is

P2(𝒟3,𝒟4)=𝒫(𝒟3)×𝒫(𝒟4|𝒟3),\displaystyle P_{2}(\mathcal{D}_{3},\mathcal{D}_{4})=\mathcal{P}(\mathcal{D}_{3})\times\mathcal{P}(\mathcal{D}_{4}|\mathcal{D}_{3}), (26)

where 𝒫(𝒟3)\mathcal{P}(\mathcal{D}_{3}) is given by the binomial distribution

𝒫(𝒟3=2n3)=(𝒟2n3)p0𝒟2n3(1p0)n3,\displaystyle\mathcal{P}(\mathcal{D}_{3}=2n_{3})={\mathcal{D}_{2}\choose n_{3}}p_{0}^{\mathcal{D}_{2}-n_{3}}(1-p_{0})^{n_{3}}, (27)

with integer values n3=0,1,..,𝒟2n_{3}=0,1,..,\mathcal{D}_{2}, specifying the number of parent nodes in generation g=2g=2. Accordingly, for given 𝒟3\mathcal{D}_{3}, we find

𝒫(𝒟4=2n4|𝒟3)=(𝒟3n4)p0𝒟3n4(1p0)n4.\displaystyle\mathcal{P}(\mathcal{D}_{4}=2n_{4}|\mathcal{D}_{3})={\mathcal{D}_{3}\choose n_{4}}p_{0}^{\mathcal{D}_{3}-n_{4}}(1-p_{0})^{n_{4}}. (28)

Here n4=0,1,..,𝒟3n_{4}=0,1,..,\mathcal{D}_{3} is the number of parent nodes in the 33rd generation. Applying Eq. (26) this yields Eq. (16).

For the full binary tree considered in the main text, we find =4+(𝒩7)/2\mathcal{H}=4+(\mathcal{N}-7)/2. In consequence, the joint PMF of the total number of leaf nodes and nodes is determined by the PMF of the total number of nodes, P1(𝒩)P_{1}(\mathcal{N}). The latter can be obtained by summing Eq. (16) such that, 𝒟3+𝒟4=𝒩7\mathcal{D}_{3}+\mathcal{D}_{4}=\mathcal{N}-7, or, equivalently, n3+n4=(𝒩7)/2n_{3}+n_{4}=(\mathcal{N}-7)/2. This yields Eq. (17).

Appendix C Dynamics in the strong coupling limit

In the strong coupling limit, each of the network realizations approaches a synchronized state. Its dynamics can be treated as that of a single node given by Eq. (19). In the following, we derive the effective parameters, see Eq. (III.2), which account for the influence of network structure on the dynamics in the strong coupling limit. In order to simplify the notations, we skip the index referring to the considered network realization.

For the derivation, we follow the approach presented in Kromer et al. (2017). We first consider the coupling term in Eq. (1). Instead of using the adjacency matrix, (see Appendix A), we can rewrite the coupling term as a sum over interconnections between adjacent nodes:

CVj˙\displaystyle C\dot{V_{j}} =\displaystyle= Iion,j+𝒥j(t)+κigen. gj1Aj,i(ViVj)+κmgen. gj+1Aj,m(VmVj)\displaystyle-I_{\text{ion},j}+\mathcal{J}_{j}(t)+\kappa\sum_{i\in\text{gen. }g_{j}-1}A_{j,i}\left(V_{i}-V_{j}\right)+\kappa\sum_{m\in\text{gen. }g_{j}+1}A_{j,m}\left(V_{m}-V_{j}\right) (29)
=\displaystyle= Iion,j+𝒥j(t)+κ(1δgj,0)(VmjVj)+κojoffspring ofj(VojVj).\displaystyle-I_{\text{ion},j}+\mathcal{J}_{j}(t)+\kappa(1-\delta_{g_{j},0})\left(V_{m_{j}}-V_{j}\right)+\kappa\sum_{{o_{j}}\in\,{\text{offspring of}\,j}}\left(V_{o_{j}}-V_{j}\right). (30)

Here gjg_{j} denotes the generation of node jj. In the first line, the sums run over all nodes in adjacent generations. In the second line, only nodes that are connected to node jj are considered, i.e. its only parent node, mjm_{j}, in generation gj1g_{j}-1 and all offspring in generation gj+1g_{j}+1. The term with the Kronecker delta accounts for the fact that the root node has no parent. Note that the relation between nodes, their offspring, and their parent nodes implies that k=ojj=mkk=o_{j}\iff j=m_{k}.

Refer to caption
Figure 15: Illustration of notations for the voltage differences, ΔVj,mj\Delta V_{j,m_{j}}, ΔVoj,j\Delta V_{o_{j},j}, and ΔVooj,oj\Delta V_{oo_{j},o_{j}} for a tree fragment. Therein oj(g+1)o_{j}\in(g+1) labels the node under consideration; the node with the index jgj\in g is the parent of ojo_{j}. The node with the index oj(g+1)o_{j}\in(g+1) is the offspring of jj and is the parent of the node ooj(g+2)oo_{j}\in(g+2). Red semicircles show leaves at which branching is terminated.

As only the differences in membrane potentials between nodes and their offspring enter Eq. (29), we introduce these differences as new variables

ΔVoj,j:=VojVj.\displaystyle\Delta V_{o_{j},j}:=V_{o_{j}}-V_{j}. (31)

Voltage difference and the corresponding notation is illustrated in Fig. 15. Applying this to Eq. (29), we obtain

CVj˙=Iion,j+𝒥j(t)κ(1δgj,0)ΔVj,mj+κojoffspirng of jΔVoj,j.\displaystyle C\dot{V_{j}}=-I_{\text{ion},j}+\mathcal{J}_{j}(t)-\kappa(1-\delta_{g_{j},0})\Delta V_{j,m_{j}}+\kappa\sum_{o_{j}\in\text{offspirng of }\,j}\Delta V_{o_{j},j}. (32)

From this, we can derive the dynamics of the voltage differences by subtraction of the two equations for VojV_{o_{j}} and VjV_{j}:

CddtΔVoj,j\displaystyle C\frac{{\rm d}}{{\rm d}t}\Delta{V}_{{o_{j}},j} =\displaystyle= Iion,oj+Iion,j+𝒥oj(t)𝒥j(t)+κ(1δgj,0)ΔVj,mj\displaystyle-I_{\text{ion},o_{j}}+I_{\text{ion},j}+\mathcal{J}_{o_{j}}(t)-\mathcal{J}_{j}(t)+\kappa(1-\delta_{g_{j},0})\Delta V_{j,\,m_{j}} (33)
κ(ΔVoj,j+ojoffspring of jΔVoj,j)+κoojoffspring of ojΔVooj,oj\displaystyle-\kappa\left(\Delta V_{{o_{j}},j}+\sum_{o_{j}^{\prime}\in\text{offspring of }\,j}\Delta V_{o_{j}^{\prime},j}\right)+\kappa\sum_{oo_{j}^{\prime}\in\text{offspring of }\,o_{j}}\Delta V_{oo_{j}^{\prime},o_{j}}

C.1 Generation-averaged dynamics

In the strong coupling limit, the nodal dynamics is synchronized and nodes within the same generation become statistically indistinguishable. To make use of this fact, we follow the approach presented by Kouvaris et al. Kouvaris et al. (2014) and extend it to stochastic excitable elements on random tree networks. To this end, we consider the dynamics of the generation-averaged membrane potentials

Vg:=1𝒟gjgen.gVj,g=0,1,2,,𝒢.\displaystyle\left\langle V\right\rangle_{g}:=\frac{1}{\mathcal{D}_{g}}\sum\limits_{j\,\in\,\text{gen.}g}V_{j},~~~~g=0,1,2,\ldots,\mathcal{G}. (34)

Here the average is taken in each generation g<𝒢g<\mathcal{G} of the kkth random tree network realization (the realization index kk is dropped), i.e. only generation that actually include nodes are considered.

Applying Eq. (34), to Eq. (29), we obtain the generation-averaged membrane potential dynamics

CddtVg=Iiong+𝒥(t)gκVg+κ1𝒟gjgen.gVmj+κ1𝒟gjgen.gojoffspring of j(VojVj).C\frac{{\rm d}}{{\rm d}t}\left\langle V\right\rangle_{g}=-\left\langle I_{\text{ion}}\right\rangle_{g}+\left\langle\mathcal{J}(t)\right\rangle_{g}-\kappa\left\langle V\right\rangle_{g}+\kappa\frac{1}{\mathcal{D}_{g}}\sum_{j\in\text{gen.}g}V_{m_{j}}+\kappa\frac{1}{\mathcal{D}_{g}}\sum_{j\in\text{gen.}g}\,\,\sum_{o_{j}\in\text{offspring of }\,j}\left(V_{o_{j}}-V_{j}\right). (35)

Note that averaging over the zeroth generation yields V0=V1\left\langle V\right\rangle_{0}=V_{1}. As the first sum on the right-hand side of Eq. (35) runs over the 𝒟g\mathcal{D}_{g} offspring which share 𝒟g1\mathcal{D}_{g-1} parent nodes, we find

1𝒟gjgen. gVmj=𝒟g1𝒟g1𝒟g1igen. g1dg1,iVi=𝒟g1𝒟gdVg1.\frac{1}{\mathcal{D}_{g}}\sum_{j\in\text{gen. }g}V_{m_{j}}=\frac{\mathcal{D}_{g-1}}{\mathcal{D}_{g}}\frac{1}{\mathcal{D}_{g-1}}\sum_{i\in\text{gen. }g-1}d_{g-1,i}\,V_{i}=\frac{\mathcal{D}_{g-1}}{\mathcal{D}_{g}}\left\langle d\,V\right\rangle_{g-1}. (36)

Accordingly, the double sum in (35) can be simplified by noting that the jjth node in generation gg has dg,jd_{g,j} offspring in generation g+1g+1,

1𝒟gjgen. gojoffspring of jVj=1𝒟gjgen. gdg,jVj=dVg.\frac{1}{\mathcal{D}_{g}}\,\sum_{j\in\text{gen. }g}\,\sum_{o_{j}\in\text{offspring of }\,j}\,V_{j}\,=\,\frac{1}{\mathcal{D}_{g}}\sum_{j\in\text{gen. }g}d_{g,j}V_{j}=\left\langle d\,V\right\rangle_{g}. (37)

The other double sum can be reduced to a single sum over the nodes in the (g+1)(g+1)th generation

1𝒟gjgojgen. g+1Voj=1𝒟gojgen. g+1Voj.\frac{1}{\mathcal{D}_{g}}\sum_{j\in g}\,\,\sum_{o_{j}\in\text{gen. }g+1}V_{o_{j}}\,=\,\frac{1}{\mathcal{D}_{g}}\sum_{o_{j}\in\text{gen. }g+1}V_{o_{j}}.

This can be further simplified by considering the generation average membrane potential,

1𝒟gojg+1Voj=𝒟g+1𝒟g1𝒟g+1ojg+1Voj=𝒟g+1𝒟gVg+1.\frac{1}{\mathcal{D}_{g}}\sum_{o_{j}\in g+1}V_{o_{j}}\,=\,\frac{\mathcal{D}_{g+1}}{\mathcal{D}_{g}}\,\frac{1}{\mathcal{D}_{g+1}}\,\sum_{o_{j}\in g+1}V_{o_{j}}=\,\frac{\mathcal{D}_{g+1}}{\mathcal{D}_{g}}\,\left\langle V\right\rangle_{g+1}. (38)

From the recurrent relation of the Galton-Watson process (8) it follows that the ratios of numbers of nodes in adjacent generations can be replaced by the mean branching within a generation as 𝒟g+1/𝒟g=dg\mathcal{D}_{g+1}/\mathcal{D}_{g}=\left\langle d\right\rangle_{g}. Then using Eqs.(3638) in Eq. (35) yields

CddtVg=Iiong+𝒥(t)gκ(Vg1dg1dVg1)+κ(dgVg+1dVg).C\frac{{\rm d}}{{\rm d}t}\left\langle V\right\rangle_{g}=-\left\langle I_{\text{ion}}\right\rangle_{g}+\left\langle\mathcal{J}(t)\right\rangle_{g}-\kappa\left(\left\langle V\right\rangle_{g}\,-\,\frac{1}{\left\langle d\right\rangle_{g-1}}\left\langle d\,V\right\rangle_{g-1}\right)\,+\,\kappa\left(\left\langle d\right\rangle_{g}\,\left\langle V\right\rangle_{g+1}\,-\,\left\langle d\,V\right\rangle_{g}\right). (39)

In the limit of strong coupling, we can assume that ViVg,iV_{i}\approx\left\langle V\right\rangle_{g,i} for ii in generation gig_{i}. Then, we can decouple the branching from the generation average, i.e. dVgdgVg\left\langle d\,V\right\rangle_{g}\approx\left\langle d\right\rangle_{g}\,\left\langle V\right\rangle_{g}. Performing similar simplification for the root node, g=0g=0 and the nodes in the last generation g=Gg=G, we end up with the following system for the generation-averaged membrane potentials

CddtV0\displaystyle C\frac{{\rm d}}{{\rm d}t}\left\langle V\right\rangle_{0}\, =\displaystyle= Iion0+𝒥(t)0+κd0,1(V1V0),\displaystyle\,-\left\langle I_{\text{ion}}\right\rangle_{0}+\left\langle\mathcal{J}(t)\right\rangle_{0}\,+\,\kappa\ d_{0,1}\left(\,\left\langle V\right\rangle_{1}\,-\,\left\langle V\right\rangle_{0}\right)\,,
CddtVg\displaystyle C\frac{{\rm d}}{{\rm d}t}\left\langle V\right\rangle_{g} =\displaystyle= Iiong+𝒥(t)gκ(VgVg1)+κdg(Vg+1Vg),g=1,,𝒢1,\displaystyle-\left\langle I_{\text{ion}}\right\rangle_{g}+\left\langle\mathcal{J}(t)\right\rangle_{g}-\kappa\left(\left\langle V\right\rangle_{g}\,-\,\left\langle V\right\rangle_{g-1}\right)\,+\,\kappa\left\langle d\right\rangle_{g}\,\left(\left\langle V\right\rangle_{g+1}\,-\,\left\langle V\right\rangle_{g}\right)\,,\,\,\,g=1,\ldots,\mathcal{G}-1,
CddtV𝒢\displaystyle C\frac{{\rm d}}{{\rm d}t}\left\langle V\right\rangle_{\mathcal{G}}\, =\displaystyle= Iion𝒢+𝒥(t)𝒢+κ(V𝒢1V𝒢).\displaystyle\,-\left\langle I_{\text{ion}}\right\rangle_{\mathcal{G}}+\left\langle\mathcal{J}(t)\right\rangle_{\mathcal{G}}+\kappa\left(\left\langle V\right\rangle_{\mathcal{G}-1}\,-\,\left\langle V\right\rangle_{\mathcal{G}}\right). (40)

C.2 Dynamics of generation-averaged membrane potential differences

Next we introduce the differences between generation-averaged membrane potentials from adjacent generations, ΔVg:=Vg+1Vg\Delta\left\langle V\right\rangle_{g}:=\left\langle V\right\rangle_{g+1}-\left\langle V\right\rangle_{g}, g=0,1,,𝒢1g=0,1,\ldots,\mathcal{G}-1. Subtraction of the corresponding equations in (C.1) yields

CddtΔVg\displaystyle C\frac{d}{dt}\left\langle\Delta V\right\rangle_{g} =\displaystyle= ΔIiong+Δ𝒥(t)g+\displaystyle-\Delta\left\langle I_{\text{ion}}\right\rangle_{g}+\Delta\left\langle\mathcal{J}(t)\right\rangle_{g}+
+\displaystyle+ {κ(d0+1)ΔV0+κd1ΔV2,g=0,κΔVg1κ(dg+1)ΔVg+κdg+1ΔVg+1,1g<𝒢1,κΔV𝒢2d𝒢1ΔV𝒢1,g=𝒢1,\displaystyle\begin{cases}-\kappa\,(\left\langle d\right\rangle_{0}+1)\Delta\left\langle V\right\rangle_{0}+\kappa\left\langle d\right\rangle_{1}\Delta\left\langle V\right\rangle_{2},&g=0,\\ &\\ \kappa\Delta\left\langle V\right\rangle_{g-1}-\kappa\left(\left\langle d\right\rangle_{g}+1\right)\Delta\left\langle V\right\rangle_{g}+\kappa\left\langle d\right\rangle_{g+1}\Delta\left\langle V\right\rangle_{g+1},&1\leq g<\mathcal{G}-1,\\ &\\ \kappa\ \Delta\left\langle V\right\rangle_{\mathcal{G}-2}-\left\langle d\right\rangle_{\mathcal{G}-1}\Delta\left\langle V\right\rangle_{\mathcal{G}-1},&g=\mathcal{G}-1,\\ \end{cases}

Here we introduced the differences between generation-averaged ionic currents ΔIiong:=Iiong+1Iiong\Delta\left\langle I_{\text{ion}}\right\rangle_{g}:=\left\langle I_{\text{ion}}\right\rangle_{g+1}-\left\langle I_{\text{ion}}\right\rangle_{g} and input currents Δ𝒥(t)g=𝒥(t)g+1𝒥(t)g\Delta\left\langle\mathcal{J}(t)\right\rangle_{g}=\left\langle\mathcal{J}(t)\right\rangle_{g+1}-\left\langle\mathcal{J}(t)\right\rangle_{g} and set d0,1=d0d_{0,1}=\left\langle d\right\rangle_{0}. The differences of generation-averaged input currents Δ𝒥(t)g\Delta\left\langle\mathcal{J}(t)\right\rangle_{g} can be separated in a deterministic part ΔJg:=Jg+1Jg\Delta\left\langle J\right\rangle_{g}:=\left\langle J\right\rangle_{g+1}-\left\langle J\right\rangle_{g} and a stochastic one Δξg(t)=ξ(t)g+1ξ(t)g\Delta\xi_{g}(t)=\left\langle\xi(t)\right\rangle_{g+1}-\left\langle\xi(t)\right\rangle_{g}.

Next, we consider the difference of the generation-averaged ionic currents ΔIiong\Delta\left\langle I_{\text{ion}}\right\rangle_{g}. Both, the difference between membrane potentials of individual nodes and corresponding generation averages, and the difference between generation-averaged membrane potentials of adjacent generations ΔVg\Delta\left\langle V\right\rangle_{g} become small in the case of strong coupling. We therefore approximate the differences between generation-averaged ionic currents to the first order in ΔVg\Delta\left\langle V\right\rangle_{g} around a vanishing mean difference. We assume that it can be expanded in a Taylor expansion around ΔVg=0\Delta\left\langle V\right\rangle_{g}=0. This yields Iiong+1Iiongag+bgΔVg+h.o.\left\langle I_{\text{ion}}\right\rangle_{g+1}-\left\langle I_{\text{ion}}\right\rangle_{g}\approx a_{g}+b_{g}\Delta\left\langle V\right\rangle_{g}+h.o.. As we restrict on networks of identical nodes, except for leaf nodes, we assume that the coefficient aga_{g} vanishes and that the coefficients bgb_{g} are small compared to the coupling strength κ\kappa, i.e. bgκb_{g}\ll\kappa. Using these assumptions, Eq. (C.2) can be linearized and we find

CddtΔVg,k\displaystyle C\frac{d}{dt}\left\langle\Delta V\right\rangle_{g,k} \displaystyle\approx Δ𝒥(t)g+\displaystyle\Delta\left\langle\mathcal{J}(t)\right\rangle_{g}+
+\displaystyle+ {κ(d0+1)ΔV0+κd1ΔV1,g=0,κΔVg1κ(dg+1)ΔVg+κdg+1ΔVg+1,1g<𝒢1,κΔV𝒢2κ(d𝒢1+1)ΔV𝒢1,g=𝒢1,\displaystyle\begin{cases}-\kappa\left(\left\langle d\right\rangle_{0}+1\right)\Delta\left\langle V\right\rangle_{0}+\kappa\left\langle d\right\rangle_{1}\Delta\left\langle V\right\rangle_{1},&g=0,\\ &\\ \kappa\Delta\left\langle V\right\rangle_{g-1}-\kappa\left(\left\langle d\right\rangle_{g}+1\right)\Delta\left\langle V\right\rangle_{g}+\kappa\left\langle d\right\rangle_{g+1}\Delta\left\langle V\right\rangle_{g+1},&1\leq g<\mathcal{G}-1,\\ &\\ \kappa\Delta\left\langle V\right\rangle_{\mathcal{G}-2}-\kappa\left(\left\langle d\right\rangle_{\mathcal{G}-1}+1\right)\Delta\left\langle V\right\rangle_{\mathcal{G}-1},&g=\mathcal{G}-1,\\ \end{cases}

In consequence, the dynamics of the differences of the generation-averaged membrane potentials can be approximated by a multidimensional Ornstein-Uhlenbeck process,

Cddt𝚫V𝐁𝚫V+𝚫J+𝚫𝝃(t).\displaystyle C\frac{d}{dt}\boldsymbol{\Delta}\left\langle\textbf{V}\right\rangle\approx\mathbf{B}\boldsymbol{\Delta}\left\langle\textbf{V}\right\rangle+\boldsymbol{\Delta}\left\langle\textbf{J}\right\rangle+\boldsymbol{\Delta}\left\langle\boldsymbol{\xi}\right\rangle(t). (43)

Here we introduced the GG-dimensional vectors,

𝚫V=(ΔV0,,ΔV𝒢1)T,\displaystyle\boldsymbol{\Delta}\left\langle\textbf{V}\right\rangle=(\Delta\left\langle V\right\rangle_{0},...,\Delta\left\langle V\right\rangle_{\mathcal{G}-1})^{T},
𝚫J=(ΔJ0,ΔJ1,,ΔJ𝒢1)T,\displaystyle\boldsymbol{\Delta}\left\langle\textbf{J}\right\rangle=(\Delta\left\langle J_{0}\right\rangle,\Delta\left\langle J_{1}\right\rangle,...,\Delta\left\langle J_{\mathcal{G}-1}\right\rangle)^{T},
𝚫𝝃(t)=(Δξ(t)0,Δξ(t)1,,Δξ(t)𝒢1)T,\displaystyle\boldsymbol{\Delta}\left\langle\boldsymbol{\xi}(t)\right\rangle=\left(\Delta\left\langle\xi(t)\right\rangle_{0},\Delta\left\langle\xi(t)\right\rangle_{1},...,\Delta\left\langle\xi(t)\right\rangle_{\mathcal{G}-1}\right)^{T},

and the 𝒢×𝒢\mathcal{G}\times\mathcal{G} tridiagonal matrix,

𝐁=(κ(d0+1)κd100κκ(d1+1)κd20κκ(d2+1)0κd𝒢10..0κκ(d𝒢1+1)).\displaystyle\mathbf{B}=\begin{pmatrix}-\kappa\left(\left\langle d\right\rangle_{0}+1\right)&\kappa\left\langle d\right\rangle_{1}&0&...&0\\ \kappa&-\kappa\left(\left\langle d\right\rangle_{1}+1\right)&\kappa\left\langle d\right\rangle_{2}&...&...\\ 0&\kappa&-\kappa\left(\left\langle d\right\rangle_{2}+1\right)&...&0\\ ...&...&...&...&\kappa\left\langle d\right\rangle_{\mathcal{G}-1}\\ 0&..&0&\kappa&-\kappa\left(\left\langle d\right\rangle_{\mathcal{G}-1}+1\right)\\ \end{pmatrix}. (44)

In accordance to our notation for differences of generation-averaged quantities, we introduced the differences of generation-averaged constant and noisy current components, ΔJg=Jg+1Jg\Delta\left\langle J\right\rangle_{g}=\left\langle J\right\rangle_{g+1}-\left\langle J\right\rangle_{g} and Δξ(t)g=ξ(t)g+1ξ(t)g\Delta\left\langle\xi(t)\right\rangle_{g}=\left\langle\xi(t)\right\rangle_{g+1}-\left\langle\xi(t)\right\rangle_{g}.

In the strong coupling limit, temporal deviations of 𝚫V\boldsymbol{\Delta}\langle{\textbf{V}}\rangle from its stationary value decay extremely fast. Hence, we can use an adiabatic approximation Van Kampen (1985), to approximate 𝚫V\boldsymbol{\Delta}\left\langle\textbf{V}\right\rangle by its stationary value plus a white Gaussian noise. Both, the stationary voltage difference and the intensity of the Gaussian white noise in the strong coupling limit can be obtained by setting the left-hand side of Eq. (43) to zero. This yields

𝚫V𝐁1(𝚫J+𝚫𝝃(t)),\boldsymbol{\Delta}\left\langle\textbf{V}\right\rangle\approx-\mathbf{B}^{-1}\left(\boldsymbol{\Delta}\left\langle\textbf{J}\right\rangle+\boldsymbol{\Delta}\left\langle\boldsymbol{\xi}(t)\right\rangle\right), (45)

where 𝐁1\mathbf{B}^{-1} is the inverse of the matrix 𝐁\mathbf{B}.

C.3 Single node description for strongly-coupled random tree networks

In order to obtain an approximation for the dynamics of the root node, only the first component, ΔV0\Delta\left\langle V\right\rangle_{0}, of Eq. (45) is need. Using the latter in Eq. (C.1) yields

CV˙1=Iion,1+κd0(𝐁1(𝚫I+𝚫𝝃(t)))1.\displaystyle C\dot{V}_{1}=-I_{\text{ion},1}+\kappa\ d_{0}\left(\mathbf{B}^{-1}\left(\boldsymbol{\Delta}\left\langle\textbf{I}\right\rangle+\boldsymbol{\Delta}\left\langle\boldsymbol{\xi}(t)\right\rangle\right)\right)_{1}. (46)

Hereafter the index ”11” denotes the first component of a GG-dimensional vector. From Eq.(46), we find the effective current JeffJ_{\text{eff}} and noise intensity SeffS_{\text{eff}} for the current realization of the tree network as

Jeff=κd0(𝐁1𝚫J)1,2Seffξ(t)=κd0(𝐁1𝚫𝝃(t))1.\displaystyle J_{\text{eff}}=\kappa d_{0}\left(\mathbf{B}^{-1}\boldsymbol{\Delta}\left\langle\textbf{J}\right\rangle\right)_{1},\quad\sqrt{2S_{\text{eff}}}\,\xi(t)=\kappa\ d_{0}\left(\mathbf{B}^{-1}\boldsymbol{\Delta}\left\langle\boldsymbol{\xi}(t)\right\rangle\right)_{1}. (47)

The later relation is obtained by noting that the sum of Gaussian white noises yields a Gaussian white noise with modified intensity.

For a given tree realization the inverse of 𝐁\mathbf{B} can be calculated explicitly using the formula for the inverse matrix

𝐁1=1|𝐁|adj(𝐁).\displaystyle\mathbf{B}^{-1}=\frac{1}{|\mathbf{B}|}\ \text{adj}(\mathbf{B}). (48)

Here |𝐁||\mathbf{B}| and adj(𝐁)\text{adj}(\mathbf{B}) refer to the determinant and adjugate of the matrix 𝐁\mathbf{B}, respectively. In the following, we present explicit formulas for the cases used in the main text, G=3,4G=3,4.

In case of G=3G=3, 𝐁k\mathbf{B}_{k} is a 3×33\times 3 matrix. Its determinant reads

|𝐁|=κ3(d0d1d2+d0d1+d0+1)=κ3𝒩.|\mathbf{B}|\,=-\kappa^{3}\left(\left\langle d\right\rangle_{0}\left\langle d\right\rangle_{1}\left\langle d\right\rangle_{2}+\left\langle d\right\rangle_{0}\left\langle d\right\rangle_{1}+\left\langle d\right\rangle_{0}+1\right)=-\kappa^{3}\mathcal{N}. (49)

Its adjugate matrix reads

adj𝐁=κ2(d1d2+d1+1d2+11d1d2+d1d0d2+d0+d2+1d0+1d1d2d0d2+d2d0d1+d0+1)T.\displaystyle\text{adj}\ \mathbf{B}=\kappa^{2}\begin{pmatrix}\left\langle d\right\rangle_{1}\left\langle d\right\rangle_{2}+\left\langle d\right\rangle_{1}+1&\left\langle d\right\rangle_{2}+1&1\\ \left\langle d\right\rangle_{1}\left\langle d\right\rangle_{2}+\left\langle d\right\rangle_{1}&\left\langle d\right\rangle_{0}\left\langle d\right\rangle_{2}+\left\langle d\right\rangle_{0}+\left\langle d\right\rangle_{2}+1&\left\langle d\right\rangle_{0}+1\\ \left\langle d\right\rangle_{1}\left\langle d\right\rangle_{2}&\left\langle d\right\rangle_{0}\left\langle d\right\rangle_{2}+\left\langle d\right\rangle_{2}&\left\langle d\right\rangle_{0}\left\langle d\right\rangle_{1}+\left\langle d\right\rangle_{0}+1\\ \end{pmatrix}^{\text{T}}. (50)

Using this, we can evaluate the effective parameters in Eq. (47) and find

Jeff=J=𝒩J,Seff=𝒮S=𝒩2S.J_{\text{eff}}=\mathcal{R}_{\infty}J=\,\frac{\mathcal{H}}{\mathcal{N}}\,J,\ \ \ S_{\text{eff}}=\mathcal{S}_{\infty}S=\,\frac{\mathcal{H}}{\mathcal{N}^{2}}\,S. (51)

Similarly, in the case of G=4G=4, 𝐁\mathbf{B} is a (4×4)(4\times 4)-matrix with determinant |𝐁|=κ4𝒩|\mathbf{B}|=-\kappa^{4}\mathcal{N}. Evaluation of the adjugate matrix, also yields Eq.(51).

We stress that derivations in this appendix are done for the particular tree realization. Thus, assigning the index kk for tree realizations in (51) to the total number of leaves and nodes gives the scaling relations Eq.(III.2,21) of the main text.

References

  • Newman (2010) M. Newman, Networks: An Introduction (Oxford university press, 2010).
  • Barabási and Pósfai (2016) A.-L. Barabási and M. Pósfai, Network Science (Cambridge university press, 2016).
  • Boccaletti et al. (2006) S. Boccaletti, V. Latora, Y. Moreno, M. Chavez,  and D.-U. Hwang, Physics Reports 424, 175 (2006).
  • Arenas et al. (2008) A. Arenas, A. Díaz-Guilera, J. Kurths, Y. Moreno,  and C. Zhou, Physics Reports 469, 93 (2008).
  • Kiss and Hudson (2003) I. Z. Kiss and J. L. Hudson, AIChE journal 49, 2234 (2003).
  • Mikhailov and Ertl (2012) A. S. Mikhailov and G. Ertl, Engineering of Chemical Complexity (World Scientific, 2012).
  • Farkas, Helbing, and Vicsek (2002) I. Farkas, D. Helbing,  and T. Vicsek, Nature 419, 131 (2002).
  • Borgatti et al. (2009) S. P. Borgatti, A. Mehra, D. J. Brass,  and G. Labianca, Science 323, 892 (2009).
  • Newman (2002) M. E. J. Newman, Physical Review E 66, 016128 (2002).
  • Chen et al. (2015) Y. Chen, J. K. Kim, A. J. Hirning, K. Josić,  and M. R. Bennett, Science 349, 986 (2015).
  • London and Häusser (2005) M. London and M. Häusser, Annual Review of Neuroscience 28, 503 (2005).
  • Kinouchi and Copelli (2006) O. Kinouchi and M. Copelli, Nature Physics 2, 348 (2006).
  • Gollo, Kinouchi, and Copelli (2013) L. L. Gollo, O. Kinouchi,  and M. Copelli, Scientific Reports 3 (2013).
  • Bullmore and Sporns (2009) E. Bullmore and O. Sporns, Nature Reviews Neuroscience 10, 186 (2009).
  • Ocker et al. (2017a) G. K. Ocker, Y. Hu, M. A. Buice, B. Doiron, K. Josić, R. Rosenbaum,  and E. Shea-Brown, Current Opinion in Neurobiology 46, 109 (2017a).
  • Lindner et al. (2004) B. Lindner, J. Garcıa-Ojalvo, A. Neiman,  and L. Schimansky-Geier, Physics Reports 392, 321 (2004).
  • Sagués, Sancho, and Garc´ıa-Ojalvo (2007) F. Sagués, J. M. Sancho,  and J. García-Ojalvo, Reviews of Modern Physics 79, 829 (2007).
  • Ocker et al. (2017b) G. K. Ocker, K. Josić, E. Shea-Brown,  and M. A. Buice, PLoS Computational Biology 13, e1005583 (2017b).
  • Chialvo (2010) D. R. Chialvo, Nature Physics 6, 744 (2010).
  • Larremore, Shew, and Restrepo (2011) D. B. Larremore, W. L. Shew,  and J. G. Restrepo, Physical Review Letters 106, 058101 (2011).
  • Buice, Cowan, and Chow (2010) M. A. Buice, J. D. Cowan,  and C. C. Chow, Neural Computation 22, 377 (2010).
  • Banks et al. (1997) R. W. Banks, M. Hulliger, K. Scheepstra,  and E. Otten, The Journal of Physiology 498, 177 (1997).
  • Banks, Barker, and Stacey (1982) R. W. Banks, D. Barker,  and M. Stacey, Philosophical Transactions of the Royal Society of London B: Biological Sciences 299, 329 (1982).
  • Lesniak et al. (2014) D. R. Lesniak, K. L. Marshall, S. A. Wellnitz, B. A. Jenkins, Y. Baba, M. N. Rasband, G. J. Gerling,  and E. A. Lumpkin, Elife 3, e01488 (2014).
  • Marshall et al. (2016) K. L. Marshall, R. C. Clary, Y. Baba, R. L. Orlowsky, G. J. Gerling,  and E. A. Lumpkin, Cell Reports 17, 1719 (2016).
  • Besson (1999) J. Besson, The Lancet 353, 1610 (1999).
  • Yu and Zhang (2004) J. Yu and J. Zhang, Neuroscience Letters 362, 171 (2004).
  • Lee and Yu (2014) L.-Y. Lee and J. Yu, Comprehensive Physiology 4, 287 (2014).
  • Rogers, Neiman, and Russell (2013) D. Rogers, L. Neiman,  and D. F. Russell, Bulletin of the American Physical Society 58 (2013).
  • Quick, Kennedy, and Poppele (1980) D. Quick, W. Kennedy,  and R. Poppele, Neuroscience 5, 109 (1980).
  • Bewick and Banks (2015) G. S. Bewick and R. W. Banks, Pflügers Archiv-European Journal of Physiology 467, 175 (2015).
  • Eagles and Purple (1974) J. P. Eagles and R. L. Purple, Brain Research 77, 187 (1974).
  • Carr, Gregory, and Proske (1998) R. Carr, J. Gregory,  and U. Proske, Brain Research 800, 97 (1998).
  • Kröller, Grüsser, and Weiss (1990) J. Kröller, O.-J. Grüsser,  and L.-R. Weiss, Biological Cybernetics 63, 91 (1990).
  • Kromer, Schimansky-Geier, and Neiman (2016) J. A. Kromer, L. Schimansky-Geier,  and A. B. Neiman, Physical Review E 93, 042406 (2016).
  • Kromer et al. (2017) J. Kromer, A. Khaledi-Nasab, L. Schimansky-Geier,  and A. B. Neiman, Scientific Reports 7 (2017).
  • Ermentrout and Terman (2010) G. B. Ermentrout and D. H. Terman, Mathematical Foundations of Neuroscience (Springer Science & Business Media, 2010).
  • McIntyre, Richardson, and Grill (2002) C. C. McIntyre, A. G. Richardson,  and W. M. Grill, Journal of Neurophysiology 87, 995 (2002).
  • Drmota (2009) M. Drmota, Random Trees: An Interplay Between Combinatorics and Probability (Springer Science & Business Media, 2009).
  • Harris (2002) T. E. Harris, The Theory of Branching Processes (Courier Corporation, 2002).
  • Walsh, Bautista, and Lumpkin (2015) C. M. Walsh, D. M. Bautista,  and E. A. Lumpkin, Current Opinion in Neurobiology 34, 133 (2015).
  • Wellnitz et al. (2010) S. A. Wellnitz, D. R. Lesniak, G. J. Gerling,  and E. A. Lumpkin, Journal of Neurophysiology 103, 3378 (2010).
  • Kouvaris et al. (2014) N. E. Kouvaris, T. Isele, A. S. Mikhailov,  and E. Schöll, EPL (Europhysics Letters) 106, 68001 (2014).
  • Van Kampen (1985) N. G. Van Kampen, Physics Reports 124, 69 (1985).