A permutation method for network assembly.

ABSTRACT: We present a method for assembling directed networks given a prescribed bi-degree (in- and out-degree) sequence. This method utilises permutations of initial adjacency matrix assemblies that conform to the prescribed in-degree sequence, yet violate the given out-degree sequence. It combines directed edge-swapping and constrained Monte-Carlo edge-mixing for improving approximations to the given out-degree sequence until it is exactly matched. Our method permits inclusion or exclusion of 'multi-edges', allowing assembly of weighted or binary networks. It further allows prescribing the overall percentage of such multiple connections-permitting exploration of a weighted synthetic network space unlike any other method currently available for comparison of real-world networks with controlled mul

SUBMITTER: Means SA 

PROVIDER: S-EPMC7584203 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature