Dense and nondense limits for uniform random intersection graphs
arxiv(2024)
摘要
We obtain the scaling limits of random graphs drawn uniformly in three
families of intersection graphs: permutation graphs, circle graphs, and unit
interval graphs. The two first families typically generate dense graphs, in
these cases we prove a.s. convergence to an explicit deterministic graphon.
Uniform unit interval graphs are nondense and we prove convergence in the sense
of Gromov-Prokhorov after normalization of the distances: the limiting object
is the interval [0,1] endowed with a random metric defined through a Brownian
excursion. Asymptotic results for the number of cliques of size k (k fixed)
in a uniform random graph in each of these three families are also given.
In all three cases, an important ingredient of the proof is that, for
indecomposable graphs in each class (where the notion of indecomposability
depends on the class), the combinatorial object defining the graph
(permutation, matching, or intervals) is essentially unique.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要