Pith. sign in

REVIEW

New results and open problems on subgraph centrality

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.06944 v2 pith:FPTZNSWF submitted 2021-11-12 math.CO cs.SI

Nikita Deniskin , Michele Benzi This is my paper · ORCID
classification math.COcs.SI
keywords centralitysubgraphgraphopenotherresultstheoryview
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Subgraph centrality, introduced by Estrada and Rodr\'iguez-Vel\'azquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, neuroscience, economics and many other fields. It is also worthy of study from a strictly mathematical point of view, in view of its connections to topics in spectral graph theory, number theory, analytic matrix functions, and combinatorics. In this paper we present some new results and a list of open questions about subgraph centrality and other node centrality measures based on graph walks.

Discussion (0). Continue with ORCID to comment.

Pith tools