graph - When can one consider a subgraph as a giant component of a network? -
graph - When can one consider a subgraph as a giant component of a network? -
i doing network resilience analysis of co-occurrence network of words.
what understand that, minimum fraction of total nodes must nowadays in connected component(sub-graph) of network considered giant component.
for example, in network of 20,000 nodes if maximum nodes sub-graph contains 3, can considered giant component?
as understand, asking definition of term "giant component".
it (qualitative) observation if add together "enough" edges graph (especially in case of random graphs), there 1 component contains bulk of nodes. called giant component.
this qualitative observation. there's no precise definition of "giant component" based on fraction of nodes belonging it. observation in random graph of lots of nodes, there's threshold connectivity around fraction of nodes belonging largest component increment sharply.
is there problem trying solve or understand, or asking definition of term?
graph social-networking
Comments
Post a Comment