diff --git a/404.html b/404.html index cb9ad25f..32780a31 100644 --- a/404.html +++ b/404.html @@ -39,7 +39,7 @@
diff --git a/CODE_OF_CONDUCT.html b/CODE_OF_CONDUCT.html index 5ba06ed3..11a1af85 100644 --- a/CODE_OF_CONDUCT.html +++ b/CODE_OF_CONDUCT.html @@ -17,7 +17,7 @@ diff --git a/CONTRIBUTING.html b/CONTRIBUTING.html index 4f3bbfa2..7204858d 100644 --- a/CONTRIBUTING.html +++ b/CONTRIBUTING.html @@ -17,7 +17,7 @@ diff --git a/LICENSE-text.html b/LICENSE-text.html index 0df9b092..f06044be 100644 --- a/LICENSE-text.html +++ b/LICENSE-text.html @@ -17,7 +17,7 @@ diff --git a/LICENSE.html b/LICENSE.html index 1a3c4f03..d132c845 100644 --- a/LICENSE.html +++ b/LICENSE.html @@ -17,7 +17,7 @@ diff --git a/authors.html b/authors.html index 2f21d90a..2dca4194 100644 --- a/authors.html +++ b/authors.html @@ -17,7 +17,7 @@ diff --git a/index.html b/index.html index ca53431f..0c39c6a0 100644 --- a/index.html +++ b/index.html @@ -49,7 +49,7 @@ diff --git a/news/index.html b/news/index.html index ff160a9b..bf0f3af3 100644 --- a/news/index.html +++ b/news/index.html @@ -17,7 +17,7 @@ @@ -54,7 +54,43 @@2023-11-15
+ + +node_is_mentor()
for indicating nodes with high indegree.play_segregation()
to sample randomly from those unoccupied options less than the desired threshold.2023-11-08
+network_transmissability()
, node_infection_length()
, network_infection_length()
, network_reproduction()
, node_adoption_time()
, node_adopter()
, node_thresholds()
.play_diffusion()
.2023-11-02
as_graphAM()
methods for all migraph-consistent object classes so {Rgraphviz}
can be used effectivelyas_igraph()
, as_tidygraph()
, and as_network()
methods for RSiena sienaData objects (thanks @JaelTan, closed #94)as_igraph()
, as_tidygraph()
, and as_network()
methods for RSiena sienaData objects (thanks @JaelTan, closed #94)as_edgelist()
and as_matrix()
methods for network.goldfish
class objects"twomode"
argument in as_matrix()
is now NULL
by default, allowing both one-mode and two-mode coercionclosure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/brokerage_census.html b/reference/brokerage_census.html
index f95c53fb..22c4785f 100644
--- a/reference/brokerage_census.html
+++ b/reference/brokerage_census.html
@@ -17,7 +17,7 @@
@@ -112,16 +112,16 @@ closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/closure.html b/reference/closure.html
index 6a1d91a7..937ae168 100644
--- a/reference/closure.html
+++ b/reference/closure.html
@@ -18,7 +18,7 @@
@@ -134,6 +134,7 @@ close_centrality
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
@@ -146,7 +147,7 @@ network_reciprocity(ison_southern_women)
#> [1] 1
node_reciprocity(to_unweighted(ison_networkers))
-#> `LIN FREEMAN` `DOUG WHITE` `EV ROGERS` `RICHARD ALBA` `PHIPPS ARABIE`
+#> `Lin Freeman` `Doug White` `Ev Rogers` `Richard Alba` `Phipps Arabie`
#> 1 0.935 0.75 1 0.944 0.286
#> # ... with 27 more values from this nodeset unprinted. Use `print(..., n = Inf)` to print all values.
network_transitivity(ison_adolescents)
diff --git a/reference/cluster.html b/reference/cluster.html
index 7f554a8e..954eb156 100644
--- a/reference/cluster.html
+++ b/reference/cluster.html
@@ -22,7 +22,7 @@
close_centrality
,
closure
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/community.html b/reference/community.html
index 6dcd8e2b..0a8ff85e 100644
--- a/reference/community.html
+++ b/reference/community.html
@@ -21,7 +21,7 @@
@@ -320,7 +320,7 @@ close_centrality
,
closure
,
cohesion()
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/diffusion.html b/reference/diffusion.html
new file mode 100644
index 00000000..47d0142d
--- /dev/null
+++ b/reference/diffusion.html
@@ -0,0 +1,146 @@
+
+Functions to play games on networks
+network_transmissibility(diff_model)
+
+node_infection_length(diff_model)
+
+network_infection_length(diff_model)
+
+network_reproduction(diff_model)
+
+node_adoption_time(diff_model)
+
+node_adopter(diff_model)
+
+node_thresholds(diff_model)
A valid network diffusion model.
network_transmissibility()
: Calculates the average transmissibility observed
+in a diffusion simulation, or the number of new infections over
+the number of susceptible, over the number of infected
node_infection_length()
: Calculates the average length nodes remain
+infected in a compartmental model with recovery
network_infection_length()
: Calculates the average length nodes remain
+infected in a compartmental model with recovery for the network as a whole
network_reproduction()
: Calculates the observed reproductive number
+in a diffusion simulation as the network's transmissibility over
+the network's average infection length
node_adoption_time()
: Returns nodes' time of adoption/infection
node_adopter()
: Returns nodes' time of adoption/infection
node_thresholds()
: Infers nodes' thresholds from the amount
+of exposure they had when they became infected
Kermack, W. and McKendrick, A., 1927. "A contribution to the mathematical theory of epidemics". +Proc. R. Soc. London A 115: 700-721.
+Valente, Tom W. (1995). Network models of the diffusion of innovations +(2nd ed.). Cresskill N.J.: Hampton Press.
+Other measures:
+between_centrality
,
+close_centrality
,
+closure
,
+cohesion()
,
+degree_centrality
,
+eigenv_centrality
,
+features
,
+heterogeneity
,
+hierarchy
,
+holes
closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
features
,
heterogeneity
,
hierarchy
,
diff --git a/reference/equivalence.html b/reference/equivalence.html
index 773855da..829cce31 100644
--- a/reference/equivalence.html
+++ b/reference/equivalence.html
@@ -22,7 +22,7 @@
diff --git a/reference/features.html b/reference/features.html
index 127c4ebe..7653a25a 100644
--- a/reference/features.html
+++ b/reference/features.html
@@ -17,7 +17,7 @@
@@ -135,7 +135,7 @@ network_factions()
: Returns correlation between a given network
and a component model with the same dimensions.
If no 'membership' vector is given for the data,
-node_kernaghinlin()
is used to obtain a partition into two groups.
node_kernighanlin()
is used to obtain a partition into two groups.
network_modularity()
: Returns modularity based on nodes' membership
in pre-defined clusters.
network_smallworld()
: Returns small-world metrics for one- and
@@ -207,6 +207,7 @@
closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
heterogeneity
,
hierarchy
,
@@ -234,11 +235,11 @@ node_heterophily()
: Calculates each node's embeddedness within groups
of nodes with the same attribute
network_assortativity()
: Calculates the degree assortativity in a graph.
network_assortativity()
: Calculates the degree assortativity in a network.
closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
hierarchy
,
diff --git a/reference/hierarchy.html b/reference/hierarchy.html
index 14aed594..d6313c9d 100644
--- a/reference/hierarchy.html
+++ b/reference/hierarchy.html
@@ -17,7 +17,7 @@
closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/holes.html b/reference/holes.html
index 69d87231..3d5932a9 100644
--- a/reference/holes.html
+++ b/reference/holes.html
@@ -22,7 +22,7 @@
@@ -157,6 +157,7 @@ closure
,
cohesion()
,
degree_centrality
,
+diffusion
,
eigenv_centrality
,
features
,
heterogeneity
,
diff --git a/reference/index.html b/reference/index.html
index d5e9e1c4..afcc104b 100644
--- a/reference/index.html
+++ b/reference/index.html
@@ -17,7 +17,7 @@
@@ -61,7 +61,7 @@ Marking networks based on their properties
node_is_cutpoint()
node_is_isolate()
node_is_core()
node_is_random()
node_is_max()
node_is_min()
node_is_cutpoint()
node_is_isolate()
node_is_core()
node_is_random()
node_is_mentor()
node_is_max()
node_is_min()
Marking nodes based on their properties
network_connectedness()
network_efficiency()
network_upperbound()
Graph theoretic dimensions of hierarchy
network_transmissibility()
node_infection_length()
network_infection_length()
network_reproduction()
node_adoption_time()
node_adopter()
node_thresholds()
Functions to play games on networks
Functions for calculating subgraphs in multimodal networks. These functions have an additional dimension than node_
and network_
measures and marks that capture the different motifs surveyed.
The number of nodes to select (as TRUE).
The proportion of nodes to be selected as mentors. +By default this is set at 0.1. +This means that the top 10% of nodes in terms of degree, +or those equal to the highest rank degree in the network, +whichever is the higher, will be used to select the mentors.
+Note that if nodes are equidistant from two mentors, +they will choose one at random. +If a node is without a path to a mentor, +for example because they are an isolate, +a tie to themselves (a loop) will be created instead. +Note that this is a different default behaviour than that +described in Valente and Davis (1999).
An object created by a node_
measure.
node_is_random()
: Returns a logical vector
indicating a random selection of nodes as TRUE.
node_is_mentor()
: Returns a logical vector
+indicating mentor (high indegree) nodes as TRUE.
node_is_max()
: Returns logical of which nodes
hold the maximum of some measure
node_is_min()
: Returns logical of which nodes
hold the minimum of some measure
Valente, Thomas, and Rebecca Davis. 1999. +"Accelerating the Diffusion of Innovations Using Opinion Leaders", +Annals of the American Academy of Political and Social Science 566: 56-67.
+Other marks: @@ -152,7 +177,7 @@
task_eg <- manynet::to_named(manynet::to_uniplex(manynet::ison_algebra, "task_tie"))
(tie_cen <- node_tie_census(task_eg))
#> # A tibble: 16 × 33
-#> names fromSydney fromMonique fromJoan fromTucker fromAnnie fromTammie
-#> <chr> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl>
-#> 1 Sydney 0 1 0 0 1 1
-#> 2 Monique 0 0 1 0 0 0
-#> 3 Joan 0 1 0 0 1 1
-#> 4 Tucker 0 0 0 0 0 0
-#> 5 Annie 1 0 1 0 0 1
-#> 6 Tammie 0 0 1 0 1 0
-#> 7 Marco 0 1 1 0 0 1
-#> 8 Eileen 1 1 1 0 1 1
-#> 9 Lester 1 0 0 0 0 0
-#> 10 Claude 1 0 1 1 1 1
-#> 11 Isabel 1 0 1 0 1 1
-#> 12 Christopher 1 1 0 0 0 1
-#> 13 Alexander 1 1 0 0 1 0
-#> 14 Karl 0 1 1 0 0 1
-#> 15 Maximus 1 1 1 0 1 0
-#> 16 Chelsey 1 1 1 1 1 1
-#> # ℹ 26 more variables: fromMarco <dbl>, fromEileen <dbl>, fromLester <dbl>,
-#> # fromClaude <dbl>, fromIsabel <dbl>, fromChristopher <dbl>,
-#> # fromAlexander <dbl>, fromKarl <dbl>, fromMaximus <dbl>, fromChelsey <dbl>,
-#> # toSydney <dbl>, toMonique <dbl>, toJoan <dbl>, toTucker <dbl>,
-#> # toAnnie <dbl>, toTammie <dbl>, toMarco <dbl>, toEileen <dbl>,
-#> # toLester <dbl>, toClaude <dbl>, toIsabel <dbl>, toChristopher <dbl>,
-#> # toAlexander <dbl>, toKarl <dbl>, toMaximus <dbl>, toChelsey <dbl>
+#> names fromJose fromGeraldine fromMarissa fromColton fromHeidi fromChristopher
+#> <chr> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl>
+#> 1 Jose 0 1 0 0 1 1
+#> 2 Gera… 0 0 1 0 0 0
+#> 3 Mari… 0 1 0 0 1 1
+#> 4 Colt… 0 0 0 0 0 0
+#> 5 Heidi 1 0 1 0 0 1
+#> 6 Chri… 0 0 1 0 1 0
+#> 7 Flos… 0 1 1 0 0 1
+#> 8 Rosa 1 1 1 0 1 1
+#> 9 Etta 1 0 0 0 0 0
+#> 10 Mere… 1 0 1 1 1 1
+#> 11 Darl… 1 0 1 0 1 1
+#> 12 Cole 1 1 0 0 0 1
+#> 13 Alexa 1 1 0 0 1 0
+#> 14 Micah 0 1 1 0 0 1
+#> 15 Xand… 1 1 1 0 1 0
+#> 16 Alice 1 1 1 1 1 1
+#> # ℹ 26 more variables: fromFlossie <dbl>, fromRosa <dbl>, fromEtta <dbl>,
+#> # fromMeredith <dbl>, fromDarlene <dbl>, fromCole <dbl>, fromAlexa <dbl>,
+#> # fromMicah <dbl>, fromXander <dbl>, fromAlice <dbl>, toJose <dbl>,
+#> # toGeraldine <dbl>, toMarissa <dbl>, toColton <dbl>, toHeidi <dbl>,
+#> # toChristopher <dbl>, toFlossie <dbl>, toRosa <dbl>, toEtta <dbl>,
+#> # toMeredith <dbl>, toDarlene <dbl>, toCole <dbl>, toAlexa <dbl>,
+#> # toMicah <dbl>, toXander <dbl>, toAlice <dbl>
(triad_cen <- node_triad_census(task_eg))
#> # A tibble: 16 × 17
#> names X003 X012 X102 X021D X021U X021C X111D X111U X030T X030C X201 X120D
#> <chr> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl> <dbl>
-#> 1 Sydn… 6 12 32 0 1 0 7 3 0 0 8 1
-#> 2 Moni… 15 12 42 0 0 0 0 5 0 0 4 1
-#> 3 Joan 20 5 37 0 0 0 3 3 0 0 12 0
-#> 4 Tuck… 102 0 3 0 0 0 0 0 0 0 0 0
-#> 5 Annie 15 5 41 0 0 0 2 1 0 0 13 0
-#> 6 Tamm… 20 5 41 0 0 0 3 2 0 0 11 0
-#> 7 Marco 28 0 51 0 0 0 0 2 0 0 6 0
-#> 8 Eile… 18 0 42 0 0 0 2 1 0 0 18 0
-#> 9 Lest… 86 2 17 0 0 0 0 0 0 0 0 0
-#> 10 Clau… 25 6 35 0 0 0 3 3 0 0 15 0
-#> 11 Isab… 65 4 36 0 0 0 0 0 0 0 0 0
-#> 12 Chri… 72 3 30 0 0 0 0 0 0 0 0 0
-#> 13 Alex… 76 3 26 0 0 0 0 0 0 0 0 0
-#> 14 Karl 56 2 47 0 0 0 0 0 0 0 0 0
-#> 15 Maxi… 58 5 42 0 0 0 0 0 0 0 0 0
-#> 16 Chel… 0 0 0 0 0 0 0 0 0 0 44 0
+#> 1 Jose 6 12 32 0 1 0 7 3 0 0 8 1
+#> 2 Gera… 15 12 42 0 0 0 0 5 0 0 4 1
+#> 3 Mari… 20 5 37 0 0 0 3 3 0 0 12 0
+#> 4 Colt… 102 0 3 0 0 0 0 0 0 0 0 0
+#> 5 Heidi 15 5 41 0 0 0 2 1 0 0 13 0
+#> 6 Chri… 20 5 41 0 0 0 3 2 0 0 11 0
+#> 7 Flos… 28 0 51 0 0 0 0 2 0 0 6 0
+#> 8 Rosa 18 0 42 0 0 0 2 1 0 0 18 0
+#> 9 Etta 86 2 17 0 0 0 0 0 0 0 0 0
+#> 10 Mere… 25 6 35 0 0 0 3 3 0 0 15 0
+#> 11 Darl… 65 4 36 0 0 0 0 0 0 0 0 0
+#> 12 Cole 72 3 30 0 0 0 0 0 0 0 0 0
+#> 13 Alexa 76 3 26 0 0 0 0 0 0 0 0 0
+#> 14 Micah 56 2 47 0 0 0 0 0 0 0 0 0
+#> 15 Xand… 58 5 42 0 0 0 0 0 0 0 0 0
+#> 16 Alice 0 0 0 0 0 0 0 0 0 0 44 0
#> # ℹ 4 more variables: X120U <dbl>, X120C <dbl>, X210 <dbl>, X300 <dbl>
node_quad_census(manynet::ison_southern_women)
#> # A tibble: 32 × 13
diff --git a/reference/over.html b/reference/over.html
index aa7758be..346eda3f 100644
--- a/reference/over.html
+++ b/reference/over.html
@@ -17,7 +17,7 @@
A proportion indicating the transmission rate, +
The transmission rate probability, \(\beta\). By default 1, which means any node for which the threshold is met or exceeded will become infected. @@ -136,17 +136,17 @@
A proportion indicating the rate at which those exposed -become infectious (infected), \(\sigma\). +
The inverse probability those who have been exposed +become infectious (infected), \(\sigma\) or \(\kappa\). For example, if exposed individuals take, on average, -four days to become infectious, then \(\sigma = 0.25\). +four days to become infectious, then \(\sigma = 0.75\) (1/1-0.75 = 1/0.25 = 4). By default 0, which means those exposed become immediately infectious (i.e. an SI model). Anything higher results in e.g. a SEI model.
A proportion indicating the rate of recovery, -\(\gamma\). +
The probability those who are infected +recover, \(\gamma\). For example, if infected individuals take, on average, four days to recover, then \(\gamma = 0.25\). By default 0, which means there is no recovery (i.e. an SI model). @@ -154,8 +154,8 @@
A proportion indicating the rate at which those who are -recovered become susceptible again, \(\xi\). +
The probability those who are recovered +become susceptible again, \(\xi\). For example, if recovered individuals take, on average, four days to lose their immunity, then \(\xi = 0.25\). By default 0, which means any recovered individuals retain lifelong immunity (i.e. an SIR model). @@ -241,7 +241,8 @@
One of the following options: "satisficing" (the default) will move the node to any coordinates that satisfy their heterophily threshold, -whereas "optimising" will move the node to coordinates that are most homophilous.