On a Network Model of Localization in a Random Magnetic Field

Physics – Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revtex, 6 pages, 3 figures appended as an uuencoded file

Scientific paper

10.1103/PhysRevB.52.16646

We consider a network model of snake states to study the localization problem of non-interacting fermions in a random magnetic field with zero average. After averaging over the randomness, the network of snake states is mapped onto $M$ coupled SU$(2N)$ spin chains in the $N \rightarrow 0$ limit. The number of snake states near the zero-field contour, $M$, is an even integer. In the large conductance limit $g = M {e^2 \over 2 \pi \hbar}$ ($M \gg 2$), it turns out that this system is equivalent to a particular representation of the ${\rm U}(2N) / {\rm U}(N) \times {\rm U}(N)$ sigma model ($N \rightarrow 0$) {\it without} a topological term. The beta function $\beta (1/M)$ of this sigma model in the $1/M$ expansion is consistent with the previously known $\beta (g)$ of the unitary ensemble. These results and further plausible arguments support the conclusion that all the states are localized.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On a Network Model of Localization in a Random Magnetic Field does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a Network Model of Localization in a Random Magnetic Field, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Network Model of Localization in a Random Magnetic Field will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-264375

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.