Critical Hawkes Processes with Random Fertilities: Stationarity in Law Beyond Infinite Mean Activity
This paper demonstrates that critical Hawkes point processes with heavy-tailed fertility distributions can achieve stationarity in law despite having infinite mean activity, provided that the memory and fertility tail exponents satisfy specific conditions ensuring the local finiteness of the underlying infinite-past Poisson-cluster construction.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine a giant, endless party where people keep inviting more people. This is the story of Hawkes processes, a mathematical model used to describe how events trigger other events. Think of it like a viral meme, a chain of earthquakes, or a rumor spreading through a crowd.
Here is the simple breakdown of what Didier Sornette discovered in this paper, using everyday analogies.
The Setup: The Infinite Party
Imagine a party that started an infinite time ago (at ).
- The Hosts (Immigrants): Every now and then, a new person arrives out of nowhere (an "immigrant").
- The Invitations (Fertility): When a person arrives, they have a certain "fertility." This means they might invite a few friends, or they might invite a huge crowd.
- The Chain Reaction: Those friends arrive, and they invite their own friends, and so on. This creates a "cluster" or a "family tree" of events.
In the past, mathematicians thought that if the average number of people invited per person was exactly 1 (the "critical" point), the party would get out of control. They believed the total number of people would become infinite, making the system "non-stationary" (chaotic and unstable).
The Big Question
Sornette asks: Is the party actually chaotic, or is it just that our way of measuring it is wrong?
The old math said: "If the average number of guests is infinite, the party is broken."
Sornette says: "Not necessarily. Just because the average is huge doesn't mean the room is overflowing at any specific moment."
The New Discovery: "Hitting the Window"
To understand if the party is stable, Sornette changes the question. Instead of asking, "How many people are there in total?" (which can be infinite), he asks:
"If I look through a small window for a fixed amount of time (say, 10 minutes), will I see a finite number of people?"
He calls this the "Fixed-Window Hitting Probability."
Think of it like watching a busy highway through a small peephole. Even if the total number of cars that have ever driven on that road is infinite, you might still only see a manageable number of cars passing your peephole in any given minute.
The Two Ingredients: Memory and Fertility
Sornette finds that whether the party stays "locally finite" (manageable in the window) depends on two things:
Fertility (How wild the invitations are):
- Some people are normal and invite 1 or 2 friends.
- Some people are "super-inviters." In this paper, Sornette looks at cases where a few people might invite millions of friends (a "heavy-tailed" distribution).
- The Twist: Surprisingly, having these wild, unpredictable "super-inviters" can actually stabilize the system!
Memory (How long the invitations last):
- Short Memory: People only invite friends immediately.
- Long Memory: People can invite friends years later.
The Results: When is the Party Stable?
Sornette proves that the party can be stable (stationary) even if the average number of guests is infinite, but only under specific conditions:
The "Wild Inviter" Scenario (Infinite Variance):
If the "fertility" is very wild (some people invite huge crowds, but most invite few), and the "memory" of the system is long enough, the system is stable.- Analogy: Imagine a few people are so chaotic they invite a stadium full of people, but they do it so rarely that, when you look through your 10-minute window, you usually only see a normal crowd. The "wildness" actually prevents the system from getting stuck in a constant, slow burn that would eventually fill the room.
- The Rule: If the memory is long enough relative to how wild the invitations are, the "window" stays finite. The system is stationary in law (the pattern of events repeats itself over time), even though the average intensity is infinite.
The "Normal Inviter" Scenario (Finite Variance):
If everyone is relatively normal (no super-inviters) and the memory is short, the party is not stable.- Analogy: If everyone invites exactly one friend, and they do it quickly, the chain reaction never dies out. If you look through your window, the number of people keeps growing forever. The "infinite past" contributes too many ancestors to the current moment.
The "Critical" Boundary
The paper draws a precise line in the sand.
- If the "memory" is too short compared to the "wildness" of the invitations, the system breaks (non-stationary).
- If the "memory" is long enough, the system holds together (stationary), even with infinite averages.
Why This Matters (According to the Paper)
The paper suggests that many real-world systems (like earthquakes, stock market crashes, or viral social media posts) might be operating right at this "critical" edge.
Previously, scientists saw huge fluctuations and infinite averages and thought, "This system is unstable and changing."
Sornette says: "No, it might be perfectly stable in its pattern, just with a very heavy tail. The chaos you see isn't a sign of breakdown; it's the signature of a stable, critical system with wild fluctuations."
In short: You can have a system where the "average" is infinite, but the "reality" you observe in any given moment is perfectly finite and stable, provided the system has the right mix of long memories and wild, rare events.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.