Skip to main content

Gap Junctions, Dendrites and Resonances: A Recipe for Tuning Network Dynamics

Abstract

Gap junctions, also referred to as electrical synapses, are expressed along the entire central nervous system and are important in mediating various brain rhythms in both normal and pathological states. These connections can form between the dendritic trees of individual cells. Many dendrites express membrane channels that confer on them a form of sub-threshold resonant dynamics. To obtain insight into the modulatory role of gap junctions in tuning networks of resonant dendritic trees, we generalise the “sum-over-trips” formalism for calculating the response function of a single branching dendrite to a gap junctionally coupled network. Each cell in the network is modelled by a soma connected to an arbitrary structure of dendrites with resonant membrane. The network is treated as a single extended tree structure with dendro-dendritic gap junction coupling. We present the generalised “sum-over-trips” rules for constructing the network response function in terms of a set of coefficients defined at special branching, somatic and gap-junctional nodes. Applying this framework to a two-cell network, we construct compact closed form solutions for the network response function in the Laplace (frequency) domain and study how a preferred frequency in each soma depends on the location and strength of the gap junction.

1 Introduction

It has been known since the end of the nineteenth century and mainly from the work of Ramón y Cajal [1] that neuronal cells have a distinctive structure, which is different to that of any other cell type. The most extended parts of many neurons are dendrites. Their complex branching formations receive and integrate thousands of inputs from other cells in a network, via both chemical and electrical synapses. The voltage-dependent properties of dendrites can be uncovered with the use of sharp micropipette electrodes and it has long been recognised that modelling is essential for the interpretation of intracellular recordings. In the late 1950s, the theoretical work of Wilfrid Rall on cable theory provided a significant insight into the role of dendrites in processing synaptic inputs (see the book of Segev et al. [2] for a historical perspective on Rall’s work). Recent experimental and theoretical studies at a single cell level reinforce the fact that dendritic morphology and membrane properties play an important role in dendritic integration and firing patterns [35]. Coupling neuronal cells in a network adds an extra level of complexity to the generation of dynamic patterns. Electrical synapses, also known as gap junctions, are known to be important in mediating various brain rhythms in both normal [6, 7] and pathological [810] states. They are mechanical and electrically conductive links between adjacent nerve cells that are formed at fine gaps between the pre- and post-synaptic cells and permit direct electrical connections between them. Each gap junction contains numerous connexon hemi-channels, which cross the membranes of both cells. With a lumen diameter of about 1.2 to 2.0 nm, the pore of a gap junction channel is wide enough to allow ions and even medium-sized signalling molecules to flow from one cell to the next thereby connecting the two cells’ cytoplasm. Being first discovered at the giant motor synapses of the crayfish in the late 1950s, gap junctions are now known to be expressed in the majority of cell types in the brain [11]. Without the need for receptors to recognise chemical messengers, gap junctions are much faster than chemical synapses at relaying signals.

Earlier theoretical studies demonstrate that although neuronal gap junctions are able to synchronise network dynamics, they can also contribute toward the generation of many other dynamic patterns including anti-phase, phase-locked and bistable rhythms [12]. However, such studies often ignore dendritic morphology and focus only on somato-somatic gap junctions. In the case of dendro-dendritic coupling, simulations of multi-compartmental models reveal that network dynamics can be tuned by the location of the gap junction on the dendritic tree [13, 14]. Here, we develop a more mathematical approach using the continuum cable description of a dendritic tree (either passive or resonant) that can compactly represent the response of an entire dendro-dendritic gap junction coupled neural network to injected current using a response function. This response function, often referred as a Green’s function, describes the voltage dynamics along a network structure in response to a delta-Dirac pulse applied at a given discrete location. Our work is based on the method for constructing the Green’s function of a single branched passive dendritic tree as originally proposed by Abbott et al. [15, 16] and generalised by Coombes et al. [17] to treat resonant membrane (whereby subthreshold oscillatory behaviour is amplified for inputs at preferential frequencies determined by ionic currents such as I h ). This “sum-over-trips” method is built on the path integral formulation and calculates the Green’s function on an arbitrary dendritic geometry as a convergent infinite series solution.

In Sect. 2, we introduce the network model for gap junction coupled neurons. Each neuron in the network comprises of a soma and a dendritic tree. Cellular membrane dynamics are modelled by an ‘LRC’ (resonant) circuit. In Sect. 3, we focus on an example of two unbranched dendritic cells, with no distinguished somatic node, with identical and heterogeneous sets of parameters and give the closed form solution for network response with a single gap junction. The complete “sum-over-trips” rules for the more general case of an arbitrary network geometry are also presented. In Sect. 4, we apply the formalism to a more realistic case of two coupled neurons, each with a soma and a branching structure. We introduce a method of ‘words’ to construct compact solutions for the Green’s function of this network and study how a preferred frequency in each soma depends on the location and strength of the gap junction. Finally, in Sect. 5, we consider possible extensions of the work in this paper.

2 The Model

We consider a network of cells connected by gap junctions. The neural morphology of individual cells includes a branching dendritic structure and a lumped soma (see an illustrative example for two cells in Fig. 1a). We assume that the dendrites are not purely passive (i.e. modelled by the ‘RC’ circuit), but are resonant (i.e. modelled by the ‘LRC’ circuit shown in Fig. 1b). Many neurons exhibit resonances whereby subthreshold oscillatory behaviour is amplified for inputs at preferential frequencies, for example as seen in neurons of rat sensorimotor cortex [18]. In this case, it is known that the non-linear ionic current I h is responsible, and in general it is believed that the presence of I h in dendrites can have a major impact on the integration of subthreshold synaptic activity [19]. From a mathematical perspective, Mauro et al. [20] have shown that a linearisation of channel kinetics (for currents such as I h ), about rest, may adequately describe the observed resonant dynamics. The resulting linear system has a membrane impedance that displays resonant-like behaviour due to the additional presence of inductances (which are determined by the choice of channel model). This circuit is described by the specific membrane capacitance C, the resistance across a unit area of passive membrane R and an inductance L in series with a resistance r. The transmembrane voltage V i (x,t) on an individual branch i of each cell is then governed by the following set of equations:

V i t = D i 2 V i x 2 V i τ i 1 C i [ I i I inj , i ],
(1)
L i I i t = r i I i + V i ,0x L i ,t0.
(2)

The constants D i and τ i can be found in terms of the electrical parameters of the cell membrane as D i = a i /(4 R a , i C i ) and τ i = C i R i , where a i is a diameter and R a , i is the specific cytoplasmic resistivity of branch i. The term I inj , i (x,t) models an external current applied to this branch. The dendritic structure of each cell is attached to an equipotential soma of the diameter a s modelled by the ‘LRC’ circuit with the parameters C s , R s , L s and r s . Moreover, individual branches of different cells can be connected by gap junctions with a coupling parameter R GJ .

Fig. 1
figure 1

a A network of two cells connected by a gap junction (GJ). b An ‘LRC’ circuit modelling the resonant cell membrane

Equations (1)–(2) for each dendritic segment must be accompanied with additional equations describing the dynamics of voltage at two ends of a segment. If the proximal (x=0) or distal (x= L i ) end of a branch is a branching node point the continuity of the potential across a node and Kirchoff’s law of conservation of current are imposed. For example, boundary conditions for a node indicated in Fig. 1a take the form:

V j ( L j ,t)= V n (0,t)= V k (0,t),
(3)
1 r a , j V j x | x = L j = 1 r a , n V n x | x = 0 + 1 r a , k V k x | x = 0 ,
(4)

where r a , j =4 R a , j /(π a j 2 ) is the axial resistance on branch j. If a branch terminates at x= L i we either have a no-flux (a closed-end) boundary condition

V i x | x = L i =0,
(5)

or a zero value (an open-end) boundary condition

V i ( L i ,t)=0.
(6)

A lumped soma can be treated as a special node point with the somatic membrane voltage V s (t) and the following set of equations, which imposes special boundary conditions on the proximal ends of branches connected to the soma:

V s (t)= V j (0,t),
(7)
C s d V s d t = V s R s + j 1 r a , j V j x | x = 0 I s ,
(8)
L s d I s d t = r s I s + V s ,
(9)

where the sum in Eq. (8) is over all branches connected to the soma. If the branches of two cells are coupled by a gap junction, the location of this coupling can be treated as a special node point on an extended branching structure. This gap-junctional (GJ) node requires the following set of boundary conditions (given here with an assumption that it is placed at x=0):

V m (0,t)= V m + (0,t), V n (0,t)= V n + (0,t),
(10)

and

1 r a , m ( V m x | x = 0 + V m + x | x = 0 ) = g GJ ( V m ( 0 , t ) V n ( 0 , t ) ) ,
(11)
1 r a , n ( V n x | x = 0 + V n + x | x = 0 ) = g GJ ( V n ( 0 , t ) V m ( 0 , t ) ) ,
(12)

where g GJ =1/ R GJ is the conductance of the gap junction and m and m + ( n and n + ) are two segments of branch m (branch n) connected at the gap junction (see Fig. 1a). The expressions in (10) reflect continuity of the potential across individual branches m and n, and Eqs. (11)–(12) enforce conservation of current.

A whole network model can be viewed as an extended tree structure with each individual node belonging to one of the following categories: a terminal, a regular branching node, a somatic node or the GJ node. The voltage dynamics along the network structure are described by linear equations and, therefore, the model’s behaviour can be studied by constructing the network response function known as the Green’s function, G i j (x,y,t). This function describes the voltage response at the location x on branch i in response to a delta-Dirac pulse applied to the location y on branch j at time t=0 (branches i and j can belong either to the same cell or to the two different cells). Knowing the Green’s function for the whole structure, it is easy to compute the voltage dynamics along the whole network for any form of an external input I inj , j (x,t) applied to branch j as

V i ( x , t ) = k 0 L k d y G i k ( x , y , t ) V k ( y , 0 ) + 0 t d s 0 L j d y G i j ( x , y , t s ) I inj , j ( y , s ) ,
(13)

where V k (x,0) describes the initial conditions on branch k and the sum is over all branches of the tree. Multiple external stimuli can be tackled by simply adding new terms with additional inputs I inj , j (x,t) to Eq. (13).

3 The Green’s Function on a Network

Earlier work of Coombes et al. [17] demonstrated that the Green’s function for a single cell with resonant membrane can be constructed by generalising the “sum-over-trips” framework of Abbott et al. [15, 16] for passive dendrites. Here, we demonstrate how this framework can be extended to a network level starting with the simple case of two identical cells.

3.1 Two Simplified Identical Cells

We consider the case of two identical cells coupled by a gap junction. Each cell consists of a single resonant dendrite of infinite length (see Fig. 2). A gap junction controlled by the parameter R GJ and located at x=0 divides two dendrites into four semi-infinite segments: m , m + , n , and n + . We assume that an external input I inj , m (x,t)=δ(xy)δ(t) is applied to segment m . The Green’s function on each segment must satisfy the set of Eqs. (1)–(2) with the boundary conditions at the gap junction given by Eqs. (10)–(12). Introducing the Laplace transform with spectral parameter ω

L [ f ( t ) ] = f ˆ (ω)= 0 e ω t f(t)dt,

and assuming zero initial data, we can solve this model in the frequency domain:

G ˆ m (x,y,ω)= 1 C [ e γ ( ω ) | x y | 2 D γ ( ω ) p GJ ( ω ) e γ ( ω ) | x + y | 2 D γ ( ω ) ] ,
(14)
G ˆ m + (x,y,ω)= 1 C [ ( 1 p GJ ( ω ) ) e γ ( ω ) | x + y | 2 D γ ( ω ) ] ,
(15)
G ˆ n (x,y,ω)= G ˆ n + (x,y,ω)= 1 C [ p GJ ( ω ) e γ ( ω ) | x + y | 2 D γ ( ω ) ] ,
(16)

where

γ 2 (ω)= 1 D [ 1 τ + ω + 1 C ( r + ω L ) ] ,
(17)

and

p GJ (ω)= 1 2 ( z ( ω ) R GJ + 1 ) ,z(ω)=γ(ω)/ r a .
(18)

Solutions (14)–(16) are obtained using the “sum-over-trips” method where G ˆ (x,y,ω) on each segment can be found as trips A trip (ω) G ˆ ( L trip ,ω), and

G ˆ (x,ω)= e γ ( ω ) | x | 2 D γ ( ω )
(19)

is the Laplace transform of the Green’s function G (x,t) for an infinite resonant cable. L trip is the length of a path that starts at point x on one of the segments and ends at point y on segment m . The trip coefficients A trip (ω) which ensure that the boundary conditions at the gap junction hold are chosen according to the following rules (see Fig. 3):

  • A trip (ω)= p GJ (ω)

    if the trip reflects along on the gap junction back onto the same dendrite.

  • A trip (ω)=1 p GJ (ω)

    if the trip passes through the gap junction along the same dendrite.

  • A trip (ω)= p GJ (ω)

    if the trip passes through the gap junction from one cell to another cell.

Fig. 2
figure 2

A network of two identical cells, each consists of an infinite dendritic cable, coupled by a gap junction

Fig. 3
figure 3

All trips (including the shortest trip for G ˆ m (x,y,ω) shown by a dashed arrow) and the corresponding coefficients A trip (ω) at the GJ for two identical cells

Performing the numerical inverse Laplace transform ( L 1 ) of Eqs. (14)–(16), we obtain the Green’s function in the time domain for each segment. These Green’s functions are plotted in Figs. 4a–c. For any arbitrary form of external input I inj , m (x,t)=δ(xy)I(t), the voltage response on each segment can be found by taking a convolution of the corresponding Green’s function with this stimulus. Using the Laplace representation of the Green’s function on each segment given by Eqs. (14)–(16) this can be computed as

V k (x,t)= L 1 [ G ˆ k ( x , y , ω ) I ˆ ( ω ) ] ,k { m , m + , n , n + } ,
(20)

where I ˆ (ω)=L[I(t)]. In Figs. 4d–f, we plot the voltage profiles on each segment in response to a rectangular pulse I(t)= η 0 Θ(t)Θ( τ R t) of strength η 0 and duration τ R , where Θ(t) is the Heaviside step function.

Fig. 4
figure 4

ac The Green’s functions G m (x,y,t), G m + (x,y,t), and G n ± (x,y,t) for a model in Fig. 2 when x=10 μm and y=100 μm. Parameters: a=2 μm, D=50000  μm 2 /ms, τ=2 ms, C=1  μF/cm 2 , R a =100Ω cm, r=100Ω  cm 2 , L=5  H cm 2 , R GJ =100 MΩ. df Voltage profiles on each segment in response to a rectangular pulse of strength η 0 =2 nA and duration τ R =5 ms applied to segment m . Note that different y-axis limits are used in c and f

A response of the network model is characterised by the Green’s function and can be studied by introducing a power function P k (x,y,ω) defined as P k (x,y,ω)=| G ˆ k (x,y,ω) | 2 . Resonant dynamics of the model for a given pair of locations (x,y) are directly linked with a value Ω 0 at which the function P k (x,y,ω) has its maximum. In Figs. 5a–c, we plot the voltage profiles on each segment in response to a chirp stimulus I chirp (t)= A chirp sin( ω chirp t 2 ). These figures clearly demonstrate resonant behaviour of the system maximising the voltage responses for particular frequencies. In Fig. 5d, we plot the normalised power functions P k N (x,y,ω)= P k (x,y,ω)/ max ω [ P k (x,y,ω)] at the same locations. These power functions have their maximum at the value Ω 0 =0.4271, the same for each segment and, therefore, the resonances (indicated by arrows) in Figs. 5a–c occur at the same time. We can also notice that the function P n ± N (x,y,ω) decays to zero more rapidly than the functions P m N (x,y,ω) and P m + N (x,y,ω). This explains the rapid reduction of voltage amplitude straight after the resonance in Fig. 5c.

Fig. 5
figure 5

ac Voltage profiles on each segment at x=10 μm in response to a stimulus I chirp (t) applied at y=100 μm on segment m . Cells’ parameters as in Fig. 4, ω chirp =0.003, A chirp =1 nA. d Normalised power functions P m N (x,y,ω) (black curve), P m + N (x,y,ω) (red curve), P n ± N (x,y,ω) (green curve)

Typical values of a unitary gap junction conductance are 10–550 pS [11] giving g GJ =105500 pS (or R GJ =180 10 5  MΩ) for 1–10 gap junction channels per electrical connection, although these estimates may be conservative and conductances from a larger range could be considered, as for example g GJ =10240000 pS corresponding to R GJ =4 10 5  MΩ in [14]. To demonstrate how the resistance of the gap junction affects the response function in a model of two identical cells, we plot Fig. 6 for R GJ =100 MΩ (black curves, the case shown in Figs. 4a–c), R GJ =1 MΩ (red curves) and R GJ =1000 MΩ (green curves). Low gap-junctional resistance significantly increases the amplitude of the Green’s function for Cell n and reduces the amplitude of the Green’s function for Cell m. Increasing the resistance reduces the response in Cell n and slightly increases the response in Cell m. In this model of two identical cells, the change of the resistance of the gap junction does not affect the resonant frequency Ω 0 , which is the same for each segment.

Fig. 6
figure 6

ac The Green’s functions G m (x,y,t), G m + (x,y,t), and G n ± (x,y,t) for a model in Fig. 2 when x=10 μm and y=100 μm. Parameters: a=2 μm, D=50000  μm 2 /ms, τ=2 ms, C=1  μF/cm 2 , R a =100Ω cm, r=100Ω  cm 2 , L=5  H cm 2 , R GJ =100 MΩ (black curves, as in Figs. 4a–c), R GJ =1 MΩ (red curves), R GJ =1000 MΩ (green curves). Note that different y-axis limits are used in c

Although solutions (14)–(16) are found for the case of the resonant membrane, an ‘LRC’ circuit can be naturally turned into a ‘RC’ circuit by using the limit r which gives γ 2 (ω)=(1/τ+ω)/D. In the case of purely passive membrane, it is possible to make extra progress and find analytical forms of the solutions in the time domain (see Appendix A). In Figs. 7a–c, we plot the Green’s functions for the model in Fig. 2 with passive (instead of resonant) membrane. Voltage responses on each segment in response to a rectangular pulse are shown in Figs. 7d–f.

Fig. 7
figure 7

ac The Green’s functions G m (x,y,t), G m + (x,y,t), and G n ± (x,y,t) for a model in Fig. 2 with passive membrane when x=10 μm and y=100 μm. Parameters: a=2 μm, D=50000  μm 2 /ms, τ=2 ms, C=1  μF/cm 2 , R a =100Ω cm, R GJ =100 MΩ. df Voltage profiles on each segment in response to a rectangular pulse of strength η 0 =2 nA and duration τ R =5 ms applied to segment m . Note that different y-axis limits are used in c and f

3.2 Two Simplified Non-identical Cells

Here, we consider a model in Fig. 2 with the assumption that the cells are non-identical. Then using the Laplace transform and solving the model (with zero initial data) in the frequency domain, we obtain

G ˆ m (x,y,ω)= 1 C m [ e γ m ( ω ) | x y | 2 D m γ m ( ω ) p GJ , n ( ω ) e γ m ( ω ) | x + y | 2 D m γ m ( ω ) ] ,
(21)
G ˆ m + (x,y,ω)= 1 C m [ ( 1 p GJ , n ( ω ) ) e γ m ( ω ) | x + y | 2 D m γ m ( ω ) ] ,
(22)
G ˆ n (x,y,ω)= G ˆ n + (x,y,ω)= 1 C m [ p GJ , m ( ω ) e | γ n ( ω ) x + γ m ( ω ) y | 2 D m γ m ( ω ) ] ,
(23)

where the parameters γ m (ω) and γ n (ω) are defined in terms of cells’ individual properties as

γ m 2 (ω)= 1 D m [ 1 τ m + ω + 1 C m ( r m + ω L m ) ] ,
(24)
γ n 2 (ω)= 1 D n [ 1 τ n + ω + 1 C n ( r n + ω L n ) ] .
(25)

Solutions (21)–(23) show that the trip coefficients A trip (ω) depend on either p GJ , m (ω) or p GJ , n (ω) (see Fig. 8), which have the forms

p GJ , m (ω)= z m ( ω ) z m ( ω ) + z n ( ω ) + 2 R GJ z m ( ω ) z n ( ω ) , z m (ω)= γ m (ω)/ r a , m ,
(26)
p GJ , n (ω)= z n ( ω ) z m ( ω ) + z n ( ω ) + 2 R GJ z m ( ω ) z n ( ω ) , z n (ω)= γ n (ω)/ r a , n .
(27)
Fig. 8
figure 8

All trips (including the shortest trip for G ˆ m (x,y,ω) shown by a dashed arrow) and the corresponding coefficients A trip (ω) at the GJ for two non-identical cells

In Figs. 9a–c, we demonstrate how individual variations in cell parameters affect the voltage response in the system. For each set of the parameters, we plot the Green’s functions G m (x,y,t), G m + (x,y,t), and G n ± (x,y,t) obtained by taking the numerical inverse Laplace transform of (21)–(23). Black curves show the profiles for two identical cells. Dashed red curves are the Green’s functions for a case when L n is changed from 5 H cm 2 to 25 H cm 2 . This change affects the response in Cell n, but not in Cell m. Blue curves are plotted for a case when L m is changed from 5 H cm 2 to 1 H cm 2 . It has noticeable effect on both cells. Finally, green curves are plotted for the case a m =1μm instead of the original diameter a m =2μm showing changes in profiles in both cells. As the stimulus in these examples is applied to Cell m, any variations in the parameters of this cell have an immediate effect on the responses in Cell n. In contrast, Cell m seems to be mostly robust to variations in parameters in Cell n. Resonant properties of the cells’ responses can be studied by plotting the normalised power functions P k N (x,y,ω) for each of the parameter sets (see Figs. 9d–f). The heterogeneity of the cells’ parameters leads to appearances of different values of Ω 0 (the maximum of the power function) for each cell. We can also notice that the power functions for Cell n are more localised around their peaks (Fig. 9f) in comparison to the power functions for Cell m (Figs. 9d, e) as it has been earlier observed in the case of two identical cells.

Fig. 9
figure 9

The Green’s functions G m (x,y,t), G m + (x,y,t), and G n ± (x,y,t) (ac) and normalised power functions P m N (x,y,ω), P m + N (x,y,ω), and P n ± N (x,y,ω) (df) for a model in Fig. 2 when x=10 μm and y=100 μm. Black curves: two identical cells with the parameters as in Fig. 4. Dashed red curves: as in an identical case except L n =25  H cm 2 . Blue curves: as in an identical case except L m =1  H cm 2 . Green curves: as in an identical case except a m =1 μm

3.3 An Arbitrary Network Geometry

Here, we consider a network of spatially-extended cells of arbitrary geometries. This network can be treated as a single extended tree structure which consists of individual branches (indexed by a finite non-repeating sequence {1,2,,i,,k,,j,}) and three types of nodes: a regular branching node, a somatic node and a GJ node (see Fig. 10). The Green’s function G i j (x,y,t) for the whole structure can be found by obtaining G ˆ i j (x,y,ω) in the Laplace domain and then performing L 1 [ G ˆ i j (x,y,ω)]. We consider a general case when each branch of the network can have different biophysical parameters and is characterised by the function γ k (ω) defined as

γ k 2 (ω)= 1 D k [ 1 τ k + ω + 1 C k ( r k + ω L k ) ] ,
(28)

where k labels an arbitrary branch of the network. Using the “sum-over-trips” formalism G ˆ i j (x,y,ω) can be constructed as an infinite series expansion

G ˆ i j (x,y,ω)= 1 D j γ j ( ω ) trips A trip (ω) H ˆ ( L trip ( i , j , x , y , ω ) ) ,
(29)

where H ˆ (x)= e | x | /2 and L trip (i,j,x,y,ω) is the length of a path along the network structure that starts at the point γ i (ω)x on branch i and ends at the point γ j (ω)y on branch j. Note that the length of each branch of the network needs to be scaled by γ k (ω) before L trip is calculated for (29). It is also worth mentioning here that if all branches of a network have the same biophysical parameters, i.e. γ k (ω)=γ(ω), the function H ˆ ( L trip (ω))/(Dγ(ω))= G ˆ ( L trip ,ω) defined by (19). The trip coefficients A trip (ω) in (29) are chosen according to the following set of rules:

  • Initiate A trip (ω)=1.

Branching node

  • For any branching node at which the trip passes from branch i to a different branch k, A trip (ω) is multiplied by a factor 2 p k (ω).

  • For any branching node at which the trip approaches a node and reflects off this node back along the same branch k, A trip (ω) is multiplied by a factor 2 p k (ω)1.

Here, the frequency dependent parameter p k (ω) is defined as

p k (ω)= z k ( ω ) n z n ( ω ) , z k (ω)= γ k ( ω ) r a , k ,
(30)

where the sum is over all branches connected to the node.

Terminal

  • For every terminal which always reflects any trip, A trip is multiplied by +1 for the closed-end boundary condition or by −1 for the open-end boundary condition.

Somatic node

  • For the somatic node at which the trip passes through the soma from branch i to a different branch k, A trip (ω) is multiplied by a factor 2 p s , k (ω).

  • For the somatic node at which the trip approaches the soma and reflects off the soma back along the same branch k, A trip (ω) is multiplied by a factor 2 p s , k (ω)1.

Here, the frequency dependent parameter p s , k (ω) is defined as

p s , k (ω)= z k ( ω ) n z n ( ω ) + γ s ( ω ) , γ s (ω)= C s ω+ 1 R s + 1 r s + L s ω ,
(31)

where the sum is over all branches connected to the soma.

GJ node

  • For the GJ node at which the trip passes through the gap junction from branch n to branch m, A trip (ω) is multiplied by a factor p GJ , m (ω). For the GJ node at which the trip passes through the gap junction from branch m to branch n, A trip (ω) is multiplied by a factor p GJ , n (ω).

  • For the GJ node at which the trip approaches the gap junction, passes it and then continues along the same branch m, A trip (ω) is multiplied by a factor 1 p GJ , n (ω). For the GJ node at which the trip approaches the gap junction, passes it and then continues along the same branch n, A trip (ω) is multiplied by a factor 1 p GJ , m (ω).

  • For the GJ node at which the trip approaches the gap junction and reflects off the gap junction back along the same branch m, A trip (ω) is multiplied by a factor p GJ , n (ω). For the GJ node at which the trip approaches the gap junction and reflects off the gap junction back along the same branch n, A trip (ω) is multiplied by a factor p GJ , m (ω).

Here, parameters p GJ , m (ω) and p GJ , n (ω) are defined by Eqs. (26) and (27).

Fig. 10
figure 10

A network of two cells as an extended tree structure with different types of nodes

We refer the reader to Coombes et al. [17] for a proof of rules for branching and somatic nodes. In Appendix B, we prove that the rules for generating the trip coefficients at the GJ node satisfy the gap-junctional boundary conditions.

4 Application: Two-Cell Network

Here, we demonstrate how the “sum-over-trips” formalism can be applied to a two-cell network for obtaining insight into network response. As an example, we consider a model of two identical cells, each of which consists of a soma and N attached semi-infinite dendrites as shown in Fig. 11. The cells are coupled by a dendro-dendritic gap junction located at some distance L GJ away from their cell bodies. We assume that this network receives an input at the location y 0 . To study the dynamics of this network, we use the “sum-over-trips” framework and construct the Green’s functions G ˆ 1 (x, y 0 ,ω) and G ˆ 2 (x, y 0 ,ω) for Cell 1 and Cell 2, respectively.

Fig. 11
figure 11

A two-cell model

4.1 Method of Words for Compact Solutions

Here, we introduce a method which allows us to construct compact solution forms for the Green’s functions of this two-cell network. We describe this method in detail by constructing the Green’s function G ˆ 2 ( x 0 , y 0 ,ω) for Cell 2 when x 0 is placed between the soma and the gap-junction as shown in Fig. 12. Introducing points from 1 to 4 on this network, we associate letters with different directions as follows:

  • From x 0 1 or from 21: letter A.

  • From x 0 2 or from 12: letter B.

  • From 34: letter W.

  • From 43: letter Y.

  • From 3 y 0 : letter Z.

Then the shortest trip which is a trip from x 0 23 y 0 is associated with the (ordered) word BZ consisting of one syllable. This and any trip associated with a word that starts with the letter B, i.e. from x 0 2, and ends with the letter Z, i.e. from 3 y 0 , will belong to class 1. Any trip associated with a word which starts from x 0 12 and ends with 3 y 0 , will belong to class 2. The shortest trip in this class is associated with the word ABZ, consisting of two syllables, AB and BZ. We introduce the following table that associates individual coefficients in the “sum-over-trips” framework with the syllables:

As the cells are identical in this network, the parameter p GJ (ω) is defined by (18) and

p s (ω)= γ ( ω ) / r a N γ ( ω ) / r a + γ s ( ω ) ,
(32)

where N is a number of dendrites attached to each soma and γ s (ω) is given in (31). Then, using the table, it is easy to conclude that for example, the word BZ is associated with the coefficient p GJ (ω) and the word ABZ, consisting of the syllables AB and BZ, is associated with the coefficient (2 p s (ω)1) p GJ (ω). We also notice from the table that different coefficients are associated with the syllables BZ and YZ and, therefore, we need to introduce two additional classes. Class 3 will include the trips with the main skeleton x 0 2343 y 0 and the associated word BWYZ. Class 4 will include the trips with the main skeleton x 0 12343 y 0 and the associated word ABWYZ. Combining the skeleton structures (the shortest words) of the four classes, we have

(33)

Any new word in each class can be formed by adding a combination of syllables AB and WY into the structure (33). Introducing such additions of n combinations of syllables consisting of k syllables AB and (nk) syllables WY by [] (both syllables AB and WY can take any position in this sequence of n syllables), class 3 and class 4 can be generalised as

(34)

Similarly, we can generalise class 1 and class 2. However, to ensure that the words belong to class 1 and class 2, the syllable AB must be at the end of each word in combinations. This can be written as

(35)

where

[ ] = [ 1 + [ ] AB ] .
(36)
Fig. 12
figure 12

A two-cell model with associated letters

Using combinatorics, we can write

[ ] = k = 0 n ( n k ) ( AB ) k ( WY ) n k = ( n 0 ) ( WY ) n + k = 1 n 1 ( n k ) ( AB ) k ( WY ) n k + ( n n ) ( AB ) n ,
(37)

which leads to

[ ] = ( n 0 ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 + k = 1 n 1 ( n k ) ( 2 p s ( ω ) 1 ) k ( p GJ ( ω ) ) k 1 × p GJ ( ω ) ( 2 p s ( ω ) 1 ) n k ( p GJ ( ω ) ) n k 1 + ( n n ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 = ( n 0 ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 k = 1 n 1 ( n k ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 + ( n n ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 .
(38)

Considering the possible trips in class 3 given by

B[]WYZ
(39)

and substituting the expression for [] found in (38), we find

p GJ ( ω ) ( n 0 ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 ( p GJ ( ω ) ) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) ( p GJ ( ω ) ) k = 1 n 1 ( n k ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 × ( p GJ ( ω ) ) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) + ( p GJ ( ω ) ) ( n n ) ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n 1 × p GJ ( ω ) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) = [ 2 n ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n ] p GJ ( ω ) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) .
(40)

Similarly, the possible trips in class 4 given by

AB[]WYZ
(41)

generate the trip coefficients

( 2 p s ( ω ) 1 ) [ 2 n ( 2 p s ( ω ) 1 ) n ( p GJ ( ω ) ) n ] p GJ (ω) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) .
(42)

Expressions (40) and (42) for coefficients in the trips belonging to class 3 and class 4 can now be used in the “sum-over-trips” expansion (29) to obtain

n = 0 [ 2 p GJ ( ω ) ( 2 p s ( ω ) 1 ) ] n p GJ ( ω ) ( 2 p s ( ω ) 1 ) ( 1 p GJ ( ω ) ) × [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] ,
(43)

where G ˆ (x,ω)= H ˆ (γ(ω)x)/(Dγ(ω)) defined by (19). Similarly, we can show that the possible trips in class 1 and class 2 given by

(1+A)B [ 1 + [ ] AB ] Z
(44)

generate the terms

p GJ ( ω ) G ˆ ( y 0 x 0 , ω ) + p GJ ( ω ) ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 , ω ) + n = 0 [ 2 p GJ ( ω ) ( 2 p s ( ω ) 1 ) ] n p GJ ( ω ) ( p GJ ( ω ) ) ( 2 p s ( ω ) 1 ) × [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] .
(45)

Combining together (43) and (45), we obtain

G ˆ 2 ( x 0 , y 0 , ω ) = p GJ ( ω ) G ˆ ( y 0 x 0 , ω ) + p GJ ( ω ) ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 , ω ) + n = 0 [ 2 p GJ ( ω ) ( 2 p s ( ω ) 1 ) ] n p GJ ( ω ) ( 2 p s ( ω ) 1 ) × { ( p GJ ( ω ) ) [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] + ( 1 p GJ ( ω ) ) [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] } .
(46)

Terms in {} in (46) represent multiple trips in each of four classes and since there is a match in the length of trips among different classes, Eq. (46) can be simplified as

G ˆ 2 ( x 0 , y 0 , ω ) = p GJ ( ω ) [ G ˆ ( y 0 x 0 , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 , ω ) ] + n = 0 2 n ( p GJ ( ω ) ( 2 p s ( ω ) 1 ) ) n + 1 ( 2 p GJ ( ω ) 1 ) × [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] .
(47)

Using this method of ‘words’, we can construct compact solution forms for the Green’s function for each of these two cells for any combinations of input, y, and output, x, locations. For example, placing x 0 in Cell 1 between its soma and the gap-junction we obtain

G ˆ 1 ( x 0 , y 0 , ω ) = ( 1 p GJ ( ω ) ) [ G ˆ ( y 0 x 0 , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 , ω ) ] + n = 0 2 n ( p GJ ( ω ) ( 2 p s ( ω ) 1 ) ) n + 1 ( 1 2 p GJ ( ω ) ) × [ G ˆ ( y 0 x 0 + 2 ( n + 1 ) L GJ , ω ) + ( 2 p s ( ω ) 1 ) G ˆ ( y 0 + x 0 + 2 ( n + 1 ) L GJ , ω ) ] .
(48)

4.2 Network Dynamics

To study the role of a gap-junction in this two-cell network model, we focus on the Green’s functions at the somas of these two cells in response to a stimulus at the location y 0 . Using Eqs. (47) and (48), we obtain the following somatic response functions:

G ˆ 1 ( 0 , y 0 , ω ) = 2 p s ( ω ) ( 1 p GJ ( ω ) ) G ˆ ( y 0 , ω ) + n = 0 2 n ( p GJ ( ω ) ( 2 p s ( ω ) 1 ) ) n + 1 ( 1 2 p GJ ( ω ) ) × 2 p s ( ω ) G ˆ ( y 0 + 2 ( n + 1 ) L GJ , ω ) ,
(49)

and

G ˆ 2 ( 0 , y 0 , ω ) = 2 p s ( ω ) p GJ ( ω ) G ˆ ( y 0 , ω ) + n = 0 2 n ( p GJ ( ω ) ( 2 p s ( ω ) 1 ) ) n + 1 ( 2 p GJ ( ω ) 1 ) × 2 p s ( ω ) G ˆ ( y 0 + 2 ( n + 1 ) L GJ , ω ) .
(50)

Resonant properties of each cell are analysed by studying a preferred frequency Ω 0 for each cell. This is defined as the frequency at which the corresponding power function, P 1 (ω)= | G ˆ 1 ( 0 , y 0 , ω ) | 2 for Cell 1 and P 2 (ω)= | G ˆ 2 ( 0 , y 0 , ω ) | 2 for Cell 2, reaches its maximum. This means that Ω 0 for each soma is simply a solution of one of the corresponding equations, P 1 (ω)/ω=0 and P 2 (ω)/ω=0.

In Fig. 13, we plot how this preferred frequency Ω 0 varies as a function of the distance of the gap-junction away from each soma. These plots are obtained for the case of a passive soma and resonant dendrites. In Fig. 14 we demonstrate how Ω 0 is affected if a resonant soma and passive dendrites are considered. Finally, in Fig. 15, we plot Ω 0 ( L GJ ) when each soma and dendritic branch is modelled with resonant membrane. All these three figures clearly demonstrate that the somatic response in each cell strongly depends on the location of the gap-junction and it is tuned to be maximised for different frequencies. This can be shown by applying a chirp stimulus at the location y 0 and plotting the somatic voltage for each cell (see Fig. 16). Resonances in each cell occur at different times as predicted by Fig. 15. All these figures are constructed for truncated series solutions (49), (50) when the index n increases up to 20, although it is possible to show that the solutions rapidly converge for a much smaller n such as n=10.

Fig. 13
figure 13

Values of Ω 0 at the soma of each cell as a function of L GJ when y 0 = L GJ +10 μm and R GJ =100 MΩ (red circles), R GJ =1000 MΩ (black crosses). Passive somas with parameters: diameter a s =25 μm, C s =1  μF/cm 2 , R s =2000Ω  cm 2 . Resonant dendrites (N=4) with parameters given in Fig. 4

Fig. 14
figure 14

Values of Ω 0 at the soma of each cell as a function of L GJ when y 0 = L GJ +10 μm and R GJ =100 MΩ (red circles), R GJ =1000 MΩ (black crosses). Resonant somas with parameters: diameter a s =25 μm, C s =1  μF/cm 2 , R s =2000Ω  cm 2 , r s =1Ω  cm 2 , L s =0.1  H cm 2 . Passive dendrites (N=4) with parameters given in Fig. 4

Fig. 15
figure 15

Values of Ω 0 at the soma of each cell as a function of L GJ when y 0 = L GJ +10 μm and R GJ =100 MΩ (red circles), R GJ =1000 MΩ (black crosses). Resonant somas with parameters: diameter a s =25 μm, C s =1  μF/cm 2 , R s =2000Ω  cm 2 , r s =1Ω  cm 2 , L s =0.1  H cm 2 . Resonant dendrites (N=4) with parameters given in Fig. 4

Fig. 16
figure 16

Voltage profiles in the somas of cells in response to a stimulus I chirp (t) applied at the location y 0 = L GJ +10 μm. Cells’ parameters as in Fig. 15, R GJ =100 MΩ, ω chirp =0.003, A chirp =1 nA. Black curves: L GJ =50 μm, green curves: L GJ =500 μm

5 Discussion

In this paper, we have generalised the “sum-over-trips” formalism for single dendritic trees to cover networks of gap-junction coupled resonant neurons. With the use of ideas from combinatorics, we have also introduced a so-called method of ‘words’ that allows for a compact representation of the Green’s function network response formulas. This has allowed us to determine that the position of a dendro-dendritic gap junction can be used to tune the preferred frequency at the cell body. Moreover we have been able to generate mathematical formula for this dependence without recourse to direct numerical simulations of the physical model. One clear prediction is that the preferred frequency increases with distance of the gap junction from the soma in a model with passive soma and resonant dendrites. In contrast for a system with a resonant soma and passive or resonant dendrite, the preferred frequency decreases as the gap junction is placed further away from the cell body.

There are a number of natural extensions of the work in this paper. One is an application to more realistic network geometries or more than just two neurons, as may be found in retinal networks. Here, it would also be interesting to exploit any network symmetries (either arising from the identical nature of the cells, their shapes, or the topology of their coupling) to allow for the compact representation of network response (and further utilising the method of ‘words’). Another is to incorporate a model of an active soma whilst preserving some measure of analytical tractability. Schwemmer and Lewis [21] have recently achieved this for a single unbranched cable model by coupling it to an integrate-and-fire soma model. The merger of our approach with theirs may pave the way for understanding spiking networks of gap junction coupled dendritic trees. Moreover, by using the techniques developed by them in [22] (using weakly coupled oscillator theory) we may further shed light on the role of dendro-dendritic coupling in contributing to the robustness of phase-locking in oscillatory networks.

Appendix A: Two Simplified Identical Cells with Passive Membrane

Equations (14)–(16) with γ 2 (ω)=(1/τ+ω)/D provide the solutions of a model in Fig. 2 with passive membrane. We introduce the function

F ˆ (x,ω,q)= 1 γ ( ω ) + q e γ ( ω ) | x | 2 D γ ( ω ) ,
(51)

and its inverse Laplace transform

F ( x , t , q ) = L 1 [ F ˆ ( x , ω , q ) ] = 1 2 e | x | q e ( q 2 D 1 / τ ) t erfc ( q D + | x | 2 D t ) Θ ( t ) .
(52)

Then the Green’s function on each segment can be found in closed form as

G m ( x , y , t ) = L 1 [ G ˆ m ( x , y , ω ) ] = 1 C [ G ( x y , t ) r a 2 R GJ F ( x + y , t , r a / R ) ] ,
(53)
G m + ( x , y , t ) = L 1 [ G ˆ m + ( x , y , ω ) ] = 1 C [ G ( x + y , t ) r a 2 R GJ F ( x + y , t , r a / R ) ] ,
(54)
G n ± ( x , y , t ) = L 1 [ G ˆ n ± ( x , y , ω ) ] = 1 C [ r a 2 R GJ F ( x + y , t , r a / R ) ] ,
(55)

where G (x,t) is the Green’s function of the passive infinite dendritic cable,

G (x,t)= L 1 [ e γ ( ω ) | x | 2 D γ ( ω ) ] = 1 4 π D t e t / τ e x 2 / ( 4 D t ) Θ(t).
(56)

If an external stimulus I inj , m (x,t)=δ(xy)I(t) has a form of a rectangular pulse with I(t)= η 0 Θ(t)Θ( τ R t), the voltage response on each segment can also be found in closed form:

V m ( x , t ) = [ B ( x y , t ) B ( x y , t τ R ) ( P ( x + y , t ) P ( x + y , t τ R ) ) ] / C ,
(57)
V m + ( x , t ) = [ B ( x + y , t ) B ( x + y , t τ R ) ( P ( x + y , t ) P ( x + y , t τ R ) ) ] / C ,
(58)
V n ± (x,t)= [ P ( x + y , t ) P ( x + y , t τ R ) ] /C,
(59)

where

B ( x , t ) = η 0 4 D / τ [ e | x | / D τ erfc ( | x | 2 D t t / τ ) e | x | / D τ erfc ( | x | 2 D t + t / τ ) ] Θ ( t ) ,
(60)
P(x,t)= η 0 r a 2 D R GJ [ a F ( x , t , r a / R GJ ) + b F ( x , t , ε ) + c F ( x , t , ε ) ] ,
(61)

and

ε = 1 D τ , a = 1 ( r a / R GJ ) 2 ε , b = 1 2 ε ( ε r a / R GJ ) , c = 1 2 ε ( ε + r a / R GJ ) .
(62)

These solutions generalise earlier results of Harris and Timofeeva [23] applicable to a neural network, but with gap-junctional coupling at tip-to-tip contacts of two branches.

Appendix B: Proof of the “Sum-over-Trips” Rules at the Gap Junction

As the Green’s function is constructed in the Laplace domain, the rules at the gap-junction need to satisfy the following boundary conditions (after a length of each branch, say labelled by k, of the tree is re-scaled as X= γ k (ω)x, x[0, L k ]):

G m j (0,Y,ω)= G m + j (0,Y,ω),
(63)
G n j (0,Y,ω)= G n + j (0,Y,ω),
(64)

and

γ m ( ω ) r a , m ( G m j X | X = 0 + G m + j X | X = 0 ) = g GJ ( G m j ( 0 , Y , ω ) G n j ( 0 , ω ) ) ,
(65)
γ n ( ω ) r a , n ( G n j X | X = 0 + G n + j X | X = 0 ) = g GJ ( G n j ( 0 , Y , ω ) G m j ( 0 , Y , ω ) ) .
(66)

We prove here that the rules for generating the trip coefficients are consistent with these boundary conditions.

Let X denote the distance away from the GJ node along the segment m (see Fig. 17). The location of the stimulus Y= γ j (ω)y, the segment number j and the variable ω are all considered to be arbitrary. Suppose that we sum all the trips starting from the GJ node itself and ending at point Y on branch j. We denote the result of summing over all trips that initially leave the GJ node along segment m by Q m j (0,Y,ω), along segment m + by Q m + j (0,Y,ω), along segment n by Q n j (0,Y,ω) and along segment n + by Q n + j (0,Y,ω).

Fig. 17
figure 17

The GJ node with possible trips in its proximity

Trips that start out from X and move away from the GJ node are identical to trips that start out from the GJ node itself along segment m . The only difference is that the trips in the first case are shorter by the length X. We denote the sum of such shortened trips by Q m j (X,Y,ω). The argument −X means that a distance X has to be subtracted from the length of each trip summed to compute (and not that the trips start at the point −X).

Trips that start out from X by moving toward the GJ node and then reflecting back along segment m are also identical to trips that start out from the GJ node along segment m except that these are longer by the length X. In addition, because of the reflection from the GJ node these trips pick up a factor p GJ , n (ω) according to the “sum-over-trips” rules. Therefore, the contribution to the solution G m j (X,Y,ω) from those trips is p GJ , n (ω) Q m j (X,Y,ω). Trips that start out from X by moving toward the GJ node and then continue moving along branch m, i.e. on segment m + , pick up a factor 1 p GJ , n (ω) and the sum of such trips is given by (1 p GJ , n (ω)) Q m + j (X,Y,ω). Finally, trips that start from X, move toward the GJ node and then leave the GJ node by moving out along segment n or n + pick up a factor p GJ , n (ω) and contribute to the solution G m j (X,Y,ω) by the terms p GJ , n (ω) Q n j (X,Y,ω) or p GJ , n (ω) Q n + j (X,Y,ω).

The full solution G m j (X,Y,ω) includes the contributions from all different types of trips we have been discussing. Thus,

G m j ( X , Y , ω ) = 1 D j γ j ( ω ) [ Q m j ( X , Y , ω ) + ( p GJ , n ( ω ) ) Q m j ( X , Y , ω ) + ( 1 p GJ , n ( ω ) ) Q m + j ( X , Y , ω ) + p GJ , n ( ω ) Q n j ( X , Y , ω ) + p GJ , n ( ω ) Q n + j ( X , Y , ω ) ] .
(67)

The functions in this formula consist of infinite sums over trips, but we do not need to know what they are to show that the solution G m j (X,Y,ω) satisfies the GJ node boundary conditions. At the GJ node, we have

G m j ( 0 , Y , ω ) = 1 D j γ j ( ω ) [ ( 1 p GJ , n ( ω ) ) Q m j ( 0 , Y , ω ) + ( 1 p GJ , n ( ω ) ) Q m + j ( 0 , Y , ω ) + p GJ , n ( ω ) ( Q n j ( 0 , Y , ω ) + Q n + j ( 0 , Y , ω ) ) ] .
(68)

Considering the solution G m + j (0,Y,ω) instead gives us the same expression as in (68) and, therefore, G m j (X,Y,ω) obeys the boundary condition (63). Similarly, we can show that

G n j ( 0 , Y , ω ) = G n + j ( 0 , Y , ω ) = 1 D j γ j ( ω ) [ ( 1 p GJ , m ( ω ) ) Q n j ( 0 , Y , ω ) + ( 1 p GJ , m ( ω ) ) Q n + j ( 0 , Y , ω ) + p GJ , m ( ω ) ( Q m j ( 0 , Y , ω ) + Q m + j ( 0 , Y , ω ) ) ] ,
(69)

which satisfies the boundary condition (64).

To prove the boundary condition (65) we use Eq. (67) to find that

G m j X | X = 0 = 1 D j γ j ( ω ) [ Q m j ( X , Y , ω ) X | X = 0 p GJ , n ( ω ) Q m j ( X , Y , ω ) X | X = 0 + ( 1 p GJ , n ( ω ) ) Q m + j ( X , Y , ω ) X | X = 0 + p GJ , n ( ω ) ( Q n j ( X , Y , ω ) X | X = 0 + Q n + j ( X , Y , ω ) X | X = 0 ) ] .
(70)

Using the following properties for the term Q k j (X,Y,ω), k{ m , m + , n , n + },

Q k j ( X , Y , ω ) X = Q k j (X,Y,ω),
(71)
Q k j ( X , Y , ω ) X = Q k j (X,Y,ω),
(72)

Eq. (70) can be simplified as

G m j X | X = 0 = ( 1 + p GJ , n ( ω ) ) Q m ( 0 , Y , ω ) ( 1 p GJ , n ( ω ) ) Q m + ( 0 , Y , ω ) p GJ , n ( ω ) ( Q n ( 0 , Y , ω ) + Q n + ( 0 , Y , ω ) ) .
(73)

Similarly,

G m + j X | X = 0 = ( 1 + p GJ , n ( ω ) ) Q m + ( 0 , Y , ω ) ( 1 p GJ , n ( ω ) ) Q m ( 0 , Y , ω ) p GJ , n ( ω ) ( Q n ( 0 , Y , ω ) + Q n + ( 0 , Y , ω ) ) .
(74)

Substituting (73) and (74) together with (68) and (69) in Eq. (65) gives us the right equality. Similarly, we can prove the boundary condition (66).

References

  1. Cajal R: Significación fisiológica de las expansiones protoplásmicas y nerviosas de la sustancia gris. Revista de ciencias medicas de Barcelona 1891, 22: 23.

    Google Scholar 

  2. Segev I, Rinzel J, Shepherd GM (Eds): The Theoretical Foundations of Dendritic Function: Selected Papers of Wilfrid Rall with Commentaries. MIT Press, Cambridge; 1995.

    Google Scholar 

  3. Mainen ZF, Sejnowski TJ: Influence of dendritic structure on firing pattern in model neocortical neurons. Nature 1996, 382: 363–366. 10.1038/382363a0

    Article  Google Scholar 

  4. van Ooyen A, Duijnhouwer J, Remme MWH, van Pelt J: The effect of dendritic topology on firing patterns in model neurons. Network 2002, 13: 311–325. 10.1088/0954-898X/13/3/304

    Article  Google Scholar 

  5. Spruston N, Stuart G, Häusser M: Dendritic integration. In Dendrites. Oxford University Press, New York; 2008.

    Google Scholar 

  6. Hormuzdi SG, Filippov MA, Mitropoulou G, Monyer H, Bruzzone R: Electrical synapses: a dynamic signaling system that shapes the activity of neuronal networks. Biochim Biophys Acta 2004, 1662: 113–137. 10.1016/j.bbamem.2003.10.023

    Article  Google Scholar 

  7. Bennet MVL, Zukin RS: Electrical coupling and neuronal synchronization in the mammalian brain. Neuron 2004, 41: 495–511. 10.1016/S0896-6273(04)00043-1

    Article  Google Scholar 

  8. Carlen PL, Zhang FSL, Naus C, Kushnir M, Velazquez JLP: The role of gap junctions in seizures. Brains Res Rev 2000, 32: 235–241. 10.1016/S0165-0173(99)00084-3

    Article  Google Scholar 

  9. Traub RD, Whittington MA, Buhl EH, LeBeau FEN, Bibbig A, Boyd S, Cross H, Baldeweg T: A possible role for gap junctions in generation of very fast EEG oscillations preceding the onset of, and perhaps initiating, seizures. Epilepsia 2001, 42(2):153–170.

    Article  Google Scholar 

  10. Nakase T, Naus CCG: Gap junctions and neurological disorders of the central nervous system. Biochim Biophys Acta, Biomembr 2004, 1662(1–2):149–158.

    Article  Google Scholar 

  11. Söhl G, Maxeiner S, Willecke K: Expression and functions of neuronal gap junctions. Nat Rev, Neurosci 2005, 6: 191–200.

    Article  Google Scholar 

  12. Bem T, Rinzel J: Short duty cycle destabilizes a Half-Center oscillator, but gap junctions can restabilize the anti-phase pattern. J Neurophysiol 2004, 91: 693–703.

    Article  Google Scholar 

  13. Traub RD, Kopell N, Bibbig A, Buhl EH, LeBeau FEN, Whittington MA: Gap junctions between interneuron dendrites can enhance synchrony of gamma oscillations in distributed networks. J Neurosci 2001, 21: 9478–9486.

    Google Scholar 

  14. Saraga F, Ng L, Skinner FK: Distal gap junctions and active dendrites can tune network dynamics. J Neurophysiol 2006, 95: 1669–1682. 10.1152/jn.00662.2005

    Article  Google Scholar 

  15. Abbott LF, Fahri E, Gutmann S: The path integral for dendritic trees. Biol Cybern 1991, 66: 49–60. 10.1007/BF00196452

    Article  Google Scholar 

  16. Abbott LF: Simple diagrammatic rules for solving dendritic cable problems. Physica A 1992, 185: 343–356. 10.1016/0378-4371(92)90474-5

    Article  Google Scholar 

  17. Coombes S, Timofeeva Y, Svensson CM, Lord GJ, Josic K, Cox SJ, Colbert CM: Branching dendrites with resonant membrane: a “sum-over-trips” approach. Biol Cybern 2007, 97: 137–149. 10.1007/s00422-007-0161-5

    Article  MathSciNet  Google Scholar 

  18. Hutcheon B, Miura RM, Puil E: Models of subthreshold membrane resonance in neocortical neurons. J Neurophysiol 1996, 76: 698–714.

    Google Scholar 

  19. Magee JC: Dendritic hyperpolarization-activated currents modify the integrative properties of hippocampal CA1 pyramidal neurons. J Neurosci 1998, 18: 7613–7624.

    Google Scholar 

  20. Mauro A, Conti F, Dodge F, Schor R: Subthreshold behavior and phenomenological impedance of the squid giant axon. J Gen Physiol 1970, 55: 497–523. 10.1085/jgp.55.4.497

    Article  Google Scholar 

  21. Schwemmer MA, Lewis TJ: Bistability in a leaky integrate-and-fire neuron with a passive dendrite. SIAM J Appl Dyn Syst 2012, 11: 507–539. 10.1137/110847354

    Article  MathSciNet  Google Scholar 

  22. Schwemmer MA, Lewis TJ: The robustness of phase-locking in neurons with dendro-dendritic electrical coupling. J Math Biol 2012. 10.1007/s00285-012-0635-5

    Google Scholar 

  23. Harris J, Timofeeva Y: Intercellular calcium waves in the fire-diffuse-fire framework: Green’s function for gap-junctional coupling. Phys Rev E 2010., 82: Article ID 051910 Article ID 051910

    Google Scholar 

Download references

Acknowledgements

YT would like to acknowledge the support provided by the BBSRC (BB/H011900) and the RCUK. DM would like to acknowledge the Complexity Science Doctoral Training Centre at the University of Warwick along with the funding provided by the EPSRC (EP/E501311).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yulia Timofeeva.

Additional information

Competing Interests

The authors declare that they have no competing interests.

Authors’ Contributions

YT, SC and DM contributed equally. All authors read and approved the final manuscript.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Timofeeva, Y., Coombes, S. & Michieletto, D. Gap Junctions, Dendrites and Resonances: A Recipe for Tuning Network Dynamics. J. Math. Neurosc. 3, 15 (2013). https://doi.org/10.1186/2190-8567-3-15

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/2190-8567-3-15

Keywords