Note that a smaller value of the conditional Mean-Hitting-Time (M p u i)) indicates a higher modularity level, namely a stronger connection between the adjacent node (u i) and other nodes in the adjacency set.
EvoArch encodes topological configuration in the adjacency matrices of the graphs that they represent and its reproduction operators operate on these adjacency matrices.
Each test involved randomizing of the experimental period (pre- vs. apis-period) in the adjacency matrices including data at individual plant level and recalculating the parameter values at each resample.
Pairs of properties are included in the form of their multiplication and ratio, as well as the property value divided by the atomic connectivity (number of neighbours in the adjacency matrix).
For each pair of connected molecular objects, there is a record in the adjacency.
In other words, each fully connected subgraph in the adjacency network (graph) is considered a community.
Robustness against noise in the adjacency matrix is evaluated through a very large number of scenarios.
After flagging the unpopular nodes in the adjacency matrix, they are ignored in calculating the estimation value.
However, the number of correct matched pairs depends on the value of K neighbors in the adjacency graph reconstruction.
The computational complexity is measured in terms of the number of changed elements in the adjacency matrix for the initial and the new topology.
Specifically, the weakest node is replaced with the new node, so N b entries in the adjacency matrix are zeroed, which corresponds to O ( E N b ).
