Size of the Largest Component in a Critical Graph

Bin Wang and Lang Zou

Mathematical Problems in Engineering, 2019, vol. 2019, 1-11

Abstract:

In this paper, by the branching process and the martingale method, we prove that the size of the largest component in the critical random intersection graph is asymptotically of order and the width of scaling window is .

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/1731802.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/1731802.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1731802

DOI: 10.1155/2019/1731802

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().