Category: Physics

Summary: Finding how much grading is needed for a heavy-edge gradon mode to emerge in a disordered graded spring network with random long-range clutter.

Graded elastic systems can support edge-focused vibrational modes known as gradons, while disordered spring networks separately show localization from randomness. This experiment asks how weak random long-range spring clutter shifts the onset of the lowest nontrivial heavy-edge gradon in a graded chain.

The model builds dense symmetric dynamical matrices for graded spring networks and increases system size through iterative deepening from 64 to 2048 sites. A bisection search on the grading strength tracks the point where the edge-localized vibrational mode cleanly appears despite the added clutter.

That makes the project a threshold map for the competition between deterministic grading and disorder-induced mixing. Rather than asking only whether localization exists somewhere, it estimates the critical gradient where a distinct heavy-edge mode becomes robust.

Method: Dense symmetric eigensolves with iterative deepening and bisection on the grading parameter in disordered graded spring dynamical matrices.

What is measured: Critical grading threshold, edge-localization onset of the lowest gradon, implied transition point by size, and bracket width.