The paper proves Gromov-Hausdorff-Prokhorov-Skorokhod convergence of random walks on EIGS fractal graphs to diffusion and solves the open DHL percolation cluster problem.
On constructions of fractal spaces us- ing replacement and the combinatorial loewner property
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Extends Edge Iterated Graph Systems to reducible cases with new definitions and proofs that multiscale-freeness and multifractality have finite discrete spectra.
citing papers explorer
-
Iterated Graph Systems (I): random walks and diffusion limits
The paper proves Gromov-Hausdorff-Prokhorov-Skorokhod convergence of random walks on EIGS fractal graphs to diffusion and solves the open DHL percolation cluster problem.
-
Reducible Iterated Graph Systems: multiscale-freeness and multifractals
Extends Edge Iterated Graph Systems to reducible cases with new definitions and proofs that multiscale-freeness and multifractality have finite discrete spectra.