Functional central limit theorem for subgraph counts in a dynamic random connection model

Documenti analoghi

• Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs
  di: Hazra, Rajat Subhra, et al.
  Pubblicazione: (2024)
• Normal approximation of subgraph counts in the random-connection model
  di: Liu, Qingwei, et al.
  Pubblicazione: (2023)
• Normal to Poisson phase transition for subgraph counting in the random-connection model
  di: Liu, Qingwei, et al.
  Pubblicazione: (2024)
• Graph connectivity with fixed endpoints in the random-connection model
  di: Liu, Qingwei, et al.
  Pubblicazione: (2023)
• Spatiotemporal Hawkes processes with a graphon-induced connectivity structure
  di: Baars, Justin, et al.
  Pubblicazione: (2024)