Description Usage Details References Examples
Data on co-location of finches noted during Charles Darwin's visit to the Galapagos Islands.
1 |
Charles Darwin compiled these data for thirteen finch species on a visit to the Galapagos Islands. For each finch type, he recorded on which of seventeen islands that finch could be found. Sanderson (2000) argues that, in examining island biogeography, it is important to condition on the number of islands and species in order to sample from the appropriate null space, so graphs sampled from the null distribution of the observed graph should have the same marginals. Chen et al. (2005) report the number of graphs matching the marginal constraints of Darwin's finch data to be 67,149,106,137,567,626.
Chen, Yuguo, Persi Diaconis, Susan P. Holmes, and Jun S. Liu (2005). Sequential Monte Carlo methods for statistical analysis of tables. Journal of the American Statistical Association, 100, 109-120.
Sanderson, James G. (2000). Testing Ecological Patterns, American Scientist, 88, 332-339.
1 2 3 4 5 6 7 |
Loading required package: network
network: Classes for Relational Data
Version 1.15 created on 2019-04-01.
copyright (c) 2005, Carter T. Butts, University of California-Irvine
Mark S. Handcock, University of California -- Los Angeles
David R. Hunter, Penn State University
Martina Morris, University of Washington
Skye Bender-deMoll, University of Washington
For citation information, type citation("network").
Type help("network-package") to get started.
networksis: Simulate Bipartite Graphs with Fixed Marginals Through
Sequential Importance Sampling
Version 2.1-3 created on 2015-04-07.
copyright (c) 2008, Ryan Admiraal, Murdoch University
Based on "statnet" project software (statnet.org).
For license and citation information see statnet.org/attribution
For citation information, type citation("networksis").
Type help("networksis-package") to get started.
Network attributes:
vertices = 30
directed = FALSE
hyper = FALSE
loops = FALSE
multiple = FALSE
bipartite = 13
total edges = 122
missing edges = 0
non-missing edges = 122
density = 0.2804598
Vertex attributes:
vertex.names:
character valued attribute
30 valid vertex names
No edge attributes
Network edgelist matrix:
[,1] [,2]
[1,] 16 1
[2,] 17 1
[3,] 18 1
[4,] 19 1
[5,] 20 1
[6,] 21 1
[7,] 22 1
[8,] 23 1
[9,] 25 1
[10,] 26 1
[11,] 27 1
[12,] 28 1
[13,] 29 1
[14,] 30 1
[15,] 14 2
[16,] 15 2
[17,] 16 2
[18,] 17 2
[19,] 18 2
[20,] 19 2
[21,] 20 2
[22,] 21 2
[23,] 22 2
[24,] 23 2
[25,] 25 2
[26,] 27 2
[27,] 28 2
[28,] 14 3
[29,] 15 3
[30,] 16 3
[31,] 17 3
[32,] 18 3
[33,] 19 3
[34,] 20 3
[35,] 21 3
[36,] 22 3
[37,] 23 3
[38,] 24 3
[39,] 25 3
[40,] 27 3
[41,] 28 3
[42,] 16 4
[43,] 17 4
[44,] 18 4
[45,] 21 4
[46,] 23 4
[47,] 25 4
[48,] 26 4
[49,] 28 4
[50,] 29 4
[51,] 30 4
[52,] 14 5
[53,] 15 5
[54,] 16 5
[55,] 18 5
[56,] 19 5
[57,] 20 5
[58,] 21 5
[59,] 22 5
[60,] 23 5
[61,] 25 5
[62,] 27 5
[63,] 28 5
[64,] 24 6
[65,] 26 6
[66,] 16 7
[67,] 17 7
[68,] 18 7
[69,] 19 7
[70,] 20 7
[71,] 21 7
[72,] 22 7
[73,] 25 7
[74,] 27 7
[75,] 28 7
[76,] 25 8
[77,] 16 9
[78,] 17 9
[79,] 18 9
[80,] 19 9
[81,] 20 9
[82,] 21 9
[83,] 22 9
[84,] 23 9
[85,] 25 9
[86,] 28 9
[87,] 16 10
[88,] 17 10
[89,] 18 10
[90,] 19 10
[91,] 20 10
[92,] 21 10
[93,] 22 10
[94,] 23 10
[95,] 25 10
[96,] 27 10
[97,] 28 10
[98,] 16 11
[99,] 17 11
[100,] 18 11
[101,] 20 11
[102,] 21 11
[103,] 23 11
[104,] 16 12
[105,] 17 12
[106,] 14 13
[107,] 15 13
[108,] 16 13
[109,] 17 13
[110,] 18 13
[111,] 19 13
[112,] 20 13
[113,] 21 13
[114,] 22 13
[115,] 23 13
[116,] 24 13
[117,] 25 13
[118,] 26 13
[119,] 27 13
[120,] 28 13
[121,] 29 13
[122,] 30 13
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.