Robustness to link removal: data and computer codes

We implemented three interaction extinction sequences which intended to produce best-, worst- and intermediate case scenarios, as has been done in node extinction based scenarios. The first sequence always removed the interaction between the most connected species (hereafter, most connected first) and its most connected mutualistic partner. When more than one species had the same degree of connectivity, we randomly chose one of them. This process was repeated as many times as the number of interactions in the network until the last interaction (the least connected species and its least connected mutualistic partner) was removed. . Note that, contrary to NBRA, interaction removal did not follow a predefined sequence because the degree of species was updated after each interaction extinction. The second sequence always removed the interaction between the least connected species (hereafter, least connected first) and its least connected mutualistic partner, and then continued by removing the remaining interactions belonging to the least connected species and its least connected mutualistic partner at each iteration step. The third sequence, named random, removed interactions at random, to simulate an intermediate extinction scenario.我们设计了三种交互消除序列，旨在生成最优、最差及中等交互消除情形，该设计思路与基于节点消除的场景中所采用的方案一致。第一种序列始终移除连接度最高的物种（以下简称“优先高连接”及其连接度最高的互利共生伙伴之间的交互，当存在多个连接度相同的物种时，我们会随机选取其中一个。该过程将重复执行，重复次数等同于网络内交互的总数量，直至移除最后一个交互，即连接度最低的物种及其连接度最低的互利共生伙伴之间的交互。需要注意的是，与NBRA不同，交互移除并未遵循预定义序列，因为每次交互消除后，物种的连接度都会更新。第二种序列始终移除连接度最低的物种（以下简称“优先低连接”及其连接度最低的互利共生伙伴之间的交互，并在每一次迭代步骤中，持续移除剩余交互中隶属于该连接度最低的物种及其连接度最低的互利共生伙伴之间的交互。第三种序列被命名为“随机移除”，通过随机移除交互以模拟中等程度的交互消除场景。