2008
DOI: 10.18637/jss.v024.i08
|View full text |Cite
|
Sign up to set email alerts
|

networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals Through Sequential Importance Sampling

Abstract: 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 networksis 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 simulati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…networksis: A package to simulate bipartite networks with fixed marginals through sequential importance sampling (Admiraal and Handcock 2007).…”
Section: Optional Packagesmentioning
confidence: 99%
“…networksis: A package to simulate bipartite networks with fixed marginals through sequential importance sampling (Admiraal and Handcock 2007).…”
Section: Optional Packagesmentioning
confidence: 99%
“…Operatively, the software generates a huge number of networks, selects the ones having characteristics similar to the graph under analysis (i.e., degree distribution, connected components, topological conformation), and tries iteratively to optimize the generation parameters until all the created graphs have characteristics similar to those processed. This estimator is extremely useful, since it allows to create a probability distribution by which some peculiarities of the graph can be extrapolated, concerning both its intrinsic topology and specific attributes of the nodes ( Admiraal and Handcock, 2007 ). In particular, the package allows to compute simple statistics about the topology of the graph, such as the significance of the vertex clustering attitude (triangle), or the significance of the network tendency to create multiple paths between two vertices (twopath).…”
Section: Methodsmentioning
confidence: 99%
“…Therefore we randomly reshuffled the associations between drivers and regime shifts, keeping the number of links per node unchanged. Simulations were performed in the R statistical software 26 , using a Sequential Importance Sampling algorithm, in R鈥檚 networksis 27 and ergm 28 packages. The comparison between observed interactions and random data is fundamental to understand whether the co-occurrence patterns are due to sampling noise or corresponds to a real pattern.…”
Section: Network Simulationsmentioning
confidence: 99%