From 136fec0771149a16b57781a8aacc64a8bbebd976 Mon Sep 17 00:00:00 2001 From: GitHub Actions Date: Sat, 30 Nov 2024 15:14:28 +0000 Subject: [PATCH] Built site for migraph@1.4.5: 53a08f4 --- 404.html | 4 +- CODE_OF_CONDUCT.html | 4 +- CONTRIBUTING.html | 4 +- LICENSE-text.html | 4 +- LICENSE.html | 4 +- authors.html | 4 +- index.html | 4 +- news/index.html | 372 ++++++++++-------- pkgdown.yml | 4 +- reference/Rplot001.png | Bin 1011 -> 0 bytes reference/defunct.html | 4 +- reference/index.html | 8 +- reference/migraph-package.html | 4 +- reference/mpn_bristol.html | 48 +-- reference/mpn_cow.html | 8 +- reference/mpn_elite_mex.html | 48 +-- reference/mpn_elite_usa.html | 10 +- reference/mpn_evs.html | 4 +- reference/mpn_ryanair.html | 48 +-- reference/mpn_senate112.html | 16 +- .../{mpn_DemSxP.html => mpn_senate_dem.html} | 0 ...{mpn_OverSxP.html => mpn_senate_over.html} | 0 .../{mpn_RepSxP.html => mpn_senate_rep.html} | 0 reference/reexports.html | 4 +- reference/regression-1.png | Bin 70074 -> 70204 bytes reference/regression.html | 6 +- reference/test_configuration.html | 8 + reference/test_distributions.html | 9 +- reference/tests.html | 19 +- 29 files changed, 362 insertions(+), 286 deletions(-) delete mode 100644 reference/Rplot001.png rename reference/{mpn_DemSxP.html => mpn_senate_dem.html} (100%) rename reference/{mpn_OverSxP.html => mpn_senate_over.html} (100%) rename reference/{mpn_RepSxP.html => mpn_senate_rep.html} (100%) create mode 100644 reference/test_configuration.html diff --git a/404.html b/404.html index a6e7872b..ef9c42d9 100644 --- a/404.html +++ b/404.html @@ -39,7 +39,7 @@ migraph - 1.4.2 + 1.4.5 @@ -107,7 +107,7 @@

Page not found (404)

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/CODE_OF_CONDUCT.html b/CODE_OF_CONDUCT.html index 0d7708a5..325b4fc2 100644 --- a/CODE_OF_CONDUCT.html +++ b/CODE_OF_CONDUCT.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -82,7 +82,7 @@

Contributor Code of Conduct

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/CONTRIBUTING.html b/CONTRIBUTING.html index e44ac9cf..d046c4c2 100644 --- a/CONTRIBUTING.html +++ b/CONTRIBUTING.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -117,7 +117,7 @@

Documentation -

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/LICENSE-text.html b/LICENSE-text.html index 85e4aba4..8fd189ba 100644 --- a/LICENSE-text.html +++ b/LICENSE-text.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -77,7 +77,7 @@

License

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/LICENSE.html b/LICENSE.html index 58e8007e..c5bd4577 100644 --- a/LICENSE.html +++ b/LICENSE.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -80,7 +80,7 @@

MIT License

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/authors.html b/authors.html index 92b0c1db..0b0686ce 100644 --- a/authors.html +++ b/authors.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -107,7 +107,7 @@

Citation

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/index.html b/index.html index 604b4107..12f40883 100644 --- a/index.html +++ b/index.html @@ -40,7 +40,7 @@ migraph - 1.4.2 + 1.4.5 @@ -268,7 +268,7 @@

Developers

-

Site built with pkgdown 2.1.0.

+

Site built with pkgdown 2.1.1.

diff --git a/news/index.html b/news/index.html index ed092cc5..2c154c8b 100644 --- a/news/index.html +++ b/news/index.html @@ -17,7 +17,7 @@ migraph - 1.4.2 + 1.4.5 @@ -60,15 +60,69 @@

Changelog

-

migraph 1.4.2

-

2024-09-04

+

migraph 1.4.4

+

2024-11-30

+
+

Package

+
  • Fixed dependency issue
+
+
+

migraph 1.4.4

+

2024-11-29

+
+

Package

+
  • Updated github actions
+
+

Models

+
  • Updated net_regression()
    • It now works (better) with unweighted networks
      • +
    • Added print methods that combine tidy() and glance() +
      • +
    • Fixed effect naming error
      • +
    • Updated same() to work for two-mode networks
      • +
    • Updated specification advice for testing for homophily in two-mode networks
      • +
+
+
+

migraph 1.4.32024-11-06

+

2024-11-06

+
+

Package

+
  • Using different github actions for renaming and releasing binaries (thanks @auzaheta)
    • +
  • Updated manynet dependence to >=1.0.5
    • +
+
+

Models

+
+
+

Data

+
  • Updated mpn_bristol with info
    • +
  • Updated mpn_ryanair with info
    • +
  • Updated mpn_elite_mex with info
    • +
  • Updated mpn_elite_usa +
    • +
  • Updated mpn_senate +
    • +
  • Updated mpn_cow +
    • +
+
+

Tutorial

+
  • Updated diversity tutorial
    • More elaborate start
      • +
    • Broader figure widths
      • +
    • Dropped alter(Discipline) from net_regression() call
      • +
+
+
+

migraph 1.4.22024-09-04

+

2024-09-03

Package

  • Using github actions download artifact v4 to address dependabot security warning

Models

+test_permutation() now uses manynet::to_permuted() instead of the older manynet::generate_permutation() syntax

migraph 1.4.12024-07-19

@@ -112,7 +166,7 @@

Modelstest_fit() no longer measures fit against steps where there is no covariance -
  • Fixed bug in 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)
    • +
  • Fixed bug in 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)
  • Corrected that test_random() returns results on edge-conditioned uniform graphs, not size
  • Reexported ggplot2::scale_y_discrete()
    • @@ -138,7 +192,7 @@

    migraph 1.3.3Measures

    Members

    @@ -229,7 +283,7 @@

    Members

    Models

    -
    • Migrated play_*() functions to manynet, including as_diffusion() and the diffusion tutorial
      • +
      • Migrated play_*() functions to manynet, including as_diffusion() and the diffusion tutorial
      • Added specification advice to network_reg() so that specifications that include a ‘sim’ or ‘same’ effect for a variable are encouraged to also include more elementary ‘ego’ and ‘alter’ effects
      • network_reg() now ignores the LHS of the formula for uniplex networks
        • @@ -240,7 +294,7 @@

        migraph 1.2.12023-12-17

        Measures

        -

    @@ -259,11 +313,11 @@

    MarksMeasures

    Members

    @@ -272,10 +326,10 @@

    Members

    Models

    @@ -289,12 +343,12 @@

    MarksMeasures

    Models

    -
    @@ -308,8 +362,8 @@

    migraph 1.1.82023-12-06

    Measures

    -
    • Fixed bugs in diffusion measures.
      • Fixed node_thresholds() so that it infers nodes’ thresholds from the amount of exposure they had when they became infected or exposed.
        • -
      • Updated node_adoption_time() and node_adopter() to return node_member and node_measure objects, which makes printing and summarising better.
        • +
        • Fixed bugs in diffusion measures.
          • Fixed node_thresholds() so that it infers nodes’ thresholds from the amount of exposure they had when they became infected or exposed.
            • +
          • Updated node_adoption_time() and node_adopter() to return node_member and node_measure objects, which makes printing and summarising better.
          • Updated node_infection_length() and network_infection_length() which measures the average length nodes remain infected.
    @@ -320,7 +374,7 @@

    Members

    Models

    • Updated diff_model object to carry original network data for plotting.
      • -
    • Updated play_diffusion() to forward exposure/contact information to the events table.
      • +
    • Updated play_diffusion() to forward exposure/contact information to the events table.

    Tutorials

    @@ -341,7 +395,7 @@

    Marks

    Models

    • Added ‘minimising’ distance option for segregation model choice.
      • -
    • Changed ‘satisficing’ option in play_segregation() to sample randomly from those unoccupied options less than the desired threshold.
      • +
    • Changed ‘satisficing’ option in play_segregation() to sample randomly from those unoccupied options less than the desired threshold.

    Tutorials

    @@ -352,10 +406,10 @@

    migraph 1.1.62023-11-08

    Measures

    -
    +

    Models

    -
    @@ -411,7 +465,7 @@

    Measuresnetwork_efficiency()
  • network_upperbound()
    • -
  • Added node_eccentricity(), which wraps igraph::eccentricity() +
  • Added node_eccentricity(), which wraps igraph::eccentricity()
  • Added node_neighbours_degree(), which wraps igraph::knn()
    • @@ -461,12 +515,12 @@

    Package

    Measures

    -

    Models

    @@ -517,11 +571,11 @@

    Package

    Measures

    -

    @@ -550,13 +604,13 @@

    Package

    Makes

    -

    Manipulations

    -
    @@ -568,10 +622,10 @@

    Package

    Makes

    -
    • Fixed bug in read_pajek() where multiple networks/ties were causing an issue for partition assignment

    +

    Models

    -
    +

    migraph 0.13.02022-11-30

    @@ -582,7 +636,7 @@

    Package

    Marks

    -
    • Added is_aperiodic() for testing whether a network is aperiodic (the greatest common divisor for all cycles in the network is 1)
      • Note that for computational efficiency, this will check only up to a specified path length (by default 4)
      • +
      • Added is_aperiodic() for testing whether a network is aperiodic (the greatest common divisor for all cycles in the network is 1)
        • Note that for computational efficiency, this will check only up to a specified path length (by default 4)
      • node_is_max() and node_is_min() now take a “rank” argument for selecting more than the first ranked maxima or minima

    @@ -597,7 +651,7 @@

    Measuresnetwork_richness() and node_richness() for calculating the richness (a common diversity measure) of an attribute in a network

    Models

    -
    • Extended play_diffusion() to include more compartment and transition options
      • The print method now tabulates the compartment sums per step
        • +
        • Extended play_diffusion() to include more compartment and transition options
          • The print method now tabulates the compartment sums per step
          • The summary method now presents the diffusion event list
          • The plot method now:
            • plots lines for S and I compartments, as blue and red lines respectively, if available or informs the user if no diffusion could be simulated
            • plots lines for E and R compartments, as orange and green lines respectively, if relevant
              • @@ -611,13 +665,13 @@

              Modelsplay_diffusions() for running a diffusion model multiple times
              • Note for accelerating documentation and tutorials, this is 5 by default, but for publication quality results this should be increased
                • +
              • Added play_diffusions() for running a diffusion model multiple times
                • Note for accelerating documentation and tutorials, this is 5 by default, but for publication quality results this should be increased
                • A print method tabulates the compartment sums per step per simulation
                • A summary method tabulates the steps until complete infection (or recovery) for each simulation
                • A plot method visualises the loess for each compartment across all simulations
                • Note that this function uses furrr and so a multicore or multisession strategy can be used for parallelisation (but this only makes sense for many simulations)
                • -
              • Added play_learning() for running a DeGroot learning model
                • A print method tabulates nodes beliefs at each step
                  • +
                • Added play_learning() for running a DeGroot learning model
                  • A print method tabulates nodes beliefs at each step
                  • A summary method informs how many steps it took until convergence or whether there was no convergence after t steps
                  • A plot method visualises the belief trajectories for each node
                  • @@ -649,7 +703,7 @@

                  Marksnode_is_random() for selecting n nodes at random

    Models

    -
    • Added first draft of (SI) play_diffusion() model
      • Added diff_model class, together with print, summary, and plot methods
    +

    migraph 0.12.5

    @@ -658,11 +712,11 @@

    Package

    Makes

    -

    Manipulating

    -
    • Added more similarity options for projection (to_mode1() and to_mode2())
      • +
      • Added more similarity options for projection (to_mode1() and to_mode2())
      • Fixed bug in to_redirected.igraph() where routing through an edgelist caused problems
    @@ -711,7 +765,7 @@

    Make

    Marks

    -
    • Added is_eulerian() for a logical expression of whether the network has an Eulerian path

    +

    Measures

    • @@ -741,19 +795,19 @@

      migraph 0.12.1<

      Manipulations

      • -to_twomode() now returns an undirected network
        • -
      • Added to_anti() for obtaining the complement of the given network
        • Note that unlike the implementation in igraph, this respects two-mode constructions
        • +to_twomode() now returns an undirected network +
      • Added to_anti() for obtaining the complement of the given network
        • Note that unlike the implementation in igraph, this respects two-mode constructions

      Marks

      -
      • Added is_perfect_matching() for a logical expression of whether the maximum matching of a network is also perfect
        • +
        • Added is_perfect_matching() for a logical expression of whether the maximum matching of a network is also perfect
        • Added node_is_core() for a logical vector of which nodes are members of the core

      Measures

      • -node_degree() now has an additional parameter for trading off between degree and strength in the case of weighted networks
        • -
      • Added node_power() for Bonacich power centrality for both one- and two-mode networks (closed #193)
        • +node_degree() now has an additional parameter for trading off between degree and strength in the case of weighted networks +
      • Added node_power() for Bonacich power centrality for both one- and two-mode networks (closed #193)
      • Tie centrality measures now have their own help page (WIP)
      @@ -823,38 +877,38 @@

      Package

      Manipulation

      -
      • Added as_graphAM() methods for all migraph-consistent object classes so {Rgraphviz} can be used effectively
        • -
      • Added as_igraph(), as_tidygraph(), and as_network() methods for RSiena sienaData objects (thanks @JaelTan, closed #94)
        • -
      • Added as_edgelist() and as_matrix() methods for network.goldfish class objects
        • -
      • The "twomode" argument in as_matrix() is now NULL by default, allowing both one-mode and two-mode coercion
        • +
        • Added as_graphAM() methods for all migraph-consistent object classes so {Rgraphviz} can be used effectively
          • +
        • Added as_igraph(), as_tidygraph(), and as_network() methods for RSiena sienaData objects (thanks @JaelTan, closed #94)
          • +
        • Added as_edgelist() and as_matrix() methods for network.goldfish class objects
          • +
        • The "twomode" argument in as_matrix() is now NULL by default, allowing both one-mode and two-mode coercion
        • -to_mode1() and to_mode2() now take an extra argument to produce weighted projections by different “similarity” measures
          • “count” (the default) returns a raw count of the coincidence of nodes in the specified mode with nodes of the other mode
            • +to_mode1() and to_mode2() now take an extra argument to produce weighted projections by different “similarity” measures
            • “count” (the default) returns a raw count of the coincidence of nodes in the specified mode with nodes of the other mode
            • “jaccard” (Jaccard index) offers a measure of opportunity weighted by participation
            • “rand” (Simple Matching Coefficient) offers a measure of behavioral mirroring
            • “pearson” (Pearson’s correlation) and “yule” (Yule’s Q) offer correlation coefficients for valued and binary data, respectively
            • These options work for edgelists, matrices, igraph and tidygraph, and network objects
            -
          • Added to_matching() methods to transform a two-mode network or network with some other (binary) “mark” attribute into a network of matching ties
            • -
          • Renamed to_main_component() to to_giant() to be more space efficient
            • Added methods for edgelists and matrices
            • -
          • Added two-mode application for to_blocks() (closed #242)
            • Fixed bug in to_blocks() where NA blocks couldn’t be subsequently coerced
            • +
          • Added to_matching() methods to transform a two-mode network or network with some other (binary) “mark” attribute into a network of matching ties
            • +
          • Renamed to_main_component() to to_giant() to be more space efficient
            • Added methods for edgelists and matrices
            • +
          • Added two-mode application for to_blocks() (closed #242)
            • Fixed bug in to_blocks() where NA blocks couldn’t be subsequently coerced
          • Filled in a number of S3 methods
            • -
          • Fixed bug where to_unweighted() didn’t respect the “threshold” specified
            • +
          • Fixed bug where to_unweighted() didn’t respect the “threshold” specified

      Marks

      • Fixed eternal loop bug where node_mode() couldn’t produce a “mark” class object
      • Fixed bug where node names/labels were not being added to mark objects
        • -
      • Fixed bug in is_twomode() where labelling information was being ignored
        • +
      • Fixed bug in is_twomode() where labelling information was being ignored

      Measures

      @@ -863,7 +917,7 @@

      Measures

      Membership

      • Added node_core() for partitioning nodes into core and periphery memberships
        • -
      • Fixed floating point bug in k_strict() +
      • Fixed floating point bug in k_strict()

      @@ -924,7 +978,7 @@

      Package

      Manipulation

      @@ -947,7 +1001,7 @@

      Memberships

      Models

      +cluster_concor() and cluster_hierarchical() are now exported

    Mapping

    • @@ -971,7 +1025,7 @@

      Membershipsmigraph 0.10.1

      Measures

      -
      • Added node_reach() for calculating reach centrality (closed #196)
        • +
        • Added node_reach() for calculating reach centrality (closed #196)
        • Separated (again) centrality and centralisation documentation
      @@ -983,7 +1037,7 @@

      migraph 0.10.0<

      Package

      Manipulation

      -
      • Added a couple of to_ functions useful for working with networks of different types
      @@ -1125,7 +1179,7 @@

      Package

      Making

      -
      • Folded m argument into p for generate_random(), p can now be passed an integer to indicate the number of ties the network should have

      +
      • Folded m argument into p for generate_random(), p can now be passed an integer to indicate the number of ties the network should have

      Manipulation

      • Refactored to_edges() to be ~26 times faster on average
        • @@ -1145,9 +1199,9 @@

        Measuresnode_degree() now calculates strength centrality if network is weighted +node_degree() now calculates strength centrality if network is weighted
      • -node_eigenvector() and graph_eigenvector() both work with two-mode networks
        • +node_eigenvector() and graph_eigenvector() both work with two-mode networks
      • Added edge_degree() and edge_eigenvector(), which both just apply the corresponding nodal measure to the edge graph

    • @@ -1217,12 +1271,12 @@

      Making@describeIn documentation (closed #215)

    • Distinguished directed 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 object
      • +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 object
    • All create_*() functions now accept existing objects as their first argument and will create networks with the same dimensions
    • -read_pajek() now imports nodal attributes alongside the main edges
      • +read_pajek() now imports nodal attributes alongside the main edges
    • -read_ucinet() now enjoys clearer documentation
      • +read_ucinet() now enjoys clearer documentation

    Manipulation

    @@ -1231,15 +1285,15 @@

    Manipulation as_matrix.igraph() now better handles edge signs -
  • Pivoted to S3 methods for most manipulation functions for better dispatching and performance

    • @@ -1362,7 +1416,7 @@

    ManipulationClosed #179 by inferring an attribute vector is for one of the two modes where possible in add_node_attributes() -
  • Added is_ methods: is_multiplex(), is_uniplex(), is_acyclic() +
  • Added is_ methods: is_multiplex(), is_uniplex(), is_acyclic()
  • Added edge_ functions to identify edges by properties: edge_mutual(), edge_multiple(), edge_loop()
    • @@ -1372,11 +1426,11 @@

    Manipulationmigraph 0.8.11

    Import and export

    -

    Package

    -
    @@ -1384,12 +1438,12 @@

    Packagemigraph 0.8.10

    Import and export

    -

    Manipulation

    -
    @@ -1399,22 +1453,22 @@

    Package#139 by adding vignette on importing and connecting data

    Import and export

    -

    Manipulation

    -

    Measures

    @@ -1440,15 +1494,15 @@

    Data
  • Added ison_eies dataset for use in practical 7 vignette

    • Manipulation

    -
    @@ -1458,7 +1512,7 @@

    Measures

    Modelling

    -