arXiv (All)
open access
Cluster size distributions of discrete random fields
We study discrete random fields $X_t$ indexed by the integer lattice $\mathbb{Z}^d$. For a fixed threshold $u$, the excursion set $\{t \in \mathbb{Z}^d : X_t > u\}$ decomposes into connected components, called excursion clusters, whose sizes are the numbers of lattice sites they contain. Our objecti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics#1013042
- Regularly varying random fields and analyses of extremal clusters#493572
- Large deviations for random sums and random convex polygons#326181
- A Law of Fractional Logarithm for Nested Complex Sample Covariance Matrices#1064348
- Markov chains arising in the study of random matrices over pro-finite rings#1154757
Record · ID 1118464
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive