arXiv (All)
open access
Semi-Monotonicity for Spectral Centrality Measures
Score monotonicity and rank monotonicity are properties describing the behavior of a centrality measure when an arc is added to a network: the former requires that the score of the target of the arc should increase, the latter that its importance with respect to the remaining nodes should not deteri
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fair Top-k Katz Centrality via Graph Design#926767
- Centrality of shortest paths: Algorithms and complexity results#1062738
- On strict ranking by pairwise comparisons#139120
- On the extrema of the mean subtree order of graphs#1013436
- Feature selection with a lexicographic social ranking method ⋆#322584
Record · ID 1051088
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive