Search arXivSearch

arXiv · 2604.05423

A graph based advection framework for climate-driven species distribution

Abstract

Climate change is reshaping species interactions and movement across fragmented landscapes. Despite this, most mathematical models assume random diffusion, overlooking the influence of directed movement. Here, we develop a graph based reaction-diffusion-advection framework explicitly incorporating directional movement induced by environmental gradients. Our results show while diffusion promotes overall population persistence across the network, advective movement induces asymmetric flows. It create population hotspots by directing individuals toward optimal niches, often associated with nodes of high in-degree. We demonstrate the interplay between advection strength and network topology in determining species persistence. Strong advection increase local extinction risk by accumulating populations toward favorable nodes. Additionally, loss of ecological corridors can disrupt directed flow within the network, thereby restricting species from favorable patches. We found that this disruption might not cause immediate extinction, rather forcing species to spread to the suboptimal patches. Our advection framework therefore efficiently captures how directional movement interacting with network topology governs species redistribution, hotspot formation, and predict extinction risk under environmental change.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pranali Roy Chowdhury, Soumyendu Raha. 2026-04-07. A graph based advection framework for climate-driven species distribution. https://arxiv.org/abs/2604.05423

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS