arXiv (All)
open access
Discounted Hitting Domination on Graphs with Submodularity, Complexity and Exact Algorithms
On a network with a fixed set of verified sources, discounted averaging induces an equilibrium support $h_i^S=\mathbb{E}_i[λ^{T_S}]$, the discounted probability that a random walk reaches $S$ before attenuation. We define the \emph{discounted hitting domination number} $δ_{λ,τ}(G)$ as the minimum nu
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
- Repeated averaging on expanders I: random $d$-regular graph#1061363
- Variance of random greedy independent sets in triangle-free graphs#1084744
- Perfect Matching in Product Graphs and in their Random Subgraphs#821390
- Efficient Rare-Event Simulation for Random Geometric Graphs via Importance Sampling#158691
- Awesome graph parameters#1063805
Record · ID 1106234
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