Modelling Structured Dynamical Systems in 'greta'
c(
person(
given = "Nick",
family = "Golding",
email = "nick.golding.research@gmail.com",
role = c("aut", "cph"),
comment = c(ORCID = "0000-0001-8916-5570")
),
person(
given = "Nicholas",
family = "Tierney",
email = "nicholas.tierney@gmail.com",
role = c("aut", "cre"),
comment = c(ORCID = "https://orcid.org/0000-0003-1460-8722")
)
)
A 'greta' extension for analysing transition matrices and
ordinary differential equations representing dynamical systems. Provides
functions for analysing transition matrices by iteration, and solving
ordinary differential equations. This is an extension to the 'greta'
software, Golding (2019) <doi:10.21105/joss.01601>.
covr, knitr, rmarkdown, spelling, testthat (>= 3.1.0),
deSolve, abind
Nick Golding [aut, cph] (<https://orcid.org/0000-0001-8916-5570>),
Nicholas Tierney [aut, cre] (<https://orcid.org/0000-0003-1460-8722>)

c(
person(
given = "Nick",
family = "Golding",
email = "nick.golding.research@gmail.com",
role = c("aut", "cph"),
comment = c(ORCID = "0000-0001-8916-5570")
),
person(
given = "Jian",
family = "Yen",
role = "ctb"
),
person(
given = "Nicholas",
family = "Tierney",
email = "nicholas.tierney@gmail.com",
role = c("aut", "cre"),
comment = c(ORCID = "https://orcid.org/0000-0003-1460-8722")
)
)
Provides a syntax to create and combine Gaussian process kernels
in 'greta'. You can then them to define either full rank or sparse Gaussian
processes. This is an extension to the 'greta' software, Golding (2019)
<doi:10.21105/joss.01601>.
covr, knitr, rmarkdown, spelling, testthat (>= 3.1.0)
Nick Golding [aut, cph] (<https://orcid.org/0000-0001-8916-5570>),
Jian Yen [ctb],
Nicholas Tierney [aut, cre] (<https://orcid.org/0000-0003-1460-8722>)

Generalized Path Analysis for Social Networks
person("David", "Buch", email = "davidbuch42@gmail.com",
role = c("aut", "cre"), comment = c(ORCID = "0000-0002-4574-0075"))
The social network literature features numerous methods for assigning
value to paths as a function of their ties. 'gretel' systemizes these approaches,
casting them as instances of a generalized path value function indexed by
a penalty parameter. The package also calculates probabilistic path value and
identifies optimal paths in either value framework. Finally, proximity
matrices can be generated in these frameworks that capture high-order connections
overlooked in primitive adjacency sociomatrices. Novel methods are described
in Buch (2019) <https://davidbuch.github.io/analyzing-networks-with-gretel.html>.
More traditional methods are also implemented, as described in Yang, Knoke (2001)
<doi:10.1016/S0378-8733(01)00043-0>.