Search arXiv⌕ Search

arXiv · cond-mat/0001317

Magnetic and Thermodynamic Properties of the Collective Paramagnet-Spin Liquid Pyrochlore Tb2Ti2O7

Abstract

In a recent letter [Phys. Rev. Lett. {\bf 82}, 1012 (1999)] it was found that the Tb$^{3+}$ magnetic moments in the Tb$_2$Ti$_2$O$_7$ pyrochlore lattice of corner-sharing tetrahedra remain in a {\it collective paramagnetic} state down to 70mK. In this paper we present results from d.c. magnetic susceptibility, specific heat data, inelastic neutron scattering measurements, and crystal field calculations that strongly suggest that (1) the Tb$^{3+}$ ions in Tb$_2$Ti$_2$O$_7$ possess a moment of approximatively 5$μ_{\rm B}$, and (2) the ground state $g-$tensor is extremely anisotropic below a temperature of $O(10^0)$K, with Ising-like Tb$^{3+}$ magnetic moments confined to point along a local cubic $<111>$ diagonal (e.g. towards the middle of the tetrahedron). Such a very large easy-axis Ising like anisotropy along a $<111>$ direction dramatically reduces the frustration otherwise present in a Heisenberg pyrochlore antiferromagnet. The results presented herein underpin the conceptual difficulty in understanding the microscopic mechanism(s) responsible for Tb$_2$Ti$_2$O$_7$ failing to develop long-range order at a temperature of the order of the paramagnetic Curie-Weiss temperature $θ_{\rm CW} \approx -10^1$K. We suggest that dipolar interactions and extra perturbative exchange coupling(s)beyond nearest-neighbors may be responsible for the lack of ordering of Tb$_2$Ti$_2$O$_7$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. J. P. Gingras, B. C. den Hertog, M. Faucher, J. S. Gardner, L. J. Chang, B. D. Gaulin, N. P. Raju, J. E. Greedan. 2000-01-21. Magnetic and Thermodynamic Properties of the Collective Paramagnet-Spin Liquid Pyrochlore Tb2Ti2O7. https://doi.org/10.1103/physrevb.62.6496

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗

Neural Networks with Exciton-Polariton Waveguides

We propose and numerically study a scheme for neural networks using exciton-polariton waveguide meshes. These enable arbitrary programmable interlayer couplings suited to a restricted Boltzmann machine architecture where polariton phases act as stochastic network variables. We show that such a network can be trained using unsupervised Hebbian and anti-Hebbian updates. This allows the implementation of an associative memory, where the network recovers learned patterns from imperfect inputs.

cond-mat.dis-nn↗

Finite-width shift of the edge of chaos in deep neural networks

Deep neural networks train best when they are initialised at the edge of chaos, the critical line in the plane of weight and bias variances on which the distance between two inputs neither grows nor shrinks with depth. The line is known for infinitely wide networks; at finite width it moves, and how it moves has been disputed. We treat the logarithm of the distance between two inputs through a network of width $N$ as a random walk and compute its drift and variance to order $1/N$. The edge of chaos moves to a larger weight variance, by $Δσ_w^2=-a_1/(N\,\partial_{σ_w^2}\lnχ_1)$, about $8/N$ for $\tanh$ networks at a bias variance of $0.05$, confirmed by simulations of the exact finite-width recursion. The shift describes a typical network; the average over many networks is dominated by rare networks in which the distance grows, and its critical point moves the other way, which explains why calculations and simulations have disagreed. Backpropagation follows the same random walk, so the shift applies to gradients unchanged. Along the edge of chaos, the information about the similarity of two inputs is constant until the compression over the depth exceeds about one nat, which fixes where to sit on the line. The results give an initialisation rule, Crinit, that places a network on its finite-width edge of chaos without a search. On MNIST and Fashion-MNIST at width $64$ it is more accurate than the standard rules at their usual settings, by a small margin in shallow networks and a large one in deep networks, where most standard rules fail; it trains in fewer steps, and it matches or beats the standard rules with a tuned gain.

cond-mat.dis-nn↗