Size of the Largest Component in a Critical Graph
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-09-10
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
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 Gn,n5/3,p is asymptotically of order n2/3 and the width of scaling window is n−1/3.
American Psychological Association (APA)
Wang, Bin& Zou, Lang. 2019. Size of the Largest Component in a Critical Graph. Mathematical Problems in Engineering،Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1194506
Modern Language Association (MLA)
Wang, Bin& Zou, Lang. Size of the Largest Component in a Critical Graph. Mathematical Problems in Engineering No. 2019 (2019), pp.1-11.
https://search.emarefa.net/detail/BIM-1194506
American Medical Association (AMA)
Wang, Bin& Zou, Lang. Size of the Largest Component in a Critical Graph. Mathematical Problems in Engineering. 2019. Vol. 2019, no. 2019, pp.1-11.
https://search.emarefa.net/detail/BIM-1194506
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1194506
