Cargando…
Computational ecology : graphs, networks and agent-based modeling /
"Graphs, networks and agent-based modeling are the most thriving and attracting sciences used in ecology and environmental sciences. As such, this book is the first comprehensive treatment of the subject in the areas of ecology and environmental sciences. From this integrated and self-contained...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Singapore ; Hackensack, N.J. ; London :
World Scientific,
©2012.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Preface
- Part I. Graphs : 1. Definitions and concepts
- 2. Fundamentals of topology
- 3. Matrix representations and computer storage of graphs
- 4. Trees and planar graphs
- 5. Algorithms of graphs
- 6. Directed graphs
- Part II. Networks: 7. Networks
- 8. Complex networks and network analysis
- 9. Ecological network analysis: research advances
- 10. Ecological network analysis: innovations
- Part III. Agent-based modeling: 11. Agent-based modeling
- 12. Cell automata modeling of pest percolation
- 13. ABM frame for biological community succession and assembly
- 14. Agent-based modeling of ecological problems.
- Preface; Contents; Part I. Graphs; Chapter 1. Definitions and Concepts; 1. Definitions and Concepts; 1.1. Finite graph and infinite graph; 1.2. Simple graph and planar graph; 1.3. Subgraph, proper subgraph, spanning subgraph, complementary graph; 1.4. Complete graph and m-order complete graph; 1.5. Edge sequence, edge train and path; 1.6. Connected graph, unconnected graph, and connected components; 1.7. Separable graph, inseparable graph, bipartite graph and disjoint graph; 1.8. Degree of vertex; 1.9. Directed graph and undirected graph; 1.10. Cutset and association set.
- 1.11. Tree and tree branch2. Isomorphism; 3. Biological Network Graphs; 3.1. Graphs for species interactions; 3.2. Ecosystem graph; 3.3. Eco-tourism network; 3.4. Pest spread network; 3.5. Metabolic regulatory networks; Chapter 2. Fundamentals of Topology; 1. Topological Space, Subspace; 1.1. Topological space; 1.2. Neighborhood, closed set, convergence of point sequence, and covering; 1.3. Subspace, compact space; 1.4. Product space; 2. Continuous Map, Homeomorphism; 3. Homotopy, Homotopy Type; 4. Connectedness; 4.1. Connectedness; 4.2. Path connectedness; 5. Simplicial Complex, Polyhedron.
- 5.1. Simplex5.2. Simplicial complex; 5.3. Polyhedron; 5.4. Abstract complex, graph; 5.5. Connectedness of complex; 5.6. Re-partition, simplicial approximation; 6. Fundamental Group; 6.1. Product path; 6.2. Fundamental group; 6.2.1. Fundamental group; 6.2.2. Fundamental group of polyhedron; Chapter 3. Matrix Representations and Computer Storage of Graphs; 1. Undirected Graph; 1.1. Incidence matrix; 1.2. Circuit matrix; 1.2.1. Paton's fundamental circuit finding algorithm; 1.2.2. Chan's circuit matrix algorithm; 1.3. Cutset matrix; 1.4. Calculation of fundamental matrix; 2. Directed Graph.
- 2.1. Incidence matrix2.2. Adjacency matrix; 2.3. Circuit matrix; 2.4. Cutset matrix; 2.5. Walk matrix and reachability matrix; 3. Computer Storage of Graph; 4. Ecological Applications; 4.1. Simple ecological relationship and incidence matrix; 4.2. Ecological relationship and adjacency matrix; 4.3. Matrix transformation algorithm; 4.4. Read ecological relationship matrix from database; Chapter 4. Trees and Planar Graphs; 1. Tree; 1.1. Tree; 1.2. Ingoing tree, outgoing tree; 1.3. Binary tree; 2. Planar Graph; 2.1. Planar graph, Nonplanar graph; 2.2. Dual graph; 3. Ecological Applications.
- 3.1. Optimum matching problem3.2. Path optimization problem; Chapter 5. Algorithms of Graphs; 1. Algorithms of Tree; 1.1. DFS algorithm; 1.2. Minty's algorithm; 1.3. Chan' algorithm; 2. Connectedness Testing Algorithm; 2.1. Connectedness of graph; 2.2. Block, cut vertex, bridge; 2.3. Vertex connectivity; 3. Planarity Testing Algorithm; 4. Construct Graph from Interrelationship Data; 5. Computer Generation of Graph; 6. Ecological Applications; Chapter 6. Directed Graphs; 1. Directed Graph; 2. Directed Euler Graph; 3. Directed Path; 4. Directed Tree; 5. Signal Flow Chart.