:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hirsch, Christian, Lachièze-Rey, Raphaël, Owada, Takashi
Format:	Preprint
Published:	2025
Subjects:	Probability
Online Access:	https://arxiv.org/abs/2505.09318
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Limit theorems under heavy-tailed scenario in the age dependent random connection models
by: Hirsch, Christian, et al.
Published: (2024)

Functional central limit theorem for topological functionals of Gaussian critical points
by: Hirsch, Christian, et al.
Published: (2024)

Hyperuniform random measures, transport and rigidity
by: Lachièze-Rey, Raphaël
Published: (2025)

Rigidity of random stationary measures and applications to point processes
by: Lachièze-Rey, Raphaël
Published: (2024)

Maximal rigidity of random measure and uniqueness pairs: stealthy processes, quasicrystals and periodicity
by: Lachièze-Rey, Raphaël
Published: (2025)

Stable and Fréchet limit theorem for subgraph functionals in the hyperbolic random geometric graph
by: Hirsch, Christian, et al.
Published: (2026)

Normal approximation of subgraph counts in the random-connection model
by: Liu, Qingwei, et al.
Published: (2023)

Normal approximation for subgraph count in random hypergraphs
by: Michalczuk, Wojciech, et al.
Published: (2024)

Regularization of a stationary point process by a stationary increments perturbation
by: Thomassey, Loïc, et al.
Published: (2026)

Normal to Poisson phase transition for subgraph counting in the random-connection model
by: Liu, Qingwei, et al.
Published: (2024)

Hyperuniformity and optimal transport of point processes
by: Lachièze-Rey, Raphaël, et al.
Published: (2024)

Repelled point processes with application to numerical integration
by: Hawat, Diala, et al.
Published: (2023)

Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs
by: Bloznelis, Mindaugas, et al.
Published: (2021)

Degree counts in random simplicial complexes of the preferential attachment type
by: Owada, Takashi, et al.
Published: (2024)

Multivariate Poisson approximation of joint subgraph counts in random graphs via size-biased couplings
by: Nualart, Eulalia, et al.
Published: (2025)

Functional limit theorems for edge counts in dynamic random connection hypergraphs
by: Hirsch, Christian, et al.
Published: (2025)

Normal approximation of stabilizing Poisson pair functionals with column-type dependence
by: Döring, Hanna, et al.
Published: (2025)

Gaussian fluctuations of generalized $U$-statistics and subgraph counting in the binomial random-connection model
by: Liu, Qingwei, et al.
Published: (2025)

Functional central limit theorem for subgraph counts in a dynamic random connection model
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs
by: Baldassarri, Simone, et al.
Published: (2025)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
by: Balister, Paul, et al.
Published: (2025)

Normal and Poisson approximation for Gibbs point processes with pair potentials
by: Hirsch, Christian, et al.
Published: (2026)

Normal approximation for Gibbs processes via disagreement couplings
by: Hirsch, Christian, et al.
Published: (2023)

Age-dependent random connection models with arc reciprocity: clustering and connectivity
by: Lüchtrath, Lukas, et al.
Published: (2026)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Functional Central Limit Theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Large deviations for subgraphs in inhomogeneous random graphs
by: Michielan, Riccardo, et al.
Published: (2026)

Central limit theorem for linear eigenvalue statistics of random geometric graphs
by: Hirsch, Christian, et al.
Published: (2026)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)

Normal approximation for exponential random graphs
by: Fang, Xiao, et al.
Published: (2024)

Colouring random subgraphs
by: Bukh, Boris, et al.
Published: (2023)

Quantitative homogenization on time-dependent random conductance models with stable-like jumps
by: Chen, Xin, et al.
Published: (2025)

Layered Hill estimator for extreme data in clusters
by: Kang, Taegyu, et al.
Published: (2024)

Percolation phase transition in weight-dependent random connection models
by: Gracar, Peter, et al.
Published: (2020)

Existence of subcritical percolation phases for generalised weight-dependent random connection models
by: Jahnel, Benedikt, et al.
Published: (2023)

Neighbour-count dependent thinning of Poisson processes: correlation structure and Poisson approximation
by: Hlyniana, Kateryna
Published: (2025)

A connection between the random pinning model and random walks in sparse random environments
by: Poisat, Julien
Published: (2024)

Eulerian magnitude homology: subgraph structure and random graphs
by: Giusti, Chad, et al.
Published: (2024)

The largest subgraph without a forbidden induced subgraph
by: Fox, Jacob, et al.
Published: (2024)

Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences
by: Mani, Nitya, et al.
Published: (2024)