Large random intersection graphs inside the critical window and triangle counts

DOI10.1214/25-EJP1271MaRDI QIDQ7031726zbMATH OpenFDO

Authors Minmin Wang

Publication date 6 February 2025

Published in Electronic Journal of Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://projecteuclid.org/journals/electronic-journal-of-probability/volume-30/issue-none/Large-random-intersection-graphs-inside-the-critical-window-and-triangle/10.1214/25-EJP1271.full

zbMATH Keywords

clusteringrandom intersection graphscaling limit

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Stable stochastic processes (60G52) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• An approximation theorem for the Poisson binomial distribution
• Branching processes in Lévy processes: The exploration process
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Component evolution in random intersection graphs
• Concentration Inequalities and Martingale Inequalities: A Survey
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Epidemics on random intersection graphs
• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 1859371 (Why is no real title available?)
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• On Random Intersection Graphs: The Subgraph Problem
• Phase transitions for detecting latent geometry in random graphs
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Random trees and applications
• Tessellations of random maps of arbitrary genus
• The continuum limit of critical random graphs
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
• Universality for critical heavy-tailed network models: metric structure of maximal components

Cited in

(1)

• Near-critical bipartite configuration models and their associated intersection graphs

This page was built for publication: Large random intersection graphs inside the critical window and triangle counts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031726)