Phylometa from R - UDPATE

Author  Scott Chamberlain

A while back I posted some messy code to run Phylometa from R, especially useful for processing the output data from Phylometa which is not easily done. The code is still quite messy, but it should work now. I have run the code with tens of different data sets and phylogenies so it should work.


I fixed errors when parentheses came up against numbers in the output, and other things. You can use the code for up to 4 levels of your grouping variable. In addition, there are some lines of code to plot the effect sizes with confidence intervals, comparing random and fixed effects models and phylogenetic and traditional models. 

Get the code at my website:
- Use the first file to do the work, calling the second file using source().
- This new code works with Marc's new version of Phylometa, so please update: http://lajeunesse.myweb.usf.edu/publications.html

Again, please let me know if it doesn't work, if it's worthless, what changes could make it better.

Some notes on tree formatting for Phylometa.
1. Trees cannot have node labels - remove them (e.g., tree$node.label < NULL).
2. Trees cannot have zero length branches. This may seem like a non-problem, but it might be for example if you have resolved polytomies and zero length branches are added to resolve the polytomy.
3. I think you cannot have a branch length on the root branch.

Posted in  ggplot2 meta-analysis Phylogenetics R

Author  Scott Chamberlain

Bio-ORACLE

Author  Scott Chamberlain

Bio-ORACLE


A new dataset available of geophysical, biotic and climate data. Should be fun to play with in R.

Posted in 

Author  Scott Chamberlain

basic ggplot2 network graphs - ver2

Author  Scott Chamberlain

I posted last week a simple function to plot networks using ggplot2 package. Here is version 2. I still need to work on figuring out efficient vertex placement.

Changes in version 2:
-You have one of three options: use an igraph object, a matrix, or a dataframe (matrices will be converted to data frames within the function)

-If you have data on food webs similar to that provided in the Takapoto dataset provided in the NetIndices package, you can set trophic = "TRUE", and gggraph will use the function TrophInd to assign trophic levels (the y axis value) to each vertex/node. You have to provide additional information along with this option such as what the imports and exports are, see NetIndices documentation.

-I added some simple error checking.

-if using method="df" and trophic="FALSE", x axis placement of vertices is now done using the function degreex (see inside the fxn), which sorts vertices according to their degree (so the least connected species are on the left of the graph; note that species with the same degree are not stacked on the y-axis because e.g., two vertices of degree=5 would get x=3 then x=4).



######### ggraph version 2
require(bipartite)
require(igraph)
require(ggplot2)
require(NetIndices)
 
# gggraph, version 2
# g = an igraph graph object, a matrix, or data frame
# vplace = type of vertex placement assignment, one of rnorm, runif, etc.
# method = one of 'df' for data frame, "mat' for matrix or "igraph" for an igraph graph object
# trophic = TRUE or FALSE for using Netindices function TrophInd to determine trophic level (y value in graph)
# trophinames = columns in matrix or dataframe to use for calculating trophic level
# import = named or refereced by col# columns of matrix or dataframe to use for import argument of TrophInd
# export = named or refereced by col# columns of matrix or dataframe to use for export argument of TrophInd
# dead = named or refereced by col# columns of matrix or dataframe to use for dead argument of TrophInd
 
gggraph <- function(g, vplace = rnorm, method, trophic = "FALSE",
trophinames, import, export)
{
degreex <- function(x) {
degreecol <- apply(x, 2, function(y) length(y[y>0]))
degreerow <- apply(x, 1, function(y) length(y[y>0]))
degrees <- sort(c(degreecol, degreerow))
df <- data.frame(degrees, x = seq(1, length(degrees), 1))
df$value <- rownames(df)
df
}
# require igraph
if(!require(igraph)) stop("must first install 'igraph' package.")
# require ggplot2
if(!require(ggplot2)) stop("must first install 'ggplot2' package.")
 
if(method=="df"){
if(class(g)=="matrix"){ g <- as.data.frame(g) }
if(class(g)!="data.frame") stop("object must be of class 'data.frame.'")
if(trophic=="FALSE"){
# data preparation from adjacency matrix
temp <- data.frame(expand.grid(dimnames(g))[1:2], as.vector(as.matrix(g)))
temp <- temp[(temp[, 3] > 0) & !is.na(temp[, 3]), ]
temp <- temp[sort.list(temp[, 1]), ]
g_df <- data.frame(rows = temp[, 1], cols = temp[, 2], freqint = temp[, 3])
 
g_df$id <- 1:length(g_df[,1])
g_df <- data.frame(id=g_df[,4], rows=g_df[,1], cols=g_df[,2], freqint=g_df[,3])
g_df <- melt(g_df, id=c(1,4))
 
xy_s <- data.frame(degreex(g), y = rnorm(length(unique(g_df
$value))))
g_df_2 <- merge(g_df, xy_s, by = "value")
} else if(trophic=="TRUE") {
# require NetIndices
if(!require(NetIndices)) stop("must first install 'NetIndices' package.")
# data preparation from adjacency matrix
temp <- data.frame(expand.grid(dimnames(g[-trophinames, -trophinames]))[1:2],
as.vector(as.matrix(g[-trophinames, -trophinames])))
temp <- temp[(temp[, 3] > 0) & !is.na(temp[, 3]), ]
temp <- temp[sort.list(temp[, 1]), ]
g_df <- data.frame(rows = temp[, 1], cols = temp[, 2], freqint = temp[, 3])
 
g_df$id <- 1:length(g_df[,1])
g_df <- data.frame(id=g_df[,4], rows=g_df[,1],
cols=g_df[,2], freqint=g_df[,3])
g_df
<- melt(g_df, id=c(1,4))
 
xy_s <- data.frame(value = unique(g_df$value),
x = rnorm(length(unique(g_df
$value))),
y = TrophInd(g, Import=import, Export=export)[,1])
g_df_2 <- merge(g_df, xy_s, by = "value")
}
# plotting
p <- ggplot(g_df_2, aes(x, y)) +
geom_point(size = 5) +
geom_line(aes(size = freqint, group = id)) +
geom_text(size = 3, hjust = 1.5, aes(label = value)) +
theme_bw() +
opts(panel.grid.major=theme_blank(),
panel.grid.minor=theme_blank(),
axis.text.x=theme_blank(),
axis.text.y=theme_blank(),
axis.title.x=theme_blank(),
axis.title.y=theme_blank(),
axis.ticks=theme_blank(),
panel.border=theme_blank(),
legend.position="none")
 
p # return graph
} else if(method=="igraph") {
if(class(g)!="igraph") stop("object must be of class 'igraph.'")
# data preparation from igraph object
g
<- get.edgelist(g)
g_df <- as.data.frame(g_)
g_df$id <- 1:length(g_df[,1])
g_df <- melt(g_df, id=3)
xy_s <- data.frame(value = unique(g_df$value),
x = vplace(length(unique(g_df$value))),
y = vplace(length(unique(g_df$value))))
g_df2 <- merge(g_df, xy_s, by = "value")
 
# plotting
p <- ggplot(g_df2, aes(x, y)) +
geom_point(size = 2) +
geom_line(size = 0.3, aes(group = id, linetype = id)) +
geom_text(size = 3, hjust = 1.5, aes(label = value)) +
theme_bw() +
opts(panel.grid.major=theme_blank(),
panel.grid.minor=theme_blank(),
axis.text.x=theme_blank(),
axis.text.y=theme_blank(),
axis.title.x=theme_blank(),
axis.title.y=theme_blank(),
axis.ticks=theme_blank(),
panel.border=theme_blank(),
legend.position="none")
 
p # return graph
} else
stop(paste("do not recognize method = \"",method,"\";
methods are \"df\" and \"igraph\""
,sep=""))
}

############### Eg
data(Takapoto)
gggraph(Takapoto, vplace = rnorm, method = "df", trophic = "TRUE", trophinames = c(8:10),
import = "CO2", export = c("CO2", "Sedimentation", "Grazing"))



 
plants <- round(rlnorm(n=5, meanlog=2, sdlog=1))
animals <- round(rlnorm(n=5, meanlog=2, sdlog=1))
plants <- plants(100/sum(plants))
animals <- animals
(100/sum(animals))
z <- r2dtable(1,animals,plants) # if you get errors on this step just rerun again until no error
z <- as.data.frame(z[[1]])
rownames(z) <- c("a","b","c","d","e")
gggraph(z, vplace = rnorm, method = "df", trophic = "FALSE")
 
g <- grg.game(20, 0.45, torus=FALSE)
gggraph(g, vplace = rnorm, method = "igraph", trophic = "FALSE")


Created by Pretty R at inside-R.org

Posted in  ggplot2 bipartite Networks igraph R

Author  Scott Chamberlain

basic ggplot2 network graphs

Author  Scott Chamberlain

I have been looking around on the web and have not found anything yet related to using ggplot2 for making graphs/networks. I put together a few functions to make very simple graphs. The bipartite function especially is not ideal, as of course we only want to allow connections between unlike nodes, not all nodes. These functions do not, obviously, take full advantage of the power of ggplot2, but it’s a start.


# ggplot network graphics functions
# g = an igraph graph object, any igraph graph object
# vplace = type of vertex placement assignment, one of rnorm, runif, etc.
 
gggraph <- function(g, vplace = rnorm) {
 
require(ggplot2)
 
g <- get.edgelist(g)
g_df <- as.data.frame(g
)
g_df$id <- 1:length(g_df[,1])
g_df <- melt(g_df, id=3)
xy_s <- data.frame(value = unique(g_df$value),
x = vplace(length(unique(g_df$value))),
y = vplace(length(unique(g_df$value))))
g_df2 <- merge(g_df, xy_s, by = "value")
 
p <- ggplot(g_df2, aes(x, y)) +
geom_point() +
geom_line(size = 0.3, aes(group = id, linetype = id)) +
geom_text(size = 3, hjust = 1.5, aes(label = value)) +
theme_bw() +
opts(panel.grid.major=theme_blank(),
panel.grid.minor=theme_blank(),
axis.text.x=theme_blank(),
axis.text.y=theme_blank(),
axis.title.x=theme_blank(),
axis.title.y=theme_blank(),
axis.ticks=theme_blank(),
panel.border=theme_blank(),
legend.position="none")
 
p
 
}
 
ggbigraph <- function(g) {
 
require(ggplot2)
 
g <- get.edgelist(g)
g_df <- as.data.frame(g
)
g_df$id <- 1:length(g_df[,1])
g_df <- melt(g_df, id=3)
xy_s <- data.frame(value = unique(g_df$value),
x = c(rep(2, length(unique(g_df$value))/2), rep(4, length(unique(g_df$value))/2)),
y = rep(seq(1, length(unique(g_df$value))/2, 1), 2))
g_df2 <- merge(g_df, xy_s, by = "value")
 
p <- ggplot(g_df2, aes(x, y)) +
geom_point() +
geom_line(size = 0.3, aes(group = id, linetype = id)) +
geom_text(size = 3, hjust = 1.5, aes(label = value)) +
theme_bw() +
opts(panel.grid.major=theme_blank(),
panel.grid.minor=theme_blank(),
axis.text.x=theme_blank(),
axis.text.y=theme_blank(),
axis.title.x=theme_blank(),
axis.title.y=theme_blank(),
axis.ticks=theme_blank(),
panel.border=theme_blank(),
legend.position="none")
 
p
 
}
 
Created by Pretty R at inside-R.org



g <- erdos.renyi.game(20, 5, type="gnm")
gggraph(g, rnorm)

 
g <- barabasi.game(20)
gggraph(g, rnorm)


g <- grg.game(20, 0.45, torus=FALSE)
gggraph(g, rnorm)

 
g <- growing.random.game(20, citation=FALSE)
gggraph(g, rnorm)

 
g <- watts.strogatz.game(1, 20, 5, 0.05)
gggraph(g, rnorm)



# A bipartite graphs

g <- grg.game(20, 0.45, torus=FALSE)
ggbigraph(g)

Posted in  ggplot2 bipartite Networks igraph R

Author  Scott Chamberlain

Species abundance distributions and basketball

Author  Scott Chamberlain

A post over at the Phased blog (http://www.nasw.org/users/mslong/) highlights a recent paper in PLoS One by Robert Warren et al. Similar results were obtained in a 2007 Ecology Letters paper by Nekola and Brown, who showed that abundance distributions found in ecology are similar to those found for scientific citations, Eastern North American precipitation, among other things. A similar argument was made by Nee et al. in 1991 (in the journal PRSL-B). The author of the blog appears to agree with the outcome of the Warren et al. study.

I tend to disagree.

In the field of graphs/networks, many networks (social, sexual intercourse among humans, etc.) are found to have similar statistical properties to those of ecological networks (food webs, interactions among mutualists, etc.). However, just because these networks have similar statistical properties does not mean that the statistical properties of ecological networks have no biological meaning.

They make the argument that the common SAD fit may be an artifact of large data sets alone. However, I don't see any explanation of why they think large data sets is a valid explanation of SADs. Surely SAD's are fit to varying sizes of datasets. The problem with small datasets is lack of statistical power to detect a particular pattern, but surely you can get a fit for a particular SAD to a small dataset.

There are ecological mechanistic theories behind different SAD models. They argue that because very similar SADs are found in ecological and non-ecological datasets alike one option is that a universal mechanism structures ecological and non-ecological data (with the mechanism unknown in both). Why can't the same SAD pattern be generated by different mechanisms?

Are Warren et al, Nekola, and Nee right in questioning the utility of SADs? Questioning our theories and ideas only makes the theories better in the end by weeding out shortcomings, etc.


ResearchBlogging.org
Warren, R., Skelly, D., Schmitz, O., & Bradford, M. (2011). Universal Ecological Patterns in College Basketball Communities PLoS ONE, 6 (3) DOI: 10.1371/journal.pone.0017342

Posted in  Papers Ecology

Author  Scott Chamberlain

Fork me on GitHub