Need help now? Support now: crisis lines by country.

Pain words · Mathematical Institute for Research of Pain

Hitting time

Also called first passage time or first hitting time

A hitting time is the first time a random process reaches a chosen set of states, such as the first day a pain rating reaches a chosen flare line.

In plain words

Choose a line, say a rating of 7 out of 10, and follow a pain diary forward from today. The hitting time is the number of days until the rating first reaches 7 or more. In a model this time is random: some paths reach the line soon, some late, and some never. Researchers ask about its average, its median or its whole distribution.

What researchers mean

For a process (Xt)(X_t) and a set of states AA, the hitting time of AA is the first time t≥0t \ge 0 at which XtX_t lies in AA. If the process never enters AA, the time is defined to be infinite. Some authors count only times t≥1t \ge 1, which changes the answer when the process starts inside AA. For a Markov chain the mean hitting times solve a system of linear equations; for a diffusion they solve a differential equation with boundary values. Physicists call the same quantity a first passage time.

The mean can be infinite even when the line is reached with probability 1: a simple symmetric random walk started at 0 reaches the level 1 with probability 1, yet the mean time it takes is infinite. So the median or the whole distribution is often more informative than the mean. With ratings recorded once a day, a brief crossing between two ratings is not seen at all, so the observed hitting time depends on how often the process is recorded.

The maths

For a process XX and a set of states AA:

τA=inf⁡{ t≥0:Xt∈A }\tau_A = \inf\{\, t \ge 0 : X_t \in A \,\}
τA\tau_A
hitting time of A
t≥0t \ge 0
a time from now on
Xt∈AX_t \in A
the process is in A

The time depends on the set chosen and on what counts as reaching it; if the process never enters AA the set is empty and its infimum is taken to be infinity.

These pages explain words, reasoning and evidence. Nothing here is medical advice or a forecast about any person.

Sources

  1. Norris JR. Markov Chains. Cambridge: Cambridge University Press; 1997. doi:10.1017/CBO9780511810633
  2. Redner S. A Guide to First-Passage Processes. Cambridge: Cambridge University Press; 2001. doi:10.1017/CBO9780511606014

Questions about this

Inside the Institute

Pain math explains what the Institute does, and Questions about pain answers some questions people in pain ask, in the same layers. The rooms, the Lab and the full Pain Bias Codex open with an invite code.

No code yet? Ask for an invite. A person reads every request and writes back by hand with an invite code, so it may take a few days.

Need help now? Support now: crisis lines by country.

Except where a page says otherwise, the Institute’s own text and figures are shared under CC BY-NC 4.0. Pictures and quotations from others keep their own credits and licences.

Back to the invite page · Sign in

Paper