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 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 418 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Convergence of space-time occupation measures of stochastic processes and its application to collisions (2510.19936v1)

Published 22 Oct 2025 in math.PR

Abstract: We introduce a new perspective on positive continuous additive functionals (PCAFs) of Markov processes, which we call space--time occupation measures (STOMs). This notion provides a natural generalization of classical occupation times and occupation measures, and offers a unified framework for studying their convergence. We analyze STOMs via so-called smooth measures associated with PCAFs through the Revuz correspondence. We establish that if the underlying spaces, the processes living on them, their heat kernels, and the associated smooth measures converge, and if the corresponding potentials of these measures satisfy a uniform decay condition, then the associated PCAFs and STOMs also converge in suitable Gromov--Hausdorff-type topologies. We then apply this framework to the analysis of collisions of independent stochastic processes. Specifically, by exploiting the STOM formulation, we introduce the notion of collision measures, which record both the collision sites and times of two processes, and prove general convergence theorems for these measures. The abstract results are further specialized to random walks on electrical networks via the theory of resistance metric spaces, leading to concrete scaling limits for collision measures of random walks on critical random graphs, such as critical Galton--Watson trees, critical Erd\H{o}s--R\'enyi random graphs, and the uniform spanning tree.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 3 likes.

Upgrade to Pro to view all of the tweets about this paper: