The ability to simulate graphs with given properties is important for the analysis of social networks. Sequential importance sampling has been shown to be particularly effective in estimating the number of graphs adhering to fixed marginals and in estimating the null distribution of graph statistics. This paper describes the package for R and how its simulate and simulate_sis functions can be used to address both of these tasks as well as generate initial graphs for Markov chain Monte Carlo simulations.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5679483 | PMC |
| http://dx.doi.org/10.18637/jss.v024.i08 | DOI Listing |
Publication Analysis
Top Keywords
package simulate
8
fixed marginals
8
sequential sampling
8
networksis package
4
simulate bipartite
4
graphs
4
bipartite graphs
4
graphs fixed
4
marginals sequential
4
sampling ability
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!