Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Random Walks, Conductance, and Resistance for the Connection Graph Laplacian

SIAM Journal on Matrix Analysis and Applications(2024)10.1137/23m1595400Source: DataRank Database

Random Walks, Conductance, and Resistance for the Connection Graph Laplacian is a research paper published in SIAM Journal on Matrix Analysis and Applications (2024). On theSindex it has a DataRank of 0. It has been cited 5 times.

N/A

0DataRank · unranked

Scored on demand from live citation data

5 citations

Free full text

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (9 grants)Impact (FWCI 4.08)OA: closedTopics (31)IDs (PubMed, OpenAlex)

FAIR Checklist

Context only (not used in score)

Findable (1/2)

Has DOI

Accessible (0/2)

Interoperable (0/2)

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (6)

Gal Mishne ORCID,Andreas Oslandsbotn,Sawyer Jack Robertson ORCID,Zhengchao Wan ORCID,Yusu Wang ORCID

Live enrichment

PubMed:19162232 OpenAlex:https://openalex.org/W4401688098

National Science Foundation

Grant: CCF 2217058

National Science Foundation

Grant: CCF 2112665

National Science Foundation

Grant: CCF 2310411

National Science Foundation

Grant: DMS 2012266

National Institutes of Health

Grant: 1RF1MH125317

National Science Foundation

Grant: 2112665

AI Institute for Learning-Enabled Optimization at Scale (TILOS)

National Science Foundation

Grant: 2217033

Collaborative Research: EnCORE: Institute for Emerging CORE Methods in Data Science

National Institutes of Health

Grant: 1RF1MH125317-01

Combined Topological and Machine Learning Tools for Neuroscience

National Science Foundation

Grant: 2012266

Collaborative Research: Computational Harmonic Analysis Approach to Active Learning

FWCI

4.08

Citation Percentile

0.9%

Citation Trend

2025

2026

closedLicense: arXiv Non-Exclusive Distribution

journalhttps://doi.org/10.1137/23m1595400

https://dx.doi.org/10.48550/arxiv.2308.09690

http://arxiv.org/abs/2308.09690

https://zbmath.org/7900919

https://doi.org/10.48550/arXiv.2308.09690

Fields of Study

Graph theory and applicationsGraphene research and applicationsComplex Network Analysis Techniques0101 mathematics01 natural sciences

Keywords

MathematicsRandom walkResistance distanceConnection (principal bundle)ConductanceLaplacian matrixGraphLaplace operatorCombinatoricsDiscrete mathematicsMathematical analysisStatisticsLine graphGeometryGraph powerFOS: Computer and information sciencesRandom walks on graphsBoundary value problems on graphs and networks for ordinary differential equationsconnection LaplacianDiscrete Mathematics (cs.DM)Graphs and linear algebra (matrices, eigenvalues, etc.)effective resistancerandom walksPoisson problemDirichlet problemComputer Science - Discrete Mathematics

Random Walks, Conductance, and Resistance for the Connection Graph Laplacian

FAIR Checklist

Authors (6)

Funding (9 grants)

Impact

Open Access

Topics