Description Usage Arguments Author(s) References See Also Examples

View source: R/ease.recombination.r

This function computes the ease of recombination of a given technological class from technological classes - patents (incidence) matrices

1 | ```
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 |

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

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | ```
## generate a technology - patent matrix
set.seed(31)
mat <- matrix(sample(0:1,30,replace=T), 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)
list <- get.list (mat)
## run the function
ease.recombination (list, list = TRUE)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.