skip to main content


Search for: All records

Creators/Authors contains: "Dilkina, Bistra"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available March 1, 2025
  2. Given declines in biodiversity and ecosystem services, funding to support conservation must be invested effectively. However, funds for conservation often come with geographic restrictions on where they can be spent. We introduce a method to demonstrate to supporters of conservation how much more could be achieved if they were to allow greater flexibility over conservation funding. Specifically, we calculated conservation exchange rates that summarized gains in conservation outcomes available if funding originating in one location could be invested elsewhere. We illustrate our approach by considering nongovernmental organization funding and major federal programs within the US and a range of conservation objectives focused on biodiversity and ecosystem services. We show that large improvements in biodiversity and ecosystem service provision are available if geographic constraints on conservation funding were loosened. Finally, we demonstrate how conservation exchange rates can be used to spotlight promising opportunities for relaxing geographic funding restrictions.

     
    more » « less
    Free, publicly-accessible full text available December 1, 2024
  3. Wildlife trafficking is a global phenomenon posing many negative impacts on socio-environmental systems. Scientific exploration of wildlife trafficking trends and the impact of interventions is signifi-cantly encumbered by a suite of data reuse challenges. We describe a novel, open-access data directory on wildlife trafficking and a corresponding visualization tool that can be used to identify data for multiple purposes, such as exploring wildlife trafficking hotspots and convergence points with other crime, discovering key drivers or deterrents of wildlife trafficking, and uncovering structural patterns. Keyword searches, expert elicitation, and peer- reviewed publications were used to search for extant sources used by industry and non-profit organizations, as well as those leveraged to publish academic research articles. The open-access data direc-tory is designed to be a living document and searchable according to multiple measures. The directory can be instrumental in the data- driven analysis of unsustainable illegal wildlife trade, supply chain structure via link prediction models, the value of demand and supply reduction initiatives via multi-item knapsack problems, or trafficking behavior and transportation choices via network inter-diction problems. 
    more » « less
  4. We describe a novel database on wildlife trafficking that can be used for exploring supply chain coordination via game-theoretic collaboration models, geographic spread of wildlife products trafficked via multi-item knapsack problems, or illicit network interdiction via multi-armed bandit problems.

    A publicly available visualization of this dataset is available at: https://public.tableau.com/views/IWTDataDirectory-Gore/Sheet2?:language=en-US&:display_count=n&:origin=viz_share_link 
    more » « less
  5. null (Ed.)
  6. Models capturing parameterized random walks on graphs have been widely adopted in wildlife conservation to study species dispersal as a function of landscape features. Learning the probabilistic model empowers ecologists to understand animal responses to conservation strategies. By exploiting the connection between random walks and simple electric networks, we show that learning a random walk model can be reduced to finding the optimal graph Laplacian for a circuit. We propose a moment matching strategy that correlates the model’s hitting and commuting times with those observed empirically. To find the best Laplacian, we propose a neural network capable of back-propagating gradients through the matrix inverse in an end-to-end fashion. We developed a scalable method called CGInv which back-propagates the gradients through a neural network encoding each layer as a conjugate gradient iteration. To demonstrate its effectiveness, we apply our computational framework to applications in landscape connectivity modeling. Our experiments successfully demonstrate that our framework effectively and efficiently recovers the ground-truth configurations. 
    more » « less
  7. null (Ed.)