Dataset Information

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

ABSTRACT: We claim that networks are created according to the priority attachment mechanism. We introduce a simple model, which uses the priority attachment to generate both synthetic and close to empirical networks. Priority attachment is a mechanism, which generalizes previously proposed mechanisms, such as small world creation or preferential attachment, but we also observe its presence in a range of real-world networks. In this paper, we show that by using priority attachment we can generate networks of very diverse topologies, as well as re-create empirical ones. An additional advantage of the priority attachment mechanism is an easy interpretation of the latent processes of network formation. We substantiate our claims by performing numerical experiments on both synthetic and empirical networks. The two main contributions of the paper are: the development of the priority attachment mechanism, and the design of Priority Rank: a simple network generative model based on the priority attachment mechanism.

SUBMITTER: Morzy M

PROVIDER: S-EPMC6399255 | biostudies-literature | 2019 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

Morzy Mikołaj M Kajdanowicz Tomasz T Kazienko Przemysław P Miebs Grzegorz G Rusin Arkadiusz A

Scientific reports 20190304 1

We claim that networks are created according to the priority attachment mechanism. We introduce a simple model, which uses the priority attachment to generate both synthetic and close to empirical networks. Priority attachment is a mechanism, which generalizes previously proposed mechanisms, such as small world creation or preferential attachment, but we also observe its presence in a range of real-world networks. In this paper, we show that by using priority attachment we can generate networks ...[more]

PMID: 30833611

Similar Datasets

Project description:In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interacting nodes. The structure of the network may introduce dependencies among the nodes and it will in general be necessary to account for these dependencies in the statistical analysis. To this end we require some form of Null model of the network: generally rewired replicates of the network are generated which preserve only the degree (number of interactions) of each node. We show that this can fail to capture important features of network structure, and may result in unrealistic significance levels, when potentially confounding additional information is available.We present a new network resampling Null model which takes into account the degree sequence as well as available biological annotations. Using gene ontology information as an illustration we show how this information can be accounted for in the resampling approach, and the impact such information has on the assessment of statistical significance of correlations and motif-abundances in the Saccharomyces cerevisiae protein interaction network. An algorithm, GOcardShuffle, is introduced to allow for the efficient construction of an improved Null model for network data.We use the protein interaction network of S. cerevisiae; correlations between the evolutionary rates and expression levels of interacting proteins and their statistical significance were assessed for Null models which condition on different aspects of the available data. The novel GOcardShuffle approach results in a Null model for annotated network data which appears better to describe the properties of real biological networks.An improved statistical approach for the statistical analysis of biological network data, which conditions on the available biological information, leads to qualitatively different results compared to approaches which ignore such annotations. In particular we demonstrate the effects of the biological organization of the network can be sufficient to explain the observed similarity of interacting proteins.

Project description:The Purkinje network is an integral part of the excitation system in the human heart. Yet, to date, there is no in vivo imaging technique to accurately reconstruct its geometry and structure. Computational modeling of the Purkinje network is increasingly recognized as an alternative strategy to visualize, simulate, and understand the role of the Purkinje system. However, most computational models either have to be generated manually, or fail to smoothly cover the irregular surfaces inside the left and right ventricles. Here we present a new algorithm to reliably create robust Purkinje networks within the human heart. We made the source code of this algorithm freely available online. Using Monte Carlo simulations, we demonstrate that the fractal tree algorithm with our new projection method generates denser and more compact Purkinje networks than previous approaches on irregular surfaces. Under similar conditions, our algorithm generates a network with 1219±61 branches, three times more than a conventional algorithm with 419±107 branches. With a coverage of 11±3mm, the surface density of our new Purkije network is twice as dense as the conventional network with 22±7mm. To demonstrate the importance of a dense Purkinje network in cardiac electrophysiology, we simulated three cases of excitation: with our new Purkinje network, with left-sided Purkinje network, and without Purkinje network. Simulations with our new Purkinje network predicted more realistic activation sequences and activation times than simulations without. Six-lead electrocardiograms of the three case studies agreed with the clinical electrocardiograms under physiological conditions, under pathological conditions of right bundle branch block, and under pathological conditions of trifascicular block. Taken together, our results underpin the importance of the Purkinje network in realistic human heart simulations. Human heart modeling has the potential to support the design of personalized strategies for single- or bi-ventricular pacing, radiofrequency ablation, and cardiac defibrillation with the common goal to restore a normal heart rhythm.

Dataset Information

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

Publications

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets