Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userClassical turning surfaces in solids: When do they occur, and what do they mean?
91
0
0.0
(
0
)
Authors
Aaron D. Kaplan
Ask ChatGPT about the research
No Arabic abstract
Classical turning surfaces of Kohn-Sham potentials, separating classically-allowed regions (CARs) from classically-forbidden regions (CFRs), provide a useful and rigorous approach to understanding many chemical properties of molecules. Here we calculate such surfaces for several paradigmatic solids. Our study of perfect crystals at equilibrium geometries suggests that CFRs are absent in metals, rare in covalent semiconductors, but common in ionic and molecular crystals. A CFR can appear at a monovacancy in a metal. In all materials, CFRs appear or grow as the internuclear distances are uniformly expanded. Calculations with several approximate density functionals and codes confirm these behaviors. A classical picture of conduction suggests that CARs should be connected in metals, and disconnected in wide-gap insulators. This classical picture is confirmed in the limits of extreme uniform compression of the internuclear distances, where all materials become metals without CFRs, and extreme expansion, where all materials become insulators with disconnected and widely-separated CARs around the atoms.
rate research
Read More
In the highly non-equilibrium conditions of laser induced spin dynamics magnetic moments can only be obtained from the spectral information, most commonly from the spectroscopy of semi-core states using the so-called x-ray magnetic circular dichroism (XMCD) sum rules. The validity of the these sum rules in tracking femtosecond spin dynamics remains, however, an open question. Employing the time dependent extension of density functional theory (TD-DFT) we compare spectroscopically obtained moments with those directly calculated from the TD-DFT densities. We find that for experimentally typical pump pulses these two very distinct routes to the spin moment are, for Co and Ni, in excellent agreement, validating the experimental approach. However, for short and intense pulses or high fluence pulses of long duration the XMCD sum rules fail, with errors exceeding 50%. This failure persists only during the pulse and occurs when the pump pulse excites charge out of the $d$-band and into $sp$-character bands, invalidating the semi-core to $d$-state transitions assumed by the XMCD sum rules.
We develop a general theory of random walks on hypergraphs which includes, as special cases, the different models that are found in literature. In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we compare them to hypergraph normalized Laplacians that are not necessarily related to random walks, but which are motivated by biological and chemical networks. We show that, although these two classes of Laplacians coincide in the case of graphs, they appear to have important conceptual differences in the general case. We study the spectral properties of both classes, as well as their applications to Coupled Hypergraph Maps: discrete-time dynamical systems that generalize the well-known Coupled Map Lattices on graphs. Our results also show why for some hypergraph Laplacian variants one expects more classical results from (weighted) graphs to generalize directly, while these results must fail for other hypergraph Laplacians.
We apply a simple, one-equation, galaxy formation model on top of the halos and subhalos of a high-resolution dark matter cosmological simulation to study how dwarf galaxies acquire their mass and, for better mass resolution, on over 10^5 halo merger trees, to predict when they form their stars. With the first approach, we show that the large majority of galaxies within group- and cluster-mass halos have acquired the bulk of their stellar mass through gas accretion and not via galaxy mergers. We deduce that most dwarf ellipticals are not built up by galaxy mergers. With the second approach, we constrain the star formation histories of dwarfs by requiring that star formation must occur within halos of a minimum circular velocity set by the evolution of the temperature of the IGM, starting before the epoch of reionization. We qualitatively reproduce the downsizing trend of greater ages at greater masses and predict an upsizing trend of greater ages as one proceeds to masses lower than m_crit. We find that the fraction of galaxies with very young stellar populations (more than half the mass formed within the last 1.5 Gyr) is a function of present-day mass in stars and cold gas, which peaks at 0.5% at m_crit=10^6-8 M_Sun, corresponding to blue compact dwarfs such as I Zw 18. We predict that the baryonic mass function of galaxies should not show a maximum at masses above 10^5.5, M_Sun, and we speculate on the nature of the lowest mass galaxies.
A neural network deployed in the wild may be asked to make predictions for inputs that were drawn from a different distribution than that of the training data. A plethora of work has demonstrated that it is easy to find or synthesize inputs for which a neural network is highly confident yet wrong. Generative models are widely viewed to be robust to such mistaken confidence as modeling the density of the input features can be used to detect novel, out-of-distribution inputs. In this paper we challenge this assumption. We find that the density learned by flow-based models, VAEs, and PixelCNNs cannot distinguish images of common objects such as dogs, trucks, and horses (i.e. CIFAR-10) from those of house numbers (i.e. SVHN), assigning a higher likelihood to the latter when the model is trained on the former. Moreover, we find evidence of this phenomenon when pairing several popular image data sets: FashionMNIST vs MNIST, CelebA vs SVHN, ImageNet vs CIFAR-10 / CIFAR-100 / SVHN. To investigate this curious behavior, we focus analysis on flow-based generative models in particular since they are trained and evaluated via the exact marginal likelihood. We find such behavior persists even when we restrict the flows to constant-volume transformations. These transformations admit some theoretical analysis, and we show that the difference in likelihoods can be explained by the location and variances of the data and the model curvature. Our results caution against using the density estimates from deep generative models to identify inputs similar to the training distribution until their behavior for out-of-distribution inputs is better understood.
We study the effect of adding to a directed chain of interconnected systems a directed feedback from the last element in the chain to the first. The problem is closely related to the fundamental question of how a change in network topology may influence the behavior of coupled systems. We begin the analysis by investigating a simple linear system. The matrix that specifies the system dynamics is the transpose of the network Laplacian matrix, which codes the connectivity of the network. Our analysis shows that for any nonzero complex eigenvalue $lambda$ of this matrix, the following inequality holds: $frac{|Im lambda |}{|Re lambda |} leq cotfrac{pi}{n}$. This bound is sharp, as it becomes an equality for an eigenvalue of a simple directed cycle with uniform interaction weights. The latter has the slowest decay of oscillations among all other network configurations with the same number of states. The result is generalized to directed rings and chains of identical nonlinear oscillators. For directed rings, a lower bound $sigma_c$ for the connection strengths that guarantees asymptotic synchronization is found to follow a similar pattern: $sigma_c=frac{1}{1-cosleft( 2pi /nright)} $. Numerical analysis revealed that, depending on the network size $n$, multiple dynamic regimes co-exist in the state space of the system. In addition to the fully synchronous state a rotating wave solution occurs. The effect is observed in networks exceeding a certain critical size. The emergence of a rotating wave highlights the importance of long chains and loops in networks of oscillators: the larger the size of chains and loops, the more sensitive the network dynamics becomes to removal or addition of a single connection.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
