Evidence map›Paper›PMID 39076786›Full record

ArticleRoyal Society open science2024

Estimating network dimension when the spectrum struggles.

Peter Grindrod, Desmond J Higham, Henry-Louis de Kergorlay

Abstract read
In one paragraph

Article in Royal Society open science, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

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

1 citing paper in PubMed.

  1. Simplicity within biological complexity.Bioinformatics advances · 2025
    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

3 authors.

Peter GrindrodMathematical Institute, University of Oxford, OX2 6GG, UK.ORCID https://orcid.org/0000-0003-0924-7010
Desmond J HighamSchool of Mathematics, University of Edinburgh, Edinburgh, EH9 3FD, UK.ORCID https://orcid.org/0000-0002-6635-3461
Henry-Louis de KergorlaySchool of Mathematics, University of Edinburgh, Edinburgh, EH9 3FD, UK.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

What is the dimension of a network? Here, we view it as the smallest dimension of Euclidean space into which nodes can be embedded so that pairwise distances accurately reflect the connectivity structure. We show that a recently proposed and extremely efficient algorithm for data clouds, based on computing first- and second-nearest neighbour distances, can be used as the basis of an approach for estimating the dimension of a network with weighted edges. We also show how the algorithm can be extended to unweighted networks when combined with spectral embedding. We illustrate the advantages of this technique over the widely used approach of characterizing dimension by visually searching for a suitable gap in the spectrum of the Laplacian.

Indexed as

box countingeigenvectorgraphnearest neighbourspectral embedding

Identifiers

PMID39076786
PMCPMC11285770

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.