Related papers: A Graphical Approach to a Model of Neuronal Tree w…
Given a graph $G$ rooted at a vertex $r$ and weight functions, $\gamma, \tau: E(G) \rightarrow \mathbb{R}$, the generalized cable-trench problem (CTP) is to find a single spanning tree that simultaneously minimizes the sum of the total edge…
Dendrites are extensions to the neuronal cell body in the brain which are posited in several functions ranging from electrical and chemical compartmentalization to coincident detection. Dendrites vary across cell types but one common…
The cable equation is a second order, parabolic, partial differential equation that describes the evolution of voltage in the dendrite of a neuron. Here we look at the various ways in which lambda(space constant/ variable space…
We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…
We study solutions to a recently proposed neural field model in which dendrites are modelled as a continuum of vertical fibres stemming from a somatic layer. Since voltage propagates along the dendritic direction via a cable equation with…
Progress toward characterization of structural and biophysical properties of neural dendrites together with recent findings emphasizing their role in neural computation, has propelled growing interest in refining existing theoretical models…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
In this paper, we introduce the Fixed Topology Minimum-Length Tree with Neighborhood Problem, which aims to embed a rooted tree-shaped graph into a $d$-dimensional metric space while minimizing its total length provided that the nodes must…
We propose an extension of the cable equation by introducing a Caputo time fractional derivative. The fundamental solutions of the most common boundary problems are derived analitically via Laplace Transform, and result be written in terms…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
The Steiner Tree Problem (STP) in graphs is an important problem with various applications in many areas such as design of integrated circuits, evolution theory, networking, etc. In this paper, we propose an algorithm to solve the STP. The…
This paper presents a numerically exact cable finite element model for static nonlinear analysis of cable structures. The model derives the exact expression of the tension field using the geometrically exact beam theory coupled with the…
We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation…
We consider an explicitly solvable model (formulated in the Riemannian geometry terms) for a stationary wave process in a specific thin domain with the Dirichlet boundary conditions on the boundary of the domain. The transition from the…
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that…
We propose a simple, exactly solvable, model of interface growth in a random medium that is a variant of the zero-temperature random-field Ising model on the Cayley tree. This model is shown to have a phase diagram (critical depinning field…
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one…
In this paper we present a general framework for solving the stationary nonlinear Schr\"odinger equation (NLSE) on a network of one-dimensional wires modelled by a metric graph with suitable matching conditions at the vertices. A formal…
The paper discusses a simple method of using the parametric continuation method to designate complex diagrams of steady states. The main advantage of the discussed approach is the fact that it does not require the installation of huge…