Explicit fluid limit and diffusion limit are derived for the number of connected components in sub-critical multiplicative random graph processes.
Billingsley, Convergence of probability measures, New York - London - Sydney - Toronto : John Wiley and Sons , Inc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The number of connected components in sub-critical random graph processes
Explicit fluid limit and diffusion limit are derived for the number of connected components in sub-critical multiplicative random graph processes.