Is Ego an Isolate?
Returns TRUE iff ego is an isolate in graph g of dat.
is.isolate(dat, ego, g=1, diag=FALSE)
dat |
one or more input graphs. |
ego |
index of the vertex (or a vector of vertices) to check. |
g |
which graph(s) should be examined? |
diag |
boolean indicating whether adjacency matrix diagonals (i.e., loops) contain meaningful data. |
In the valued case, any non-zero edge value is taken as sufficient to establish a tie.
A boolean value (or vector thereof) indicating isolate status
Carter T. Butts buttsc@uci.edu
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River, NJ: Prentice Hall.
#Generate a test graph g<-rgraph(20) g[,4]<-0 #Create an isolate g[4,]<-0 #Check for isolates is.isolate(g,2) #2 is almost surely not an isolate is.isolate(g,4) #4 is, by construction
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.