Search arXivSearch

arXiv · 1610.03653

Dynamic patterns of overexploitation in fisheries

Abstract

Understanding overfishing phenomenon and regulating fishing quotas is a major global challenge for the 21st Century both in terms of providing food for humankind and to preserve the oceans ecosystems. However, fishing is a complex economic activity, affected not just by overfishing but also by such factors as pollution, technology, financial factors and more. For this reason, it is often difficult to state with complete certainty that overfishing is the cause of the decline of a fishery. In this study, we developed a simple dynamic model based on the earlier, well-known Lotka-Volterra model or Prey-Predator model. To describe exploitation patterns, we assume that the fish stock and the fishing industry are coupled stock variables in the model and they dynamically affect each other, with the fishing yield proportional to both the fishing capital and the fish stock. The model is based on the concept that the fishing industry acts as the predator of the resource and that its growth and subsequent decline is directly related to the abundance of the fish stock. If the model can be fit historical data relative to specific fisheries, then it is a strong indication that the fishing industry is strongly affected by the magnitude of the fish stock and that, in particular, the decline of the yield and the decline of the stock are linked to each other. The model does not pretend to be a general description of the fishing industry in all its varied forms; however, the data reported here show that the model can indeed qualitatively describe several historical case of the collapse of fisheries. The model can also be used as a qualitative guide to understand the behavior of several other fisheries. These result indicate that one of the main factors causing the present crisis of the world's fisheries is the overexploitation of the fish stocks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilaria Perissi, Ugo Bardi, Toufic El Asmar, Alessandro Lavacchi. 2016-10-26. Dynamic patterns of overexploitation in fisheries. https://arxiv.org/abs/1610.03653

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE