View source: R/MK_dPCIIC_links.R
MK_dPCIIC_links | R Documentation |
This function calculates the dPC or dIIC index to estimate the link importance for conservation and restoration. It calculates the contribution of each individual link to maintain (mode: link removal) or improve (mode: link change) the overall connectivity under one or several distance thresholds.
MK_dPCIIC_links(
nodes,
attribute = NULL,
LA = NULL,
area_unit = "m2",
distance = list(type = "centroid", resistance = NULL),
metric = c("IIC", "PC"),
probability = NULL,
distance_thresholds = NULL,
threshold = NULL,
removal = TRUE,
change = NULL,
overall = FALSE,
parallel = NULL,
parallel_mode = NULL,
write = NULL,
intern = TRUE
)
nodes |
Object containing nodes (e.g., habitat patches or fragments) information. It can be of the following classes: |
attribute |
|
LA |
|
area_unit |
|
distance |
A |
metric |
A |
probability |
A |
distance_thresholds |
A |
threshold |
|
removal |
|
change |
(optional, default |
overall |
|
parallel |
(optional, default = |
parallel_mode |
(optional, default = |
write |
|
intern |
|
This function calculates the importance or contribution of each link to the overall landscape connectivity. The importance of a link is calculated as the variation in the value of the PC or IIC indices after certain changes affecting that link.
The link importance analysis can be performed under the following two different modes:
- If removal = TRUE
, the function removes one by one each of the links existing in the landscape network and calculates the impact of that link loss on landscape connectivity with the dPC or dIIC metrics. This mode is useful to identify the priority links to conserve: the ones with the highest contribution to the overall landscape connectivity (highest dPC or dIIC value).
- If change! = NULL
, the function replaces one by one each of the links existing in the landscape network and calculates the impact of that link change on landscape connectivity with the dPC or dIIC metrics. This mode is useful to identify the priority links to both conserve and restore. Positive dPC or dIIC values correspond to links losses or degradation, and the priority links to conserve correspond to those with the highest positive values. Negative dPC or dIIC values correspond to links improvements, and the priority links to restore correspond to those with the smallest negative values. This mode requires additional information, a distance matrix with the new distance values between all pairs of nodes. These new distance values will be in general different than the ones in the distance
parameter. A smaller distance corresponds to an increase in the quality or strength of the link between two patches in a given change or restoration scenario. A higher distance means that the connection between those two patches gets weaker corresponding to a degradation scenario. All types of combinations and different types of changes are possible for each of the links. For example, some connections may be improved, some others may decrease their quality or even disappear completely (i.e., new distance = NA), and some other links may suffer no change at all in the same analysis, depending on the particular new distance values for each link.
- If only one distance was used in the parameter distance_thresholds
then return an object of class data.frame
with the link removal or/and change values.
- If you add overall = TRUE
, then a list containing the data.frame
class object with the link removal or/and change values and a data.frame
with the overall connectivity values will be returned.
- If you use multiple distance thresholds (e.g, distance_thresholds = c(1000, 5000, 80000)
), the resulting data should be returned in the form of a list
, wherein each list
item contains the resulting objects for each distance threshold.
The link importance analysis can be much more time consuming than the node importance analysis (i.e., MK_dPCIIC). Sometimes the advance process does not reach 100 percent when operations are carried out very quickly.
- Saura, S. & Torné, J. 2012. Conefor 2.6 user manual (May 2012). Universidad Politécnica de Madrid. Available at www.conefor.org.
- Pascual-Hortal, L. & Saura, S. 2006. Comparison and development of new graph-based landscape connectivity indices: towards the priorization of habitat patches and corridors for conservation. Landscape Ecology 21 (7): 959-967.
- Saura, S. & Pascual-Hortal, L. 2007. A new habitat availability index to integrate connectivity in landscape conservation planning: comparison with existing indices and application to a case study. Landscape and Urban Planning 83 (2-3): 91-103.
- Hanski, I. and Ovaskainen, O. 2000. The metapopulation capacity of a fragmented landscape. Nature 404: 755–758.
## Not run:
library(Makurhini)
#Link removal option
data("habitat_nodes_spain", package = "Makurhini")
nrow(habitat_nodes_spain) # Number of patches
#For this example we only select first 50 nodes
nodes_test <- habitat_nodes_spain[1:50,]
#Distance
data("dist_original", package = "Makurhini")
#select the distances between the first 50 nodes
dist_test <- dist_original[1:50,1:50]
#We previusly estimate an Effective median dispersal distance
#of 980,966.64 m*cost. That is:
#mean resistance x 10 km of Euclidean median dispersal distance
delta <- MK_dPCIIC_links(nodes = nodes_test,
attribute = "attribute",
area_unit = "ha",
distance = dist_test,
removal = TRUE,
metric = "PC",
probability = 0.5,
distance_thresholds = 980966.64,
parallel = 4,
parallel_mode = 1,
intern = TRUE)
#Link change option
data("dist_restoration", package = "Makurhini")
#select the new distances between the first 50 nodes
dist_test_change <- dist_restoration[1:50,1:50]
delta <- MK_dPCIIC_links(nodes = nodes_test,
attribute = "attribute",
area_unit = "ha",
distance = dist_test,
change = distance_change
removal = TRUE,
metric = "PC",
probability = 0.5,
distance_thresholds = 980966.64,
parallel = 4,
parallel_mode = 1,
intern = TRUE)
delta
## End(Not run)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.