Evidence map›Paper›PMID 30833611›Full record

ArticleScientific reports2019

Priority Attachment: a Comprehensive Mechanism for Generating Networks.

Mikołaj Morzy, Tomasz Kajdanowicz, Przemysław Kazienko, Grzegorz Miebs, Arkadiusz Rusin

Abstract read
In one paragraph

Article in Scientific reports, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Mikołaj MorzyCAMIL - Center for Artificial Intelligence and Machine Learning, Faculty of Computing, Poznań University of Technology, 60-965, Poznań, Poland. Mikolaj.Morzy@put.poznan.pl.ORCID 0000-0002-2905-9538
Tomasz KajdanowiczENGINE - The European Centre for Data Science, Faculty of Computer Science and Management, Wrocław University of Science and Technology, 50-370, Wrocław, Poland.
Przemysław KazienkoENGINE - The European Centre for Data Science, Faculty of Computer Science and Management, Wrocław University of Science and Technology, 50-370, Wrocław, Poland.
Grzegorz MiebsFaculty of Computing, Poznań University of Technology, 60-965, Poznań, Poland.ORCID 0000-0002-0628-6949
Arkadiusz RusinFaculty of Computing, Poznań University of Technology, 60-965, Poznań, Poland.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Identifiers

PMID30833611
PMCPMC6399255

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.