arXiv (All)
open access
Iterated Graph Systems (II): Bernoulli percolation and critical-exponent universality classes on hierarchical lattices
We study Bernoulli percolation and its universality classes on hierarchical lattices generated by edge iterated graph systems (EIGS). By examining eight critical exponents, we prove that no finite family of substitution-multiplicative dimensions completely determines universality, providing a rigoro
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
- Zeros of the independence polynomial on recursive sequences of graphs#1129703
- A polylogarithmic bound for list replicability#1355646
- Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models#1247466
- Infinite lexicographic products of positional objectives#1357020
- On finite groups whose coprime graph is a divisor graph#1143581
Record · ID 1234894
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