ArticleslgStudy

science

Hunt process

Hunt process 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 Hunt process rather than just read about it. In short: In probability theory, a Hunt process is a type of Markov process, named for mathematician Gilbert A. Hunt who first defined them in 1957.

Key takeaways

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

Reference excerpt

In probability theory, a Hunt process is a type of Markov process, named for mathematician Gilbert A. Hunt who first defined them in 1957. Hunt processes were important in the study of probabilistic potential theory until they were superseded by right processes in the 1970s.

History

Background In the 1930-50s the work of mathematicians such as Joseph Doob, William Feller, Mark Kac, and Shizuo Kakutani developed connections between Markov processes and potential theory. In 1957-8 Gilbert A. Hunt published a triplet of papers which deepened that connection. The impact of these papers on the probabilist community of the time was significant. Joseph Doob said that "Hunt’s great papers on the potential theory generated by Markov transition functions revolutionized potential theory." Ronald Getoor described them as "a monumental work of nearly 170 pages that contained an enormous amount of truly original mathematics." Gustave Choquet wrote that Hunt's papers were "fundamental memoirs which were renewing at the same time potential theory and the theory of Markov processes by establishing a precise link, in a very general framework, between an important class of Markov processes and the class of kernels in potential theory which French probabilists had just been studying." One of Hunt's contributions was to group together several properties that a Markov process should have in order to be studied via potential theory, which he called "hypothesis (A)". A stochastic process X {\displaystyle X} satisfies hypothesis (A) if the following three assumptions hold:

First assumption: X {\displaystyle X} is a Markov process on a Polish space with càdlàg paths. Second assumption: X {\displaystyle X} satisfies the strong Markov property. Third assumption: X {\displaystyle X} is quasi-left continuous on [ 0 , ∞ ) {\displaystyle [0,\infty )} . Processes satisfying hypothesis (A) soon became known as Hunt processes. If the third assumption is slightly weakened so that quasi-left continuity holds only on the lifetime of X {\displaystyle X} , then X {\displaystyle X} is called a "standard process", a term that was introduced by Eugene Dynkin.

Rise and fall The book Markov Processes and Potential Theory (1968) by Blumenthal and Getoor codified standard and Hunt processes as the archetypal Markov processes. Over the next few years probabilistic potential theory was concerned almost exclusively with these processes. Of the three assumptions contained in Hunt's hypothesis (A), the most restrictive is quasi-left continuity. Getoor and Glover write: "In proving many of his results, Hunt assumed certain additional regularity hypotheses about his processes. ... It slowly became clear that it was necessary to remove many of these regularity hypotheses in order to advance the theory." Already in the 1960s attempts were being made to assume quasi-left continuity only when necessary. In 1970, Chung-Tuo Shih extended two of Hunt's fundamental results, completely removing the need for left limits (and thus also quasi-left continuity). This led to the definition of right processes as the new class of Markov processes for which potential theory could work. Already in 1975, Getoor wrote that Hunt processes were "mainly of historical interest". By the time that Michael Sharpe published his book "General Theory of Markov Processes" in 1988, Hunt and standard processes were considered obsolete in probabilistic potential theory. Hunt processes are still studied by mathematicians, most often in relation to Dirichlet forms.

Definition

Brief definition A Hunt process X {\displaystyle X} is a strong Markov process on a Polish space that is càdlàg and quasi-left continuous; that is, if ( T n ) {\displaystyle (T_{n})} is an increasing sequence of stopping times with limit T {\displaystyle T} , then

P ( lim n → ∞ X T n = X T | T < ∞ ) = 1. {\displaystyle \mathbb {P} {\big (}\lim _{n\to \infty }X_{T_{n}}=X_{T}{\big |}T<\infty {\big )}=1.}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Hunt process

Start with the simplest possible case. Write down what Hunt process 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 Hunt process 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 Hunt process 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 Hunt process

In research
Hunt process 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 Hunt process 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
Hunt process is common in secondary-school and first-year university syllabi. It links to neighbouring topics Markov processes, so understanding it makes those chapters shorter.
In everyday life
Look for Hunt process 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 Hunt process in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Hunt process 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 Hunt process out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Hunt process in simple terms?

In probability theory, a Hunt process is a type of Markov process, named for mathematician Gilbert A. Hunt who first defined them in 1957.

Why does Hunt process 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 Hunt process?

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 Hunt process.

Tags

  • Markov processes

Keep exploring