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

The scaling limit of Poisson-driven order statistics with applications in geometric probability (1201.5282v1)

Published 25 Jan 2012 in math.PR

Abstract: Let $\eta_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Yk$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $\eta_t$ generates a point process $\xi_t$ on the positive real-half axis. The scaling limit of $\xi_t$ as $t$ tends to infinity is shown to be a Poisson point process with explicitly known intensity measure. From this, a limit theorem for the the $m$-th smallest point of $\xi_t$ is concluded. This is strengthened by providing a rate of convergence. The technical background includes Wiener-It^o chaos decompositions and the Malliavin calculus of variations on the Poisson space as well as the Chen-Stein method for Poisson approximation. The general result is accompanied by a number of examples from geometric probability and stochastic geometry, such as Poisson $k$-flats, Poisson random polytopes, random geometric graphs and random simplices. They are obtained by combining the general limit theorem with tools from convex and integral geometry.

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.