Random Carpet |
| Setup: |
| A random carpet is a modification on the Sierpinski Carpet. The key difference is that instead of leaving out the middle cell for each splitting of the previous cells, we now randomly leave out one cell. The graph G_n associated to a level n random carpet R_n, the random potential and random Hamiltonian are all defined as in the case of Sierpinski carpet. We also showcase some eigenfunctions for each value of P_{max}, as well as the loglog of eigenvalue counting function. |
| Results: Click here for results |