ArticleslgStudy

science

Hitting time

Hitting time is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Hitting time rather than just read about it. In short: In the study of stochastic processes in mathematics, a hitting time (or first hit time) is the first time at which a given process "hits" a given subset of the state space. Exit times and return times are also examples of hitting times.

Hitting time — main illustration
Hitting time — illustration

Key takeaways

  • Hitting time belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Hitting time to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Hitting time from memory before moving on to harder problems.

Reference excerpt

In the study of stochastic processes in mathematics, a hitting time (or first hit time) is the first time at which a given process "hits" a given subset of the state space. Exit times and return times are also examples of hitting times.

Definitions Let T be an ordered index set such as the natural numbers, ⁠ N , {\displaystyle \mathbb {N} ,} ⁠ the non-negative real numbers, [0, +∞), or a subset of these; elements ⁠ t ∈ T {\displaystyle t\in T} ⁠ can be thought of as "times". Given a probability space (Ω, Σ, Pr) and a measurable state space S, let X : Ω × T → S {\displaystyle X:\Omega \times T\to S} be a stochastic process, and let A be a measurable subset of the state space S. Then the first hit time τ A : Ω → [ 0 , + ∞ ] {\displaystyle \tau _{A}:\Omega \to [0,+\infty ]} is the random variable defined by

τ A ( ω ) := inf { t ∈ T ∣ X t ( ω ) ∈ A } . {\displaystyle \tau _{A}(\omega ):=\inf\{t\in T\mid X_{t}(\omega )\in A\}.}

The first exit time (from A) is defined to be the first hit time for S \ A, the complement of A in S. Confusingly, this is also often denoted by τA. The first return time is defined to be the first hit time for the singleton set {X0(ω)}, which is usually a given deterministic element of the state space, such as the origin of the coordinate system.

Examples Any stopping time is a hitting time for a properly chosen process and target set. This follows from the converse of the Début theorem (Fischer, 2013). Let B denote standard Brownian motion on the real line ⁠ R {\displaystyle \mathbb {R} } ⁠ starting at the origin. Then the hitting time τA satisfies the measurability requirements to be a stopping time for every Borel measurable set ⁠ A ⊆ R . {\displaystyle A\subseteq \mathbb {R} .} ⁠ For B as above, let τr (r > 0) denote the first exit time for the interval (−r, r), i.e. the first hit time for ( − ∞ , − r ] ∪ [ r , + ∞ ) . {\displaystyle (-\infty ,-r]\cup [r,+\infty ).} Then the expected value and variance of τr satisfy

E ⁡ [ τ r ] = r 2 , Var ⁡ [ τ r ] = 2 3 r 4 . {\displaystyle {\begin{aligned}\operatorname {E} \left[\tau _{r}\right]&=r^{2},\\\operatorname {Var} \left[\tau _{r}\right]&={\tfrac {2}{3}}r^{4}.\end{aligned}}}

For B as above, the time of hitting a single point (different from the starting point 0) has the Lévy distribution. The narrow escape problem considers the time it takes for a confined particle, undergoing Brownian motion, to escape through a small opening.

Début theorem The hitting time of a set F is also known as the début of F. The Début theorem says that the hitting time of a measurable set F, for a progressively measurable process with respect to a right continuous and complete filtration, is a stopping time. Progressively measurable processes include, in particular, all right and left-continuous adapted processes. The proof that the début is measurable is rather involved and involves properties of analytic sets. The theorem requires the underlying probability space to be complete or, at least, universally complete. The converse of the Début theorem states that every stopping time defined with respect to a filtration over a real-valued time index can be represented by a hitting time. In particular, for essentially any such stopping time there exists an adapted, non-increasing process with càdlàg (RCLL) paths that takes the values 0 and 1 only, such that the hitting time of the set {0} by this process is the considered stopping time. The proof is very simple.

Markov chains If a Markov chain is irreducible and positive-recurrent, then the stationary distribution is unique and given by

… excerpt ends here. Continue reading the full article.

Illustrations

Hitting time: The Hitting times and stopping times of three samples of Brownian motion.
The Hitting times and stopping times of three samples of Brownian motion.

Worked examples

Example 1 — a first encounter with Hitting time

Start with the simplest possible case. Write down what Hitting time claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Hitting time before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Hitting time ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Hitting time

In research
Hitting time appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Hitting time in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Hitting time is common in secondary-school and first-year university syllabi. It links to neighbouring topics Stochastic processes, so understanding it makes those chapters shorter.
In everyday life
Look for Hitting time outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Hitting time in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Hitting time means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Hitting time out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Hitting time in simple terms?

In the study of stochastic processes in mathematics, a hitting time (or first hit time) is the first time at which a given process "hits" a given subset of the state space. Exit times and return times are also examples of hitting times.

Why does Hitting time matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Hitting time?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Hitting time.

Tags

  • Stochastic processes

Keep exploring