VIGRE Research Group
Structure and Dynamics of Ecological Networks
 |
Organizer: Caner Kazanci and Malcolm Adams.
Schedule: Tuesdays between 3:30-4:30pm at Boyd 326.
Content: This research project is somewhat related this previous VIGRE reserach group. However, attending to the previous VIGRE group is not a prerequisite. We will start from scratch.
Projects
Decomposition of general ecological networks - David, Louis, Qianqian and Zandra
Ecological networks are often represented as weighted digraphs, and can be fairly complicated. Decomposing a complicated ecosystem into sub networks for easier analysis is often tempting. However, essential ecosystem behavior may be lost by breaking connections. For simpler models, we can identify flow sub-networks (fluxes) without breaking connections. We will investigate the uniqueness and existence properties of this decomposition; and try to create an algorithm that can decompose any ecological network into its sub flow networks.Decomposition of cycling index - Alex, Stacy and Whitney
In relation to the decomposition problem above, we investigate if the cycling property of the full network can be represented by the cycling properties of the decomposed flow sub networks.Ecological network decomposition from an algebraic graph theory point of view. - Cindy, Matt and Michael
We study the same decomposition problem using algebraic graph theory of weighted digraphs.Decomposition of Indirect Effects - Emmanuel and Grant
In relation to the decomposition problem above, we investigate if the indirect effects within the full network can be represented by the indirect effects within the decomposed flow sub networks.Presentation schedule
- 9/29 - Bernard C. Patten - Ecological Utility Analysis.
- 10/6 - Cycling index group presentation - Ulanowicz (1983) paper on cycling index.
- 10/13 - Caner Kazanci - Network Particle Tracking.
- 10/20 - Group Presentations - Cycling bases.
- 10/27 - Group Presentations - Functional decomposition.
- 11/03 - Group Presentations - Functional decomposition using Network Particle Tracking.
- 11/10 - Group Presentations - Cycling Index and Indirect effects.
Documents & Materials
- Paper on cycling basis.
- Finn's original papers in cycling index: Paper 1, Paper 2.
- Network Particle Tracking (NPT) is based in Gillespie's stochastic algorithm explained in this paper.
- paper on computing cycling using a form of network decomposition.
- Here is the cycling paper, and the slideshow on network decomposition we covered (9/1).
- Here is the paper on throughflow analysis and network particle tracking. Please go over this before the next meeting.
- Last Tuesday (8/25) I went over the NEA presentation and gave out a handout on Throughflow analysis. I think the handout is easier to comprehend.
- I have added further information into the introductory lecture I have presented last Tuesday. Please take a look at this, especially if you have missed the first (Thursday) meeting.
- Here's the paper I would like you to read, which is going to be essential to what we do. The paper is by B. Fath and B. Patten on Review of Network Environ Analysis.
If you have any questions or comments about this website, please contact me. DHTML Menu By Milonic JavaScript