2024-09-04
+ +test_permutation() now uses manynet::to_permuted() instead of the older manynet::generate_permutation() syntax2024-07-19
test_random() where parameters were passed to manynet::generate_random() instead of the original object, which is processed more intuitively within manynet::generate_random() (thanks @RWKrause)test_random() where parameters were passed to manynet::generate_random() instead of the original object, which is processed more intuitively within manynet::generate_random() (thanks @RWKrause)test_random() returns results on edge-conditioned uniform graphs, not sizeggplot2::scale_y_discrete()
to_components() to return the components of a network as a list of networksto_egos() to return the ego networks of a network as a list of networksto_subgraphs() to return attribute-based subgraphs as a list of networksto_components() to return the components of a network as a list of networksto_egos() to return the ego networks of a network as a list of networksto_subgraphs() to return attribute-based subgraphs as a list of networksgenerate_random()
+generate_random()
create_lattice() now conforms to other create_*() functions in how it interprets "n""n" for a one-mode network, it will create a transitive lattice of as even dimensions as possiblecreate_lattice() now conforms to other create_*() functions in how it interprets "n""n" for a one-mode network, it will create a transitive lattice of as even dimensions as possiblecreate_ and generate_ functions now:n passed an existing networkcreate_tree(), generate_smallworld(), generate_scalefree()
+create_tree(), generate_smallworld(), generate_scalefree()
create_ functions can now take a membership vector or split into equal partitions by defaultcreate_components() no longer accepts a number of components, instead relying on the membership vectorcreate_core() for creating core-periphery graphscreate_components() no longer accepts a number of components, instead relying on the membership vectorcreate_core() for creating core-periphery graphsgenerate_random() now inherits attributes from any networkgenerate_random() now inherits attributes from any network
m argument into p for generate_random(), p can now be passed an integer to indicate the number of ties the network should havem argument into p for generate_random(), p can now be passed an integer to indicate the number of ties the network should haveto_edges() to be ~26 times faster on averagedirected and direction arguments in some functions; whereas directed is always logical (TRUE/FALSE), direction expects a character string, e.g. “in”, “out”, or “undirected”generate_permutation() now has an additional logical argument, with_attr, that indicates whether any attributes from the original data should be passed to the permuted objectgenerate_permutation() now has an additional logical argument, with_attr, that indicates whether any attributes from the original data should be passed to the permuted object
create_*() functions now accept existing objects as their first argument and will create networks with the same dimensionsread_pajek() now imports nodal attributes alongside the main edgesgenerate_permutation() and thus test_permutation()
+generate_permutation() and thus test_permutation()
netlm() to network_reg() to avoid frustrating conflictsnetwork_reg() now accepts migraph-consistent objectsgenerate_permutation() which takes an object and returns an object with the edges permuted, but retaining all nodal attributesgenerate_random() also work with an existing object as input, in which it will return a random graph with the same dimensions and densitygenerate_permutation() which takes an object and returns an object with the edges permuted, but retaining all nodal attributesgenerate_random() also work with an existing object as input, in which it will return a random graph with the same dimensions and densitycreate_tree() and create_lattice(), and made create_star() a bit faster for one-mode networksgenerate_smallworld() and generate_scalefree(), though only for one-mode networks currentlycreate_tree() and create_lattice(), and made create_star() a bit faster for one-mode networksgenerate_smallworld() and generate_scalefree(), though only for one-mode networks currentlyUpdated mpn_bristol documentation
Added create_star() function
Added create_star() function
directed = argumentcreate_ documentationRenamed sample_affiliation() to generate_random()
generate_random() to be able to generate random one- or two-mode networksRenamed sample_affiliation() to generate_random()
generate_random() to be able to generate random one- or two-mode networksReconstructed several creation functions to take universal (one-mode/two-mode) input: specifying n = 5 creates a one-mode network, while specifying n = c(5, 5) creates a two-mode network
create_empty()
+create_empty()
create_complete()
create_ring() to create rings of varying breadthcreate_components() (renamed from create_silos()) to create networks with varying numbers of componentscreate_ring() to create rings of varying breadthcreate_components() (renamed from create_silos()) to create networks with varying numbers of componentssample_affiliation() for random two-mode networkscreate_match() and create_nest()