|
Algorithm 1: Robustness optimization method for communication in hypernetworks |
| Step |
Description |
| input |
Initial Hypernetwork , Total hyperedge number M, Proportion of newly added hyperedges q, Communication Robustness Optimization Method Method
|
| output |
Communication Efficiency of ,
|
| Initialization |
generating hypernetwork with M hyperedges |
| 1 |
do Calculate for each node in , its hyper-betweenness, distance entropy, characteristic subgraph centrality, and Fiedler-value-based centrality, and, for each of these centrality measures, identify the corresponding set of peripheral nodes , , , and . |
| 2 |
if is k-uniform hypernetwork: |
| 3 |
do add_node = k
|
| 4 |
else: do Calculate the average number m of nodes contained in the hyperedges of the hypernetwork; |
| 5 |
do add_node = m
|
| 6 |
switch(Method) { |
| 7 |
case HBC: |
| 8 |
do from the peripheral node set , select add_node nodes to form a new hyperedge, and repeat this edge-addition process until the prescribed edge-addition ratio is reached; |
| 9 |
break; |
| 10 |
case HDI: |
| 11 |
do from the peripheral node set , select add_node nodes to form a new hyperedge, and repeat this edge-addition process until the prescribed edge-addition ratio is reached; |
| 12 |
break; |
| 13 |
case HC_sub: |
| 14 |
do from the peripheral node set , select add_node nodes to form a new hyperedge, and repeat this edge-addition process until the prescribed edge-addition ratio is reached; |
| 15 |
break; |
| 16 |
case HC_Fiedler: |
| 17 |
do from the peripheral node set , select add_node nodes to form a new hyperedge, and repeat this edge-addition process until the prescribed edge-addition ratio is reached; |
| 18 |
break;} |
| 19 |
do Denote the hypernetwork with the newly added hyperedges as ; |
| 20 |
do Independently attack the hypernetworks and , and compute the communication efficiency CE of both hypernetworks. |
| 21 |
do Calculate
|