Encounter times of intermittently running particles

Intracellular processes often rely on the timely encounter of mobile reaction partners, including intermittently motor-driven organelles. The underlying cytoskeletal network presents a complex landscape that both directs particle movement and introduces quenched disorder through filament organization. We investigate the mean first encounter times for pairs of intermittently processive and diffusive particles, moving in two dimensions with and without a fixed filament network. In unstructured domains, increasing particle run-length enhances exploration of the domain, but tends to slow down the encounter times compared to equivalent diffusing particles. Encounters for long-running particles occur preferentially near the periphery, contrasting with bulk encounters for the purely diffusive case. When particles are unbiased in their runs along dense filament networks, encounters are shown to be well approximated by a continuum run-and-tumble model. For biased particles, regions of convergent filament orientation serve as traps that slow the overall spatial exploration but can allow for faster encounter rates by funneling particles into regions of reduced dimensionality. These findings provide a framework for estimating intracellular encounter kinetics, highlighting the role of key physical features such as the effective diffusivity, run times, and network architecture.

Authors

Institutions

Publication Details

Journal
Physical Biology
Published
2026-04-01
DOI
https://doi.org/10.1088/1478-3975/ae5d10
Primary Topic
Micro and Nano Robotics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Encounter times of intermittently running particles

Elena F. Koslover, Mario Hidalgo-Soria, Lizzy Teryoshin
Physical Biology
Micro and Nano Robotics
article

Encounter times of intermittently running particles

Elena F. Koslover, Mario Hidalgo-Soria, Lizzy Teryoshin
article en

Abstract

Intracellular processes often rely on the timely encounter of mobile reaction partners, including intermittently motor-driven organelles. The underlying cytoskeletal network presents a complex landscape that both directs particle movement and introduces quenched disorder through filament organization. We investigate the mean first encounter times for pairs of intermittently processive and diffusive particles, moving in two dimensions with and without a fixed filament network. In unstructured domains, increasing particle run-length enhances exploration of the domain, but tends to slow down the encounter times compared to equivalent diffusing particles. Encounters for long-running particles occur preferentially near the periphery, contrasting with bulk encounters for the purely diffusive case. When particles are unbiased in their runs along dense filament networks, encounters are shown to be well approximated by a continuum run-and-tumble model. For biased particles, regions of convergent filament orientation serve as traps that slow the overall spatial exploration but can allow for faster encounter rates by funneling particles into regions of reduced dimensionality. These findings provide a framework for estimating intracellular encounter kinetics, highlighting the role of key physical features such as the effective diffusivity, run times, and network architecture.

Physical BiologyVol. 23(2)
University of California San Diego (US), Western University of Health Sciences (US)
Chan Zuckerberg Initiative, Directorate for Mathematical and Physical Sciences
Openalex Percentile: Top 96%
Micro and Nano Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.