arXiv (All)
open access
Fair Top-k Katz Centrality via Graph Design
Centrality measures are widely used to rank nodes in networked data, but fairness interventions for graph centrality typically target global score mass or modify the centrality operator rather than controlling who appears in the displayed top-k ranking. We study this top-k setting for Katz centralit
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
- Centrality of shortest paths: Algorithms and complexity results#1062738
- On the extrema of the mean subtree order of graphs#1013436
- OSCAR: Order-aware Scoring and Calibration for AI Rankings#1050313
- Inferring cell-specific gene regulatory networks based on causal graph embedding.#298866
- Semi-Monotonicity for Spectral Centrality Measures#1051088
Record · ID 926767
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