Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,163,693 papers from all fields of science
Search
Sign In
Create Free Account
Giant component
Known as:
Component
In network theory, a giant component is a connected component of a given random graph that contains a constant fraction of the entire graph's…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Bruce Reed (mathematician)
Connected component (graph theory)
Critical point (network science)
Degree distribution
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
The Giant Component and 2-Core in Sparse Random Outerplanar Graphs
Mih-Yun Kang
,
Michael Missethan
International Conference on Probabilistic…
2020
Corpus ID: 216562242
Let $A(n,m)$ be a graph chosen uniformly at random from the class of all vertex-labelled outerplanar graphs with $n$ vertices and…
Expand
2019
2019
Performance Evaluation of WMN-GA Simulation System for Different Settings of Genetic Operators Considering Giant Component and Number of Covered Users
Admir Barolli
2019
Corpus ID: 14427432
In this paper, the authors propose and implement a system based on Genetic Algorithms (GAs) called WMNGA. They evaluated the…
Expand
2013
2013
Information Extraction and Social Network Analysis of Criminal Sentences. A Sociological and Computational Approach
D. De Felice
,
G. Giuffrida
,
G. Giura
,
V. Verendel
,
C. Zarba
2013
Corpus ID: 115137897
2013
2013
On the Evolution of Random Geometric Graphs on Spaces of Negative Curvature
2013
Corpus ID: 18651290
We study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on the…
Expand
2013
2013
On giant components in research collaboration networks: Case of engineering disciplines in Malaysia
Sameer Kumar
,
J. Jan
2013
Corpus ID: 56338225
Kumar, S., & Jan, J. M. (2013). On giant components in research collaboration networks: Case of engineering disciplines in…
Expand
2010
2010
1 Direct and Indirect Knowledge Spillovers : The ' Social Network ' of Open Source Projects Revised April 4 , 2010
Chaim Fershtman
,
Neil Gandal
2010
Corpus ID: 2730371
Knowledge spillovers are a central part of knowledge accumulation. The paper focuses on spillovers that occur through the…
Expand
2006
2006
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks
Bivas Mitra
,
M. Afaque
,
S. Ghose
,
Niloy Ganguly
International Conference of Distributed Computing…
2006
Corpus ID: 16771076
In peer-to-peer (p2p) networks, peer nodes communicate with each other with the help of overlay structure. As the peers in the…
Expand
2005
2005
On the distance to the giant component along a straight line in a two-dimensional percolation model
Olivier Dousse
,
Christina Tavoularis
2005
Corpus ID: 12838713
The supercritical regime of a percolation model refers to the range of probabilities (discrete) or densities (continuous) above a…
Expand
2001
2001
Core percolation: a new geometric phase transition in random graphs
M. Bauer
,
O. Golinelli
2001
Corpus ID: 14327024
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their…
Expand
1990
1990
-1 - Random Mapping Statistics
A. Odlyzko
1990
Corpus ID: 16388834
Random mappings from a nite set into itself are either a heuristic or an exact model for a variety of applications in random…
Expand