709 research outputs found

    Competition of crystal field splitting and Hund's rule coupling in two-orbital magnetic metal-insulator transitions

    Full text link
    Competition of crystal field splitting and Hund's rule coupling in magnetic metal-insulator transitions of half-filled two-orbital Hubbard model is investigated by multi-orbital slave-boson mean field theory. We show that with the increase of Coulomb correlation, the system firstly transits from a paramagnetic (PM) metal to a {\it N\'{e}el} antiferromagnetic (AFM) Mott insulator, or a nonmagnetic orbital insulator, depending on the competition of crystal field splitting and the Hund's rule coupling. The different AFM Mott insulator, PM metal and orbital insulating phase are none, partially and fully orbital polarized, respectively. For a small JHJ_{H} and a finite crystal field, the orbital insulator is robust. Although the system is nonmagnetic, the phase boundary of the orbital insulator transition obviously shifts to the small UU regime after the magnetic correlations is taken into account. These results demonstrate that large crystal field splitting favors the formation of the orbital insulating phase, while large Hund's rule coupling tends to destroy it, driving the low-spin to high-spin transition.Comment: 4 pages, 4 figure

    Sparsity without the Complexity: Loss Localisation using Tree Measurements

    Full text link
    We study network loss tomography based on observing average loss rates over a set of paths forming a tree -- a severely underdetermined linear problem for the unknown link loss probabilities. We examine in detail the role of sparsity as a regularising principle, pointing out that the problem is technically distinct from others in the compressed sensing literature. While sparsity has been applied in the context of tomography, key questions regarding uniqueness and recovery remain unanswered. Our work exploits the tree structure of path measurements to derive sufficient conditions for sparse solutions to be unique and the condition that â„“1\ell_1 minimization recovers the true underlying solution. We present a fast single-pass linear algorithm for â„“1\ell_1 minimization and prove that a minimum â„“1\ell_1 solution is both unique and sparsest for tree topologies. By considering the placement of lossy links within trees, we show that sparse solutions remain unique more often than is commonly supposed. We prove similar results for a noisy version of the problem
    • …
    corecore