Directed intermittent search for a hidden target on a dendritic tree

Jay M. Newby and Paul C. Bressloff
Phys. Rev. E 80, 021913 – Published 13 August 2009

Abstract

Motivated by experimental observations of active (motor-driven) intracellular transport in neuronal dendrites, we analyze a stochastic model of directed intermittent search on a tree network. A particle injected from the cell body or soma into the primary branch of the dendritic tree randomly switches between a stationary search phase and a mobile nonsearch phase that is biased in the forward direction. A (synaptic) target is presented somewhere within the tree, which the particle can locate if it is within a certain range and in the searching phase. We approximate the moment generating function using Green’s function methods. The moment generating function is then used to compute the hitting probability and conditional mean first passage time to the target. We show that in contrast to a previously explored finite interval case, there is a range of parameters for which a bidirectional search strategy is more efficient than a unidirectional one in finding the target.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 4 June 2009

DOI:https://doi.org/10.1103/PhysRevE.80.021913

©2009 American Physical Society

Authors & Affiliations

Jay M. Newby1 and Paul C. Bressloff1,2

  • 1Department of Mathematics, University of Utah, Salt Lake City, Utah 84112, USA
  • 2Mathematical Institute, University of Oxford, 24-29 St. Giles, Oxford OX1 3LB, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 80, Iss. 2 — August 2009

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×