sample_growing
(Package: igraph) :
Growing random graph generation
This function creates a random graph by simulating its stochastic evolution.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: growing, growing.random.game, sample_growing
●
0 images
|
getAICc
(Package: igraph) :
Compute AIC based on a Poisson Approximation using the output from code{gclust
Compute and Extract information Criteria Value from gclust using a Poisson approximation, where the penality term is adjusted for small sample cases.
● Data Source:
CranContrib
● Keywords:
● Alias: getAICc
●
0 images
|
scg-method
(Package: igraph) :
Spectral Coarse Graining
Functions to perform the Spectral Coarse Graining (SCG) of matrices and graphs.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: scg-method
●
0 images
|
cluster_label_prop
(Package: igraph) :
Finding communities based on propagating labels
This is a fast, nearly linear time algorithm for detecting community structure in networks. In works by labeling the vertices with unique labels and then updating the labels by majority voting in the neighborhood of the vertex.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: cluster_label_prop, label.propagation.community
●
0 images
|
Given a graph, constraint calculates Burt's constraint for each vertex.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: constraint
●
0 images
|
complementer
(Package: igraph) :
Complementer of a graph
A complementer graph contains all edges that were not present in the input graph.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: complementer, graph.complementer
●
0 images
|
assortativity
(Package: igraph) :
Assortativity coefficient
The assortativity coefficient is positive is similar vertices (based on some external property) tend to connect to each, and negative otherwise.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: assortativity, assortativity.degree, assortativity.nominal, assortativity_degree, assortativity_nominal
●
0 images
|
sample_fitness_pl
(Package: igraph) :
Scale-free random graphs, from vertex fitness scores
This function generates a non-growing random graph with expected power-law degree distributions.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: sample_fitness_pl, static.power.law.game
●
0 images
|
sample_islands
(Package: igraph) :
A graph with subgraphs that are each a random graph.
Create a number of Erdos-Renyi random graphs with identical parameters, and connect them with the specified number of edges.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: interconnected.islands.game, sample_islands
●
0 images
|
transitivity
(Package: igraph) :
Transitivity of a graph
Transitivity measures the probability that the adjacent vertices of a vertex are connected. This is sometimes also called the clustering coefficient.
● Data Source:
CranContrib
● Keywords: graphs
● Alias: transitivity
●
0 images
|
providing 
.