Upload habitat patch polygons, set dispersal parameters, and compute PC, IIC and dPC importance metrics — without installing software or writing code. Built for ecologists, conservation planners, and environmental consultants.
PC (Probability of Connectivity) and IIC (Integral Index of Connectivity) are the standard graph-theoretic metrics for habitat connectivity analysis (Pascual-Hortal & Saura, 2006; Saura & Pascual-Hortal, 2007). ekokrati implements both, together with the dPC importance decomposition (intra-patch, flux, and connector components) that identifies which individual patches drive landscape connectivity.
Dispersal is modelled as an exponential distance kernel:
p = exp(−θd), where θ is fitted from a species-specific
dispersal distance and reference probability. All metrics are computed
on an exact graph — no approximations or heuristic path pruning.
Pascual-Hortal & Saura (2006). Comparison and development of new graph-based landscape connectivity indices. Landscape Ecology 21, 959–967. · Saura & Pascual-Hortal (2007). A new habitat availability index to integrate connectivity in landscape conservation planning. Landscape and Urban Planning 83, 91–103.
ekokrati is currently available as an invitation-only trial. Fill in the form below and we will be in touch — typically within a few working days. Academic and non-commercial use is free.