A functional Breuer--Major theorem with Poisson noise and a sharp regularity condition
summary
The gist
A functional Breuer-Major theorem with Poisson noise extends the classical result for Gaussians to stationary sequences arising from a Poisson point process by establishing a functional central limit…
In short
This paper extends a functional Breuer-Major theorem, originally for Gaussians, to stationary sequences generated by a Poisson point process. It establishes a functional central limit theorem for these processes by proving tightness using spectral gap inequalities and convergence of finite-dimensional distributions via Fourier expansions.
Key concepts
- Functional Central Limit Theorem (FCLT)
- This theorem shows that a sequence of stochastic processes, derived from a Poisson point process, converges in distribution to a standard Brownian motion. This is crucial because it describes the long-term, continuous behavior of the discrete random points.
- Tightness via Spectral Gap Inequality
- Tightness ensures that the sequence of processes does not wander too wildly over time. For Poisson processes, this is achieved using an $L^p$ spectral gap inequality. This inequality provides bounds on moments related to Malliavin derivatives, which are necessary because standard inequalities fail in the Poisson setting.
- Fourier Expansion for Decoupling
- The convergence of finite-dimensional distributions is analyzed by expanding the function $\phi(X_u)$ into a Fourier series. This technique separates the function $\phi$ from the process $X_u$, transforming a complex problem into a simpler trigonometric case that matches established methods for analyzing moments.
Terminology used across episodes
This episode discusses
- A functional Breuer--Major theorem with Poisson noise and a sharp regularity condition · Paper Radio
- Hairer-Quastel universality for KPZ -- polynomial smoothing mechanisms, general nonlinearities and Poisson noise
- Poisson process Fock space representation, chaos expansion and covariance inequalities
The paper
A functional Breuer--Major theorem with Poisson noise and a sharp regularity condition · Read on arXiv
Fanhao Kong, Haiyi Wang
Peking University
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "A functional Breuer--Major theorem with Poisson noise and a sharp regularity condition".
Emmy: Here's the gist of the paper. A functional Breuer-Major theorem with Poisson noise extends the classical result for Gaussians to stationary sequences arising from a Poisson point process by establishing a functional central limit theorem.
Ada: Extension of the Central Limit Theorem The paper extends the functional Breuer-Major theorem for Gaussians to the Poisson case, where the stationary sequence arises from a Poisson point process.
Emmy: The main result establishes a functional central limit theorem for the process defined by when Xn arises from a Poisson point process.
Ada: This is achieved through two primary steps: first, proving the tightness of the sequence of processes and second, proving the convergence of finite-dimensional distributions.
Title and authors: Ada: So, we're looking at this paper titled "A functional Breuer--Major theorem with Poisson noise and a sharp regularity condition". It extends the classical results that deal with Gaussians to a new setting where the underlying sequence isn't Gaussian but comes from a Poisson point process. It also adds this part about needing a sharp regularity condition for the function phi we are studying.
Emmy: That sounds like they're taking something that works nicely for random variables, which is the Breuer-Major theorem, and trying to make it work when the noise structure is different, specifically coming from a Poisson point process. The authors are Kong and Wang from Peking University.
Kolya: So what does this mean practically? Are we talking about a more general class of sequences where the correlations aren't as simple as in a standard Gaussian setting?
Ada: Exactly. The core idea is extending the Breuer-Major theorem, which originally dealt with stationary sequences arising from Gaussian processes, over to stationary sequences that arise from a Poisson point process. The new part they introduce is this regularity condition on the function phi.
Emmy: That sounds like they are trying to figure out what kind of smoothness or control we need on our function phi for this theorem to hold in the Poisson context. It's about making sure that even with this different noise, we can still get convergence results.
Kolya: So, if we think about it simply, they’re showing that if your noise comes from a Poisson process and your function has enough regularity according to their new condition, you can still get the same kind of convergence as in the standard Gaussian case.
The paper's summary: Ada: To summarize what this paper does, they establish a functional central limit theorem for these processes defined by that Poisson point process. They do this by first proving that the sequence of processes is tight, which they do using an Lp spectral gap inequality specific to the Poisson point process.
Emmy: So tightness means that even though we have this more complex noise structure from the Poisson process, we can still control the moments of our processes in a way that guarantees they don't just wander off into infinity as n gets larger. That’s a key step in proving convergence.
Kolya: The spectral gap inequality is mentioned, and I want to know what that actually tells us about the tail behavior of these moments? Does it give us any specific bounds on how fast those moments grow?
Ada: It provides a bound on the p-th moment of F in terms of Malliavin derivatives. That's because in the Poisson case, you don't have the Meyer inequality that we often rely on for controlling those moments, so they had to use this different approach to control them.
Emmy: And then for proving convergence of finite-dimensional distributions, they use a Fourier expansion technique on phi(X u) to decouple it from the random variable X u. This turns the problem into something resembling a trigonometric case that fits with their method of moments.
Kolya: So, by using this Fourier expansion to match it to the method of moments, are they overcoming some issue we usually have when applying those methods in Poisson settings?
Ada: Yeah, they are tackling the failure of the classical method of moments in this specific case because of bounds on the derivatives. They show that this decoupling helps reduce it down to a trigonometric case where their method works properly.
The paper's improvements: Emmy: Now let's talk about what they suggest as improvements or additions to the original idea, because they introduce some new tools and conditions. They introduce a class of functions with specific regularity properties, defined in Definition one point one <ref:2510.26216#pg1>.
Ada: This definition sets up the necessary conditions for phi, which we can call C gamma M. It involves bounding how fast phi grows with respect to the argument x, and also controlling the smoothness of phi at certain points using a parameter gamma.
Kolya: So this regularity condition is what allows them to get that tightness in the Skorohod space D(
zero one: ) <ref:2510.26216#pg2,in the Skorohod space D( 0, 1>? What's the connection between this function class and controlling those moments?
Emmy: It connects because by assuming these strong decay conditions on the coefficients of the chaos expansion of phi, they can use hypercontractivity to bound the p-th moment of each chaos component. This is what guarantees that the series converges.
Ada: So, it’s not just a general statement about Poisson noise; they are saying that for this convergence to work, you need your function phi to belong to this specific class C gamma M, where gamma and M are parameters controlling the growth and smoothness.
Kolya: I'm curious about what the limitations of this method are here. Does requiring a function to be in this class impose a restriction on the types of functions we can analyze?
Ada: Yes, it does. The requirement is quite specific regarding how fast phi grows and its local oscillation control at points, which is what they call the sup notation in Definition one point one <ref:2510.26216#pg1>. It’s a technical constraint that makes the theorem applicable to these specific classes of functions.
Conclusion: Ada: So, to wrap up this paper, they establish the functional Breuer--Major theorem with Poisson noise and a sharp regularity condition by proving tightness using an Lp spectral gap inequality for the Poisson point process. They also show convergence of finite-dimensional distributions through Fourier expansion and moment matching.
Emmy: The main implication is that we can extend these central limit theorems to stationary sequences arising from Poisson point processes, provided our function phi satisfies their specific regularity condition, which they call C gamma M. This gives us a way to analyze the limiting behavior of these processes in this new noise setting.
Kolya: From a probabilistic standpoint, the convergence of finite-dimensional distributions is shown by relating moments to the variance term varX n j=one b j t j and showing that the expectation of powers scales with 2p times that variance term. This lets us control how much things fluctuate in law.
Ada: That scaling is important because it shows how the convergence behaves across different moments, and they even show a specific convergence for T >= dZn, which relates to the process converging to something like mu B in law.
Emmy: It's a solid piece of work because they manage to use tools from spectral analysis and Fourier techniques to handle the complexity introduced by the Poisson noise structure. But they admit that requiring that function phi to be in the class C gamma M is a necessary constraint for their methods to work.
Kolya: I just want one final thought on what this means for applications. If we have a real-world process generated by a Poisson process, and it fits into this function class, then we can trust that our approximations based on the central limit theorem will converge to the right object.
Ada: That’s right, it gives us a framework for understanding these kinds of limits in more complex noise environments. We'll keep an eye on this work as we look at how these tools might apply elsewhere.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors