arXiv (All)
open access
Tree Capacity and Splitting Isometries for Subinvariant Kernels
Starting from a subinvariant positive definite kernel under a branching pullback, we attach to the resulting kernel sequence an electrical network on the word tree whose edge weights are the diagonal increments. The resulting effective resistance and capacity give explicit criteria and quantitative
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
- Reduced-Rank Mutual Coupling Representation and Experimental Estimation for Large RIS#153755
- Muon decay across scales: from LEFT to SMEFT#1000024
- An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance#1084366
- Reproducing Kernel Banach Space Models for Neural Networks with Application to Rademacher Complexity Analysis#624498
- The Row Normalization Puzzle in Muon#1144081
Record · ID 1105949
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