Computational Convergence of the Path Integral for Real Dendritic Morphologies
 Quentin Caudron^{1, 2}Email author,
 Simon R Donnelly^{3},
 Samuel PC Brand^{1, 4} and
 Yulia Timofeeva^{1, 2}
https://doi.org/10.1186/21908567211
© Q. Caudron et al.; licensee Springer 2012
Received: 19 June 2012
Accepted: 11 September 2012
Published: 22 November 2012
Abstract
Neurons are characterised by a morphological structure unique amongst biological cells, the core of which is the dendritic tree. The vast number of dendritic geometries, combined with heterogeneous properties of the cell membrane, continue to challenge scientists in predicting neuronal inputoutput relationships, even in the case of subthreshold dendritic currents. The Green’s function obtained for a given dendritic geometry provides this functional relationship for passive or quasiactive dendrites and can be constructed by a sumovertrips approach based on a path integral formalism. In this paper, we introduce a number of efficient algorithms for realisation of the sumovertrips framework and investigate the convergence of these algorithms on different dendritic geometries. We demonstrate that the convergence of the trip sampling methods strongly depends on dendritic morphology as well as the biophysical properties of the cell membrane. For real morphologies, the number of trips to guarantee a small convergence error might become very large and strongly affect computational efficiency. As an alternative, we introduce a highlyefficient matrix method which can be applied to arbitrary branching structures.
Keywords
Dendrites Path integral Sumovertrips Morphology Dendritic computation1 Introduction
Discovered more than a century ago by Santiago Ramón y Cajal [1], dendrites form the vast majority of the surface area of a neuron, with the dendritic trees of some motoneurons representing up to 97% of total neuronal surface area and 75% of the total neuronal volume [2]. These complex branching structures are responsible for transferring electrical activity between synapses and the soma. As technology evolved, interest in dendrites began to gather momentum, with the invention of sharp micropipette electrodes in the early 1950s allowing intracellular recordings to be made. It was the breakthrough work of Wilfrid Rall [3] on the application of cable theory to dendritic modelling that provided significant insight into the role of dendrites in processing synaptic inputs, the historical perspective of which is summarised in a book by Segev, Rinzel and Shepherd [4]. Recent experimental and theoretical studies reinforce the fact that dendritic morphology and membrane properties play an important role in dendritic integration [5, 6]. We refer the reader to the book Dendrites [7], devoted exclusively to these formations and revealing their biological complexity at different scales.
It has also been known for some time that nonlinear voltagegated ion channels are present in the dendrites of various types of neurons [8], and many recent dendritic models are constructed by combining the linear (passive) properties of dendrites together with nonlinear (active) dynamics of membrane channels. Although the nonlinear properties of ion channels contribute considerably to neuronal inputoutput relations, it is important to recognise that the passive properties of dendritic membranes provide the fundamental core for signal filtration and integration, and thus remain an essential component in understanding electrical signalling in dendrites [9].
When branched dendritic fibres are modelled by passive cable equations, the voltage response across the branching structure for any form of applied current can be calculated via a convolution operation, as long as the Green’s function for the given dendritic tree is found. This approach provides an alternative to the compartmental method, based on the discrete spatial approximation of the potential [10, 11]. It is not always trivial to construct such a Green’s function for realistic dendritic geometries. Arbitrarilybranching systems are inherently difficult to solve, a fact recognised early by Rall, who proposed a method of mapping the branching structure onto an equivalent cylinder provided that certain geometrical restrictions were satisfied [12]. The work of Koch and Poggio [13], based on the graphical calculus of Butz and Cowan [14], focused on the calculation of the response function for complete dendritic trees in the Laplace (frequency) domain. Later, Rall’s method of equivalent cylinders was extended by releasing the constraints on diameters of individual branches and by constructing the Green’s function, again in the Laplace domain [15, 16]. An alternative method for constructing the Green’s function for a branching structure with a shunted soma was proposed by Evans and coauthors [17–19]. In this series of papers, the response function was found in the form of an eigenfunction expansion, which converges particularly rapidly for large times. For smaller times, a Laplacedomain series solution provides better accuracy, agreeing well with an earlier “sumovertrips” method for constructing the Green’s function directly in the time domain, proposed by Abbott et al. [20]. This sumovertrips framework is built on a path integral formulation and enables the calculation of the Green’s function on an arbitrary dendritic geometry as a convergent infinite series solution. Cao and Abbott [21] presented an algorithm for a computational realisation of the sumovertrips approach, based on the division of trips into four classes. They applied this algorithm to a number of sample dendritic trees, the largest of which had 22 branches, in contrast to real dendritic geometries, which might have more than 400 terminals alone [22], with a large variation in branch length. This complexity in neuronal morphologies across different types of neurons is expected to affect the convergence of computational implementations of the sumovertrips framework.
In this paper, we introduce and investigate a number of efficient algorithms for calculating the Green’s function on dendritic trees using the sumovertrips formalism. In Sect. 2, we review the theoretical framework and the fourclasses algorithm of Cao and Abbott [21], and introduce alternative algorithms for the sumovertrips method in Sect. 3. We begin with a modification on the fourclasses algorithm aimed at improving its time complexity by developing a formal grammar to derive the trips. Then, a lengthpriority ordering of the trips using Eppstein’s algorithm [23] for finding the k shortest trips on a graph is proposed. We also derive a stochastic approach for sampling trips on the tree based on a MonteCarlo approach. Finally, a highlyefficient deterministic method for discretised tree structures is described. We assess the convergence of the introduced algorithms on different dendritic geometries in Sect. 4, where we also compare the delay and attenuation of voltage spread on four reconstructed dendritic morphologies. Finally, in Sect. 5, we provide a discussion of our results, as well as possible extensions of this work.
2 The Sumovertrips Framework
where $x={L}_{k}$ is a terminal on branch k.
where ${L}_{\mathrm{trip}}={L}_{\mathrm{trip}}(x/{\lambda}_{i},y/{\lambda}_{j})$ is the length of a trip along the tree that starts at point $x/{\lambda}_{i}$ on branch i and ends at point $y/{\lambda}_{j}$ on branch j. Note that the length of each branch needs to be scaled by its own electrotonic space constant before ${L}_{\mathrm{trip}}$ is calculated for Eq. (6). A constructed trip is allowed to reflect on or pass through any node on the tree an arbitrary number of times. The coefficients ${A}_{\mathrm{trip}}$ depend on the constructed trip and are determined according to the following rules [20]:

From any starting point, ${A}_{\mathrm{trip}}=1$.

For every node at which the trip passes from branch m to branch k where $m\ne k$, ${A}_{\mathrm{trip}}$ is multiplied by a factor $2{p}_{k}$.

For every node at which the trip reflects along on a node back onto the same branch n, ${A}_{\mathrm{trip}}$ is multiplied by a factor $2{p}_{n}1$.

For every terminal, ${A}_{\mathrm{trip}}$ is multiplied by +1 for the closedend boundary condition or by −1 for the openend boundary condition.
However, note that the sumovertrips method for constructing the Green’s function in the time domain only works for uniform characteristic time constant τ across the entirety of the dendritic tree. The generalisation of this framework to support a quasiactive membrane, instead of a passive membrane, releases this restriction and different cell membrane properties can be chosen on each branch [24]. However, this means that the construction of the Green’s function as an infinite series solution can only be performed in the Laplace domain.
where ${x}_{j}$ is a location of a stimulus ${I}_{j}(t)$ on branch j.
The Green’s function calculated by Eq. (5) for any branching structure with finite length branches includes an infinite number of terms. It is possible to show that this infinite series solution converges faster than ${\mathrm{e}}^{k}$, for sufficientlyhigh k, the number of nodes visited by the trip. We demonstrate this in the Appendix for an arbitrary tree with nodes of degree $d=3$ or less. This generalises Abbott’s convergence analysis [25], where it was shown that, for an infinite binary tree, the sum of coefficients ${A}_{\mathrm{trip}}$ is $\mathcal{O}(1)$ for trips visiting any number of nodes.
2.1 FourClasses Algorithm
Cao and Abbott [21] introduced an algorithm for constructing the Green’s function using the sumovertrips method. Their algorithm is based on finding the shortest trips between any two points of measurement x and current injection y on a tree. Starting from the most direct, shortest trip from x to y, passing through the minimum number of nodes, four classes of trips are defined by allowing a trip to leave the point x in either direction and approach y from either direction along their respective branches. These initial trips, therefore, form the first and shortest trips in their respective classes; longer trips are generated incrementally from these. New additional trips can pass the points x and y any number of times and are allowed to change direction at any node. We will refer to this method as the fourclasses algorithm.
From these main trips, the fourclasses algorithm generates all $x\to y$ trips by inserting what are described as “excursions” into the trips. If A and B are adjacent nodes in a tree, then an excursion could be added to the trip $xBy$ to generate the trip $xBABy$, representing a reflection on node B towards A, reflecting at the terminal A back towards B, passing through this node and finally onto point y. This process can be iterated indefinitely, generating a trip with two more nodes each time. If this process is applied to every node on every trip with n and $n+1$ nodes, then every trip with $n+2$ and $n+3$ nodes will be generated. Thus, from the four shortest $x\to y$ trips on the tree, it is possible to construct all trips up to some threshold number of nodes in length explicitly. The lengths and coefficients of these trips can then be calculated from their full trip descriptions, allowing the Green’s function given by Eq. (5) to be approximated.
3 Algorithmic Realisations
Here, we suggest possible modifications to the fourclasses algorithm of Cao and Abbott [21] as well as introduce novel alternative algorithms for the sumovertrips formalism.
3.1 Formal Language Theory Approach
This problem can be avoided by assigning each branch a direction. If the branch AB is given the direction $\overrightarrow{BA}$, then the excursion $A\to ABA$ is disallowed. The choice of direction for each branch is unambiguous on acyclic structures: apart from the branch on which x is found, each branch must be directed away from x. The branch upon which x resides is directed away from y. This ensures that each node has a sequence of excursions that allow the algorithm to generate trips including it. The allocation of direction to each branch can be performed before the process of generating trips and may coincide with finding the four main classes of trips. These modifications require that the graph be acyclic, since “away from a point” is not generally definable on a graph with cycles. There do exist cyclic graphs for which an unambiguous grammar can generate the language of $x\to y$ trips, but these are not relevant to the study of single dendritic trees.
The two presented modifications of the fourclasses algorithm are sufficient to prevent the generation of any duplicate trips, without any trips being missed. Together, they provide an unambiguous contextfree grammar generating the language of $x\to y$ trips.
3.2 LengthPriority Method
Since the coefficients ${A}_{\mathrm{trip}}$ decay at most with ${\mathrm{e}}^{{L}_{\mathrm{trip}}}$ (although the number of trips increases with ${\mathrm{e}}^{{L}_{\mathrm{trip}}}$), the dominating term in the Green’s function (5) is the exponential decay ${\mathrm{e}}^{{L}_{\mathrm{trip}}^{2}}$ in ${G}_{\mathrm{\infty}}$. The fourclasses algorithm [21] does not generate trips in monotonic order in length, since trips are constructed by adding the same excursion to all four classes of trips. If, for example, a Class 2 trip is significantly longer than its Class 1 counterpart, due to x being along a long edge but close to a node, then a longer Class 2 trip will be generated before a potentially shorter Class 1 trip having an additional excursion on a shorter branch. In general, trips are likely to be disordered in length if the branches upon which x or y reside are substantially longer than at least one other branch on the tree, or if x or y are much closer to one of their adjacent nodes than to the other.
Here, we propose to realise the sumovertrips framework by a lengthpriority method. In this implementation, trips are generated and the corresponding terms ${A}_{\mathrm{trip}}{G}_{\mathrm{\infty}}({L}_{\mathrm{trip}},t)$ are added to the infinite series solution (5) in monotonic order in length ${L}_{\mathrm{trip}}$. This is achieved by incorporating Eppstein’s algorithm [23] for finding the k shortest trips on a graph in $\mathcal{O}(m+nlogn+k)$ time, with n being the number of nodes and m the number of edges on the branching structure.
Both the fourclasses algorithm and the improvements described in the languagetheoretic approach rely on storing trips explicitly as sequences of nodes. This consumes $\mathcal{O}(kn)$ space and time for k trips with n nodes but allows onthefly calculation of coefficients ${A}_{\mathrm{trip}}$. This is contrary to Eppstein’s algorithm [23], which stores trips using an implicit representation and allows us to find the k shortest trips implicitly using only $\mathcal{O}(1)$ space and time for each trip. The current implementation, based on Eppstein’s algorithm, requires $\mathcal{O}(kn)$ time to calculate coefficients despite the savings on space due to the implicit trip representation. However, Eppstein provides a method for computing any property that can be described by a monoid in $\mathcal{O}(1)$ time per trip. Such a description of coefficient calculation exists, and its use would supplement the current $\mathcal{O}(kn)$ to $\mathcal{O}(k)$ decrease in space requirements with an analogous decrease in time complexity. The savings in space already allow the lengthpriority method to scale better than the fourclasses algorithm.
3.3 MonteCarlo Method
The path integral formulation of the solution to the cable equation introduced by Abbott et al. [20] is derived via consideration of a Feynman–Kac representation of the solution in terms of random walkers on the dendritic geometry. Hence, it is natural to consider MonteCarlo approaches to evaluating this path integral. Instead of a lengthordered series solution as provided by the lengthpriority approach, the Green’s function (5) can be constructed using a stochastic algorithm. The aim of this approach is to sample from trips $x\to y$ in such a way that the probabilistically more likely samples coincide with the trips that contribute most to the series solution (5).
where $P(\omega )$ is the probability of the realisation ω, and $\mathbb{E}$ denotes the expectation operator. Therefore, the MonteCarlo strategy is to sample, sequentially or in parallel, the random function $\tilde{A}$ in order to construct this expectation.
3.4 Matrix Method
where the sum over l is over all possible trip lengths ${L}_{\mathrm{trip}}$. On a dendritic tree, discretised as in compartmental models [10] or in a manner similar to the discretisation of the tree into segments in NEURON [26], grouping trips according to their lengths allows us to count the number of trips of a given length l without having to explicitly construct them.
This method uses a modified directed edge adjacency matrix of the discretised tree in order to compute the sum of coefficients of trips of a given length. It requires all compartments to have the same fixed length Δx, although this restriction can be relaxed in a generalisation presented at the end of this section. The extremities of compartments define the position of nodes; there is a directed edge in both directions between adjacent nodes.
We begin by defining $\mathcal{V}$ as the set of nodes and ℰ as the set of directed edges in the discretised tree. Edges are ordered pairs of nodes: $e=(u,v)\in \mathcal{E}$ is a directed edge from u to v, with $u,v\in \mathcal{V}$. For any edge $e=(u,v)$, we denote the reverse edge by ${e}^{\prime}=(v,u)$. Trips are taken to begin from a point x along a starting edge $s=({s}_{1},{s}_{2})$ and end at a point y along a goal edge $g=({g}_{1},{g}_{2})$ for $s,g\in \mathcal{E}$. We say that $x\in s$ or $x\in ({s}_{1},{s}_{2})$ if x resides along edge $s=({s}_{1},{s}_{2})$. Based on the locations of $x\in s$ and $y\in g$, the orientations of s and g are defined such that the shortest $x\to y$ trip satisfies $x\to {s}_{2}\to \cdots \to {g}_{1}\to y$. Therefore, the shortest $x\to y$ trip always starts on edge s, that is, in the ${s}_{1}\to {s}_{2}$ direction, and approaches y along the edge g, in the ${g}_{1}\to {g}_{2}$ direction. This is equivalent to a Class 1 trip; Class 2 trips leave x along the ${s}^{\prime}=({s}_{2},{s}_{1})$ edge, arrive at $y\in g$; Class 3 trips go from $x\in s$ to $y\in {g}^{\prime}$; Class 4 trips, finally, go from $x\in {s}^{\prime}$ to $y\in {g}^{\prime}$. The locations of the points $x\in s$ and $y\in g$ along their respective edges are given as a fraction of the branch length such that $x\mathrm{\Delta}x$ denotes the distance from x to ${s}_{2}$ and $y\mathrm{\Delta}x$ is the distance between node ${g}_{1}$ and point y. We distinguish between k, the number of edges travelled in a particular trip, from the length of the trip ${L}_{\mathrm{trip}}$. Because x and y reside along their respective edges, the total length of a trip that travels along k edges is less than if the full distance along k edges had been travelled. That is, ${L}_{\mathrm{trip}}<k\mathrm{\Delta}x$ for any combination of x, y and for all k.
Because the set of edges ℰ is both ordered and finite, then ${\mathbf{c}}_{k}^{s}=({c}_{k}^{s}({e}_{1}),\dots ,{c}_{k}^{s}({e}_{\mathcal{E}}))\in {\mathbb{R}}^{\mathcal{E}}$ can be thought of as a vector, where ${e}_{i}\in \mathcal{E}$ for $i=1,\dots ,\mathcal{E}$. The i th element of the vector ${\mathbf{c}}_{k}^{s}$ corresponds to the sum of coefficients ${A}_{\mathrm{trip}}$ for all trips originating at x on s and ending along the i th edge ${e}_{i}$, having travelled over k edges. The vector ${\mathbf{c}}_{1}^{s}$ consists mostly of zeros, with a one only in the entry corresponding to the edge s, as the coefficient of moving in this direction remains 1, while all other moves are invalid by travelling over only one edge, and hence have coefficient 0.
Note that the above rules apply to the transpose of ${Q}_{ij}$.
By selecting a small Δx, branches may be approximated by a discretisation using an integer number of edges of length Δx. As in compartmental models, this allows the full morphology of the dendritic tree to be approximated, in a tradeoff between high speed (large Δx) and accuracy (small Δx). As $\mathrm{\Delta}x\to 0$, however, this approach tends to the computational complexity of naively integrating the cable equation using numerical methods. As in numerical simulations, where reducing Δx in order to increase accuracy brings about a necessary and associated change in Δt, the same is true of the matrix method: selecting a small Δx and hence increasing $\mathcal{E}$, implies that ${k}_{\mathrm{max}}$ must be increased.
This algorithm can be generalised to accept several discrete edge lengths $\mathrm{\Delta}{x}_{1},\dots ,\mathrm{\Delta}{x}_{n}$, at an exponential cost in the number of different lengths n, allowing “caricature” neurons to be constructed from a small number of different edge lengths. Our description of this method is focused on the case where x and y are located on different branches. For computations where x and y are required to exist on the same edge, the edges can be discretised such that x and y appear on different segments. In all cases with bounded node degree, Q is a sparse matrix with only a few entries per row, and $\mathcal{O}(\mathcal{E})$ entries altogether, making the complexity for the calculation of all coefficients $\mathcal{O}(\mathcal{E}{k}_{\mathrm{max}})$ by using highlyefficient sparse linear algebra algorithms.
3.4.1 Example calculation
4 Convergence of Methods
The computational convergence of any algorithm impacts both the accuracy of its results and the speed at which these results are obtained. While the series solution to the Green’s function (5) is proven to converge for a sufficientlyhigh number of terms (see the Appendix), this assumes optimal ordering of terms in the solution. Because the coefficients ${A}_{\mathrm{trip}}$ are impossible to compute until a trip is constructed, generating terms for the series solution in descending order of magnitude is inherently difficult. The fourclasses, lengthpriority and matrix methods generate trips in order of increasing ${L}_{\mathrm{trip}}$, with the aim of ordering trips by their ${G}_{\mathrm{\infty}}({L}_{\mathrm{trip}},t)$ terms, which decreases monotonically in the length of the trip. The MonteCarlo method uses a stochastic method to order trips by their probabilities, with more likely trips contributing more to (5). However, none of these approaches order the trips optimally, and hence their accuracy relies not on the theoretical convergence of the mathematical method, but on the computational convergence of the algorithm that implements it.
where T is the final simulation time, ${V}^{\ast}(x,y,t)$ is NEURON’s numerical solution to very high accuracy and ${V}_{N}={\int}_{0}^{T}{V}^{\ast}(x,y,t)\phantom{\rule{0.2em}{0ex}}\mathrm{d}t$ is the integral of the accurate NEURON solution. This convergence measure is therefore relative to the amplitude of the “real” solution, and thus errors ε are comparable between different neuronal types.
Parameter sets of the binary tree in Fig. 4A
Parameter set A  Parameter set B  Parameter set C  

Branch length L  0.3  50 μm  100 μm 
Branch diameter a  0.05  1 μm  1 μm 
Diffusion coefficient D  1  $2.5\times {10}^{4}{\text{\mu m}}^{2}{\text{\hspace{0.17em}ms}}^{1}$  $2.5\times {10}^{4}{\text{\mu m}}^{2}{\text{\hspace{0.17em}ms}}^{1}$ 
Membrane time constant τ  1  3.3 ms  3.3 ms 
Membrane capacitance C  1  $1{\text{\mu F\hspace{0.17em}cm}}^{2}$  $1{\text{\mu F\hspace{0.17em}cm}}^{2}$ 
Lengthpriority method on a binary tree: number of trips required for a given accuracy
Binary tree  Relative error threshold ε  

0.1  0.05  0.01  0.001  
Parameter set A  3,240  8,750  1,820,000  >5 × 10^{7} 
Parameter set B  825  2,600  129,000  >5 × 10^{7} 
Parameter set C  22  65  815  7,700 
Figures 5D–G show ε for the structures in Figs. 4B–E respectively. They demonstrate that convergence is nontrivial on complex branching structures. Figure 5D shows that the lengthpriority method makes consistently less error on the amacrine cell geometry, in contrast to the convergence of the Purkinje cell, shown in Fig. 5E, where the fourclasses method generates less error for all numbers of trips. Both of these show strongly irregular convergence and highamplitude oscillation in the errors ε in the amacrine cell. For both methods, the Purkinje cell shows a plateau in error for Green’s functions with few trips, indicating that either these trips are of small magnitude or that their voltage traces alternate between undershooting or overshooting the correct solution between subsequent trips. This indicates that neither the lengthpriority or the fourclasses methods are good heuristics for ordering terms in the Green’s function. This is further hinted at by the oscillating property of the error, which implies that there are regions where trips that increase the error are more frequent than trips that reduce it.
The pyramidal cell’s convergence shows very discontinuous behaviour (Fig. 5F), particularly in the lengthpriority method. The large jump in error when approximately 350 trips are included in the Green’s function was found to be caused by the first and shortest Class 2 trip included thus far, with all prior trips belonging to Class 1. This behaviour is likely to arise if there exist very short branches along the shortest and most direct $x\to y$ trip, and thus many Class 1 trips are generated first, being shorter than the first Class 2 trip. Whilst one of the motivating reasons for considering a lengthpriority approach was to generate trips fully by length order, this heuristic makes no attempt to include the coefficient ${A}_{\mathrm{trip}}$ in its ordering. This is an example of a pathologically large change in the coefficients value for a Class 2 trip which contributes a very significant amount to the Green’s function. The fourclasses approach, which enforces generation of trips of all four classes at every added excursion, does not show such a drastic drop in error. However, the error plot is still very discontinuous, and this may be a characteristic of situations as we have just described, where points x and y are placed on branches having a very different length to those on the most direct $x\to y$ trip, or when these points are placed very close to a node. Whether injection and measurement points are located on branches that are significantly longer or shorter than those along the shortest $x\to y$ trip, both the fourclasses and the lengthpriority methods will generate trips in an “unnatural” order, subsampling the trips where current will spread the most, but oversampling in areas of the tree with very short branches. This pathological feature may not be inherently present in the real neuronal morphology, but may have been created during digital reconstruction from slice image data if, for example, a change of radius were found along the branch. Therefore, this pathology may not be representative of the neuronal geometry, but becomes a function of the reconstruction.
The tangential cell’s convergence, shown in Fig. 5G, shows almost identical errors for both the fourclasses and the lengthpriority methods, indicating that trips are generated in a similar order regardless of method. Contrary to the example with the pyramidal cell, this behaviour is likely to occur when x and y are placed on branches that are significantly shorter than those that arise on the shortest $x\to y$ path, such that the lengthpriority method returns trips of Class 1, 2, 3 and 4 in sequential order, as these increases in length are shorter than adding an excursion along the direct $x\to y$ trip.
Our results clearly indicate that the convergence of the realisation of the sumovertrips framework by either the fourclasses or the lengthpriority method strongly depends on a dendritic geometry. For real morphologies, the number of trips required quickly becomes very large to the point where guaranteeing convergence to within some small error threshold may become computationally expensive.
4.1 StructuralElectrotonic Properties
It acts as a measure of the amount a transient signal’s amplitude diminishes as it travels between two points. ${\mathcal{L}}_{xy}$ is also additive for a point z between x and y, that is, ${\mathcal{L}}_{xy}={\mathcal{L}}_{xz}+{\mathcal{L}}_{zy}$.
5 Discussion
In this paper, we introduced a number of efficient algorithms for the computational realisation of the sumovertrips framework and assessed their convergence. We started with some modifications of the fourclasses algorithm of Cao and Abbott [21] to avoid constructing duplicate trips. An unambiguous contextfree grammar was derived, which is able to generate all trips uniquely and in monotonic order of length. We then developed the lengthpriority method, in which trips are constructed purely in length order rather than in classes. Both methods were found to demonstrate very nonuniform convergence which was highlydependent on the dendritic morphology, as well as the biophysical properties of the cell membrane. Oscillations of the convergence error make it difficult to predict the number of trips required for constructing the Green’s function on a particular geometry. Dendritic structures with longer branches of uniform diameters will converge faster, that is, for a smaller number of trips in the series solution. Instead of sampling the trips in some welldefined order, we also derived a stochastic method of sampling the trips based on a MonteCarlo approach. Finally, we proposed an extremely efficient matrix method which computes the trip coefficients, ${A}_{\mathrm{trip}}$, for trees where all branches are integermultiples in length to some base length, Δx.
Although we considered dendrites to be passive in this study, the proposed algorithms can be easily generalised to support quasiactive (resonant) dendrites with a calculation of the Green’s function in the Laplace domain [24]. Moreover, it is straightforward to include an isopotential soma in the Laplacedomain series solution. A soma can be considered as a special node with the factors ${p}_{k}(\omega )$ on the branches connected to the soma defined as ${p}_{k}(\omega )={r}_{k}^{1}\sqrt{(\omega +{\tau}^{1}){D}_{k}^{1}}/(\stackrel{\u02c6}{C}\omega +{\stackrel{\u02c6}{R}}^{1}+{\sum}_{m}{r}_{m}^{1}\sqrt{(\omega +{\tau}^{1}){D}_{m}^{1}})$, where $\stackrel{\u02c6}{C}$ and $\stackrel{\u02c6}{R}$ are the capacitance and the resistance of the somatic membrane and ω is the Laplace transform’s frequency variable. Similar factors can also be found for when the leakyend boundary condition, referred to as natural termination by Tuckwell [33], is imposed at the terminals. A knowledge of the Green’s function for a given dendritic structure allows one to efficiently find the subthreshold voltage response along the entire tree for any number of various inputs, either analytically or via a computation of the convolution integral. This obviates the need for the bruteforce numerical simulations of an underlining set of PDEs. Such simulations may be computationally expensive, particularly since they have to be reinitiated each time a new stimulus is introduced. In the case of suprathreshold inputs, which can activate voltagegated channels known to be present in dendrites of many neurons, the SpikeDiffuseSpike (SDS) type model [34, 35] can be utilised for analysing the propagations of dendritic action potentials. Although the voltagegated channels in the SDS framework are modelled by piecewise linear instead of nonlinear dynamics, it has been shown that the speed of a wave propagation in the SDS model is in excellent agreement with a more biophysically realistic nonlinear model [36]. However, an analytically tractable SDS model combined with a fast algorithm for constructing the Green’s function on real geometries provides a computationally efficient framework for studying wave scattering in dendrites.
Although networks of spatiallyextended neural cells can be numerically simulated, there are currently few mathematical studies of such networks. A natural extension might be to consider a network of branched neurons coupled by gapjunctions. The sumovertrips formalism can then be generalised to support a presence of new boundary conditions. Recent results of Harris and Timofeeva [37] can be applied to the case of tiptotip coupling of the dendritic branches. The proposed algorithms can then be modified by including additional sumovertrips rules. It is worth mentioning that the computational schemes presented in this paper are able to handle cyclic graphs, which may form as a result of gapjunction coupling across several neurons. While the matrix method is expected to be the most efficient for a network of symmetric or regular structures, realistic reconstructions of discretised trees remain within computational reach. For example, given a sparse random matrix, of correct density and of size $20\text{,}000$, equivalent to a dendritic tree with $10\text{,}000$ edges, the calculation of ${G}_{ij}(x,y,t)$ for all j up to ${k}_{\mathrm{max}}={10}^{5}$ only takes fifteen seconds on a desktop computer. For comparison, the Purkinje cell reconstruction in Fig. 4D has just under $5\text{,}000$ branches. For the case of very large, complex irregular structures it might be possible to employ a recently developed technique of reducing the complexity of large dendrites [38] before applying the sumovertrips methodology.
Appendix: Mathematical Convergence of the Sumovertrips Series Solution
This makes B the coefficient of the lower bound on trip length in terms of the number of nodes in a trip. Intuitively, Bk equals the minimum distance between any two nodes where, for this purpose, we count x and y as nodes.
With ${\rho}_{\mathrm{\infty}}<1$, the second sum in (26) converges absolutely for all constants $B,C,E>0$. Therefore, the series in (26) is absolutely convergent for sufficientlyhigh k.
and the path integral converges faster than ${\mathrm{e}}^{k}$ in the worst case, with the number of nodes k visited by the trips.
Declarations
Acknowledgements
QC and SPCB 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). SRD acknowledges funding from the EPSRC and the MRC through the Doctoral Training Centre in Neuroinformatics at the University of Edinburgh. YT would like to acknowledge the support provided by the BBSRC (BB/H011900) and the RCUK.
Authors’ Affiliations
References
 Cajal R: Histology of the Nervous System of Man and Vertebrates. Oxford University Press, New York; 1995. (trans. N Swanson and LW Swanson, first published 1899) (trans. N Swanson and LW Swanson, first published 1899)Google Scholar
 Ulfhake B, Kellerth JO: A quantitative light microscopic study of the dendrites of cat spinal alphamotoneurons after intracellular staining with horseradish peroxidase. J Comp Neurol 1981, 202: 571–583. 10.1002/cne.902020409View ArticleGoogle Scholar
 Rall W: Core conductor theory and cable properties of neurons. Handbook of Physiology—The Nervous System (I) 1977, 39–97.Google Scholar
 Segev I, Rinzel J, Shepherd GM (Eds): The Theoretical Foundation of Dendritic Function: Selected Papers of Wilfrid Rall with Commentaries. MIT Press, Cambridge; 1995.Google Scholar
 Spruston N, Stuart G, Häusser M: Dendritic integration. In Dendrites. Edited by: Spruston N, Stuart G, Häusser M. Oxford University Press, New York; 2008.Google Scholar
 van Ooyen A, Duijnhouwer J, Remme MWH, van Pelt J: The effect of dendritic topology on firing patterns in model neurons. Netw Comput Neural Syst 2002,13(3):311–325. 10.1088/0954898X/13/3/304View ArticleGoogle Scholar
 Spruston N, Stuart G, Häusser M (Eds): Dendrites. Oxford University Press, New York; 2008.Google Scholar
 Johnston D, Narayanan R: Active dendrites: colorful wings of the mysterious butterflies. Trends Neurosci 2008,31(6):309–316. 10.1016/j.tins.2008.03.004View ArticleGoogle Scholar
 London M, Häusser M: Dendritic computation. Annu Rev Neurosci 2005, 28: 503–532. 10.1146/annurev.neuro.28.061604.135703View ArticleGoogle Scholar
 Rall W: Theoretical significance of dendritic trees for neuronal inputoutput relations. In Neural Theory and Modeling. Edited by: Reiss RF. Stanford University Press, Stanford; 1964:73–97.Google Scholar
 Segev I, Fleshmann IJ, Burke RE: Compartmental models of complex neurons. In Methods in Neuronal Modeling. MIT Press, Cambridge; 1989.Google Scholar
 Rall W: Theory of physiological properties of dendrites. Ann NY Acad Sci 1962,96(2):1071–1092.Google Scholar
 Koch C, Poggio T: A simple algorithm for solving the cable equation in dendritic trees of arbitrary geometry. J Neurosci Methods 1985,12(4):303–315. 10.1016/01650270(85)900159View ArticleGoogle Scholar
 Butz EG, Cowan JD: Transient potentials in dendritic systems of arbitrary geometry. Biophys J 1974,14(9):661–689. 10.1016/S00063495(74)859436View ArticleGoogle Scholar
 Whitehead RR, Rosenberg JR: On trees as equivalent cables. Proc R Soc Lond B, Biol Sci 1993,252(1334):103–108. 10.1098/rspb.1993.0052View ArticleGoogle Scholar
 Lindsay K: Analytical and numerical construction of equivalent cables. Math Biosci 2003,184(2):137–164. 10.1016/S00255564(03)000592MathSciNetView ArticleMATHGoogle Scholar
 Evans JD, Kember GC, Major G: Techniques for obtaining analytical solutions to the multicylinder somatic shunt cable model for passive neurones. Biophys J 1992, 63: 350–365. 10.1016/S00063495(92)816314View ArticleGoogle Scholar
 Major G, Evans JD, Jack JJB: Solutions for transients in arbitrary branching cables: I. Voltage recording with a somatic shunt. Biophys J 1993, 65: 423–449. 10.1016/S00063495(93)810373View ArticleGoogle Scholar
 Evans JD, Major G: Techniques for the application of the analytical solution to the multicylinder somatic shunt cable model for passive neurones. Math Biosci 1995, 125: 1–50. 10.1016/00255564(94)00018UView ArticleMATHGoogle Scholar
 Abbott L, Farhi E, Gutmann S: The path integral for dendritic trees. Biol Cybern 1991, 66: 49–60. 10.1007/BF00196452View ArticleMATHGoogle Scholar
 Cao BJ, Abbott LF: A new computational method for cable theory problems. Biophys J 1993,64(2):303–313. 10.1016/S00063495(93)813705View ArticleGoogle Scholar
 Rapp M, Segev I, Yarom Y: Physiology, morphology and detailed passive models of guineapig cerebellar Purkinje cells. J Physiol 1994, 474: 101–118.View ArticleGoogle Scholar
 Eppstein D: Finding the k shortest paths. SIAM J Comput 1999,28(2):652–673.MathSciNetView ArticleGoogle Scholar
 Coombes S, Timofeeva Y, Svensson CM, Lord GJ, Josić K, Cox SJ, Colbert CM: Branching dendrites with resonant membrane: a “sumovertrips” approach. Biol Cybern 2007,97(2):137–149. 10.1007/s0042200701615View ArticleMATHGoogle Scholar
 Abbott LF: Simple diagrammatic rules for solving dendritic cable problems. Physica A 1992,185(1–4):343–356. 10.1016/03784371(92)904745MathSciNetView ArticleGoogle Scholar
 Carnevale N, Hines M: The NEURON Book. Cambridge University Press, Cambridge; 2006.View ArticleGoogle Scholar
 Ascoli GA, Donohue DE, Halavi M: NeuroMorpho.Org: a central resource for neuronal morphologies. J Neurosci 2007,27(35):9247–9251. 10.1523/JNEUROSCI.205507.2007View ArticleGoogle Scholar
 Bloomfield A, Miller F: A functional organization of ON and OFF pathways in the rabbit retina. J Neurosci 1986, 6: 1–13.Google Scholar
 Radman T, Ramos RL, Brumberg JC, Bikson M: Role of cortical cell type and morphology in sub and suprathreshold uniform electric field stimulation. Brain Stimul 2009,2(4):215–228. 10.1016/j.brs.2009.03.007View ArticleGoogle Scholar
 Vetter P, Roth A, Häusser M: Propagation of action potentials in dendrites depends on dendritic morphology. J Neurophysiol 2001, 85: 926–937.Google Scholar
 Cuntz H, Forstner F, Haag J, Borst A: The morphological identity of insect dendrites. PLoS Comput Biol 2008., 4: Article ID e1000251 Article ID e1000251Google Scholar
 Zador AM, AgmonSnir H, Segev I: The morphoelectrotonic transform: a graphical approach to dendritic function. J Neurosci 1995,15(3):1669–1682.Google Scholar
 Tuckwell HC: Introduction to Theoretical Neurobiology: Volume 1. Linear Cable Theory and Dendritic Structure. Cambridge University Press, Cambridge; 1988.View ArticleMATHGoogle Scholar
 Coombes S, Bressloff PC: Saltatory waves in the spikediffusespike model of active dendritic spines. Phys Rev Lett 2003., 91: Article ID 028102 Article ID 028102Google Scholar
 Timofeeva Y: Travelling waves in a model of quasiactive dendrites with active spines. Physica D, Nonlinear Phenom 2010,239(9):494–503. 10.1016/j.physd.2010.01.004MathSciNetView ArticleMATHGoogle Scholar
 Timofeeva Y, Lord GJ, Coombes S: Spatiotemporal filtering properties of a dendritic cable with active spines: a modeling study in the spikediffusespike framework. J Comput Neurosci 2006,21(3):293–306. 10.1007/s1082700687764MathSciNetView ArticleGoogle Scholar
 Harris J, Timofeeva Y: Intercellular calcium waves in the firediffusefire framework: Green’s function for gapjunctional coupling. Phys Rev E 2010., 82: Article ID 051910 Article ID 051910Google Scholar
 Yan B, Li P: Reduced order modeling of passive and quasiactive dendrites for nervous system simulation. J Comput Neurosci 2011, 31: 247–271.MathSciNetView ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.