A transition of limiting distributions of large matchings in random graphs
classification
🧮 math.CO
math.PR
keywords
distributionlimitingmatchingstransitionasymptoticchangescriticaldetermine
read the original abstract
We study the asymptotic distribution of the number of matchings of size $\ell=\ell(n)$ in $G(n,p)$ for a wide range of $p=p(n)\in (0,1)$ and for every $1\le \ell\le \lfloor n/2\rfloor$. We prove that this distribution changes from normal to log-normal as $\ell$ increases, and we determine the critical value of $\ell$, as a function of $n$ and $p$, at which the transition of the limiting distribution occurs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.