Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 182 tok/s Pro
GPT OSS 120B 415 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Functional central limit theorems for stationary Hawkes processes and application to infinite-server queues (1607.06624v4)

Published 22 Jul 2016 in math.PR

Abstract: A univariate Hawkes process is a simple point process that is self-exciting and has clustering effect. The intensity of this point process is given by the sum of a baseline intensity and another term that depends on the entire past history of the point process. Hawkes process has wide applications in finance, neuroscience, social networks, criminology, seismology, and many other fields. In this paper, we prove a functional central limit theorem for stationary Hawkes processes in the asymptotic regime where the baseline intensity is large. The limit is a non-Markovian Gaussian process with dependent increments. We use the resulting approximation to study an infinite-server queue with high-volume Hawkes traffic. We show that the queue length process can be approximated by a Gaussian process, for which we compute explicitly the covariance function and the steady-state distribution. We also extend our results to multivariate stationary Hawkes processes and establish limit theorems for infinite-server queues with multivariate Hawkes traffic.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.