Evidence map›Paper›PMID 30839791›Full record

ArticleApplied network science2018

Temporal walk based centrality metric for graph streams.

Ferenc Béres, Róbert Pálovics, Anna Oláh, András A Benczúr

Abstract read
In one paragraph

Article in Applied network science, 2018. 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

4 authors.

Ferenc Béres1Institute for Computer Science and Control, Hungarian Academy of Sciences, (MTA SZTAKI), Kende Street 13-17, Budapest, H-1111 Hungary.ORCID 0000-0001-6322-7139
Róbert Pálovics3Department of Computer Science, Stanford University, 353 Serra Mall, Stanford, 94305 CA USA.
Anna Oláh4Max Planck Institute for Informatics, 4 Stuhlsatzenhausweg, Saarbrücken, 66123 Germany.
András A Benczúr1Institute for Computer Science and Control, Hungarian Academy of Sciences, (MTA SZTAKI), Kende Street 13-17, Budapest, H-1111 Hungary.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A plethora of centrality measures or rankings have been proposed to account for the importance of the nodes of a network. In the seminal study of Boldi and Vigna (2014), the comparative evaluation of centrality measures was termed a difficult, arduous task. In networks with fast dynamics, such as the Twitter mention or retweet graphs, predicting emerging centrality is even more challenging. Our main result is a new, temporal walk based dynamic centrality measure that models temporal information propagation by considering the order of edge creation. Dynamic centrality measures have already started to emerge in publications; however, their empirical evaluation is limited. One of our main contributions is creating a quantitative experiment to assess temporal centrality metrics. In this experiment, our new measure outperforms graph snapshot based static and other recently proposed dynamic centrality measures in assigning the highest time-aware centrality to the actually relevant nodes of the network. Additional experiments over different data sets show that our method perform well for detecting concept drift in the process that generates the graphs.

Indexed as

CentralityDynamics of social networksSocial media analysis: blogs and friendship networksTemporal graphsTwitter measurement

Identifiers

PMID30839791
PMCPMC6214300

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.