epc {centiserve} | R Documentation |
Find the edge percolated component (EPC) in a graph
Description
For a node in G,
is defined as:
Given a threshold , we create 1000 reduced network by asigning a random number between 0 and 1 to every edge and remove edges if their associated random numbers are less than the threshold.
Let the be the reduced network generated at the
time reduced process. If nodes
and
are connected in
, set
to 1; otherwise
.
Usage
epc(graph, vids = V(graph), threshold = 0.5)
Arguments
graph |
The input graph as igraph object |
vids |
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices. |
threshold |
The threshold parameter, for filter graph and create reduced one, which must be between 0 and 1. The default is 0.5. |
Details
For an interaction network G, assign a removing probability p to every edge. Let G'be a realization of the random edge removing from G. If nodes and
are connected in G', set
be 1, otherwise set
be 0. The percolated connectivity of
and
,
, is defined to be the average of
over realizations. The size of percolated component containing node
,
, is defined to be the sum of
over nodes
. The score of node
,
, is defined to be
.
More detail at EPC-Edge Percolated Component
Value
A numeric vector contaning the centrality scores for the selected vertices.
Author(s)
Mahdi Jalili m_jalili@farabi.tums.ac.ir
References
Lin, Chung-Yen, et al. "Hubba: hub objects analyzer-a framework of interactome hubs identification for network biology." Nucleic acids research 36.suppl 2 (2008): W438-W443.
Chen, Shu-Hwa, et al. "cyto-Hubba: A Cytoscape plug-in for hub object analysis in network biology." 20th International Conference on Genome Informatics. 2009.
Examples
g <- graph(c(1,2,2,3,3,4,4,2))
epc(g)