Evidence map›Paper›PMID 35292696›Full record

ArticleScientific reports2022

A straightforward edge centrality concept derived from generalizing degree and strength.

Timo Bröhl, Klaus Lehnertz

Abstract read
In one paragraph

Article in Scientific reports, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing 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

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Coping with Examination Stress: An Emotion Analysis.Sensors (Basel, Switzerland) · 2024
    Article
  6. Article
  7. Review
  8. Article
  9. Article
  10. Article
  11. Article
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

2 authors.

Timo BröhlDepartment of Epileptology, University of Bonn Medical Centre, Venusberg Campus 1, 53127, Bonn, Germany.
Klaus LehnertzDepartment of Epileptology, University of Bonn Medical Centre, Venusberg Campus 1, 53127, Bonn, Germany. klaus.lehnertz@ukbonn.de.

Funding

Deutsche Forschungsgemeinschaft LE660/7-1
6 · The paper itself

Abstract

Vertex degree-the number of edges that are incident to a vertex-is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network's structure and dynamics. Unlike many other centrality concepts, for which joint metrics have been proposed for both vertices and edges, by now there is no concept for an edge centrality analogous to vertex degree. Here, we propose such a concept-termed nearest-neighbor edge centrality-and demonstrate its suitability for a non-redundant identification of central edges in paradigmatic network models as well as in real-world networks from various scientific domains.

Identifiers

PMID35292696
PMCPMC8922089

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.