arXiv (OAI Expanded)
open access
Strong aggregation of the Markov chains associated with matching models based on the automorphism group of their compatibility graphs
We extend the analysis of strong aggregation to general compatibility graphs, focusing on item counts rather than positions, and exploring generalized greedy matching disciplines. We prove that under a condition of automorphism-based transition consistency, the associated Markov chain is strongly ag
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
- Probabilistic inferences from conjoined to iterated conditionals#765216
- Recipe-Matching, Not Equivalence#1115883
- Improving Natural-Language Combinatorial-Optimization Accuracy in Resource-Constrained Language Models via Formal Abstractions#997530
- Syntax-driven Incremental Program Verification of Matching Logic Properties#267716
- Entropy bounds and global couplings for union-closed families#985661
Record · ID 1122853
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