After years in the making, “Computing Skills for Biologists — a Toolbox” is finally out!
The book covers many topics, including the Unix shell, programming in Python and R, LaTeX, and relational databases. It shows how these tools can be integrated to build powerful pipelines for the automated, rigorous and reproducible analysis of biological data.
In a new paper, Carlos, José, Jacopo, Kent and I tackle this simple problem: if we take a Lotka-Volterra system with random parameters, and let the dynamics elapse, how big will the final, persistent community be?
I am going to give a talk at the Italian Institute of Culture in Chicago on Feb 23, 2018 @ 7PM.
Rock-Paper-Scissors: what can children’s games teach us about biodiversity?
Italian Cultural Institute of Chicago
Friday, February 23, 2018 from 7:00 PM to 9:00 PM (CST)
500 N Michigan Ave., Suite 1450, Chicago, IL 60611
Biological networks show strong departures from simple models of random graphs. For example, they display broader degree distributions, high modularity, and strong preponderance of certain motifs.
One might be tempted to interpret these features as a signal of a selective force pruning the space of possible networks, resulting in empirical networks possessing certain features.
In one of my all-time favorite papers, Ricard Solé & Sergi Valverde proposed an alternative explanation: these features might be by-products of how the network was assembled. They dubbed this the “network-spandrel” hypothesis, referencing the famous paper by Gould & Lewontin.
In a new paper just published in Ecology Letters, Dan Maynard, Carlos Serván and I show a simple model of ecological assembly where by slightly tweaking the rules of assembly we can obtain dramatically different network structures—a paradigmatic case of network spandrels: