EcoNetGen (Q144415): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
 
(16 intermediate revisions by 4 users not shown)
Property / programmed in
 
Property / programmed in: R / rank
Normal rank
 
Property / last update
13 July 2019
Timestamp+2019-07-13T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
 
Property / last update: 13 July 2019 / rank
Normal rank
 
Property / author
 
Property / author: Marcus A. M. de Aguiar / rank
Normal rank
 
Property / author
 
Property / author: Erica A. Newman / rank
Normal rank
 
Property / author
 
Property / author: Mathias M. Pires / rank
Normal rank
 
Property / author
 
Property / author: Carl Boettiger / rank
Normal rank
 
Property / copyright license
 
Property / copyright license: GNU General Public License, version 3.0 / rank
Normal rank
 
Property / imports
 
Property / imports: igraph / rank
Normal rank
 
Property / imports
 
Property / imports: ggplot2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Revealing biases in the sampling of ecological interaction networks / rank
Normal rank
 
Property / software version identifier
 
0.1.1
Property / software version identifier: 0.1.1 / rank
 
Normal rank
Property / software version identifier: 0.1.1 / qualifier
 
publication date: 10 April 2018
Timestamp+2018-04-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.2.0
Property / software version identifier: 0.2.0 / rank
 
Normal rank
Property / software version identifier: 0.2.0 / qualifier
 
publication date: 18 May 2018
Timestamp+2018-05-18T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.2.1
Property / software version identifier: 0.2.1 / rank
 
Normal rank
Property / software version identifier: 0.2.1 / qualifier
 
publication date: 11 August 2018
Timestamp+2018-08-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.2.2
Property / software version identifier: 0.2.2 / rank
 
Normal rank
Property / software version identifier: 0.2.2 / qualifier
 
publication date: 5 October 2018
Timestamp+2018-10-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.2.3
Property / software version identifier: 0.2.3 / rank
 
Normal rank
Property / software version identifier: 0.2.3 / qualifier
 
publication date: 14 July 2019
Timestamp+2019-07-14T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.2.4
Property / software version identifier: 0.2.4 / rank
 
Normal rank
Property / software version identifier: 0.2.4 / qualifier
 
publication date: 27 August 2023
Timestamp+2023-08-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / programmed in
 
Property / programmed in: R / rank
 
Normal rank
Property / last update
 
27 August 2023
Timestamp+2023-08-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / last update: 27 August 2023 / rank
 
Normal rank
Property / description
 
Randomly generate a wide range of interaction networks with specified size, average degree, modularity, and topological structure. Sample nodes and links from within simulated networks randomly, by degree, by module, or by abundance. Simulations and sampling routines are implemented in 'FORTRAN', providing efficient generation times even for large networks. Basic visualization methods also included. Algorithms implemented here are described in de Aguiar et al. (2017) <arXiv:1708.01242>.
Property / description: Randomly generate a wide range of interaction networks with specified size, average degree, modularity, and topological structure. Sample nodes and links from within simulated networks randomly, by degree, by module, or by abundance. Simulations and sampling routines are implemented in 'FORTRAN', providing efficient generation times even for large networks. Basic visualization methods also included. Algorithms implemented here are described in de Aguiar et al. (2017) <arXiv:1708.01242>. / rank
 
Normal rank
Property / author
 
Property / author: Marcus A. M. de Aguiar / rank
 
Normal rank
Property / author
 
Property / author: Erica A. Newman / rank
 
Normal rank
Property / author
 
Property / author: Mathias M. Pires / rank
 
Normal rank
Property / author
 
Property / author: Carl Boettiger / rank
 
Normal rank
Property / copyright license
 
Property / copyright license: GNU General Public License, version 3.0 / rank
 
Normal rank
Property / imports
 
Property / imports: igraph / rank
 
Normal rank
Property / imports
 
Property / imports: ggplot2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revealing biases in the sampling of ecological interaction networks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI software profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:00, 12 March 2024

Simulate and Sample from Ecological Interaction Networks
Language Label Description Also known as
English
EcoNetGen
Simulate and Sample from Ecological Interaction Networks

    Statements

    0 references
    0.2.3
    13 July 2019
    0 references
    0.1.1
    10 April 2018
    0 references
    0.2.0
    18 May 2018
    0 references
    0.2.1
    11 August 2018
    0 references
    0.2.2
    5 October 2018
    0 references
    0.2.3
    14 July 2019
    0 references
    0.2.4
    27 August 2023
    0 references
    0 references
    27 August 2023
    0 references
    Randomly generate a wide range of interaction networks with specified size, average degree, modularity, and topological structure. Sample nodes and links from within simulated networks randomly, by degree, by module, or by abundance. Simulations and sampling routines are implemented in 'FORTRAN', providing efficient generation times even for large networks. Basic visualization methods also included. Algorithms implemented here are described in de Aguiar et al. (2017) <arXiv:1708.01242>.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references