View source: R/ease_recombination.r
ease_recombination | R Documentation |
This function computes the ease of recombination of a given technological class from technological classes - patents (incidence) matrices
ease_recombination(mat, sparse = FALSE, list = FALSE)
mat |
A bipartite adjacency matrix (can be a sparse matrix) |
sparse |
Logical; is the input matrix a sparse matrix? Defaults to FALSE, but can be set to TRUE if the input matrix is a sparse matrix |
list |
Logical; is the input a list? Defaults to FALSE, but can be set to TRUE if the input matrix is a list |
A data frame with two columns: "tech" representing the technological class and "eor" representing the ease of recombination of the technological class
Pierre-Alexandre Balland p.balland@uu.nl
Fleming, L. and Sorenson, O. (2001) Technology as a complex adaptive system: evidence from patent data, Research Policy 30: 1019-1039
modular_complexity
, tci
, mort
## generate a technology - patent matrix
set.seed(31)
mat <- matrix(sample(0:1, 30, replace = TRUE), ncol = 5)
rownames(mat) <- c("T1", "T2", "T3", "T4", "T5", "T6")
colnames(mat) <- c("US1", "US2", "US3", "US4", "US5")
## generate a technology - patent sparse matrix
library(Matrix)
smat <- Matrix(mat, sparse = TRUE)
## run the function
ease_recombination(mat)
ease_recombination(smat, sparse = TRUE)
## generate a regular data frame (list)
my_list <- get_list(mat)
## run the function
ease_recombination(my_list, list = TRUE)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.