arXiv (All)
open access
Theoretical Analysis of DomiRank Centrality: Automorphism, Entropy, and Graph Transformations
DomiRank is a node-importance evaluation algorithm for unweighted networks, defined through a dynamical-system model whose steady-state solution is governed by a competition-strength parameter, a dominance threshold, and a natural decay rate. This paper investigates the intrinsic relations between D
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
- Ranking viruses: Measures of positional importance within networks define core viruses for rational polyvalent vaccine development#641558
- On a Class of Decentralized Feedback Controllers for the Networked Bivirus SIS Model#1132000
- Capitalism as a Subsystem Network: Understanding Individual and Corporate Wealth Accumulation Through Interconnected Nodes#89556
- Fed-Equilibrium Framework for Topological Pareto Control in Robust and Fair Clinical Federated Learning#999922
- A Framework for Defining Network Complexity#254554
Record · ID 1154730
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