Mean First Passage Times for Transport Equations
Bibliographic record
Abstract
Abstract. Many transport processes in ecology, physics, and biochemistry can be described by the average time to first find a site or exit a region, starting from an initial position. Typical mathematical treatments are based on formulations that allow for various diffusive forms and geometries but where only initial and final positions are taken into account. Here we develop a general theory for the mean first passage time (MFPT) for velocity jump processes. For random walkers, both position and velocity are tracked and the resulting Fokker–Planck equation takes the form of a kinetic transport equation. Starting from the forward and backward formulations we derive a general elliptic integro-PDE for the MFPT of a random walker starting at a given location with a given velocity. We focus on two scenarios that are relevant to biological modeling; the diffusive case and the anisotropic case. For the anisotropic case we also perform a parabolic scaling, leading to a well-known anisotropic MFPT equation. To illustrate the results we consider a two-dimensional circular domain under radial symmetry, where the MFPT equations can be solved explicitly. Furthermore, we consider the MFPT of a random walker in an ecological habitat that is perturbed by linear features, such as wolf movement in a forest habitat that is crossed by seismic lines.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.023 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.004 | 0.002 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.006 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.004 | 0.005 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".