Classical localization problem: a survey

TL;DR

This survey reviews classical localization problems in quantum network models, focusing on their analysis through percolation and combinatorial methods, and discusses results on trajectory finiteness and confinement lengths.

Contribution

It provides a comprehensive overview of classical localization problems in quantum networks, highlighting analytical techniques and recent results on trajectory behavior.

Findings

Trajectories are almost surely finite near critical parameters.

Polynomial bounds on confinement length in cylindrical geometries.

Localization versus delocalization analyzed via percolation methods.

Abstract

We survey classical localization problems arising from quantum network models in symmetry class C and their mappings to history-dependent random walks on directed lattices. We describe how localization versus delocalization of trajectories can be analysed using percolation methods and combinatorial enumeration of path intersection patterns. In particular, we review results establishing almost sure finiteness of trajectories for parameters near criticality and polynomial bounds on the confinement length in cylindrical geometries.