We have analyzed the unusual electronic structure of Sr2FeMoO6 combining ab initio and model Hamiltonian approaches. Our results indicate that there are strong enhancements of the intra-atomic exchange strength at the Mo site as well as the antiferromagnetic coupling strength between Fe and Mo sites. We discuss the possibility of a negative effective Coulomb correlation strength ( U(eff)) at the Mo site due to these renormalized interaction strengths.

No abstract

The electronic structure of transition metal oxides featuring correlated electrons can be rationalized within the Zaanen-Sawatzky-Allen framework. Following a brief description of the present paradigms of electronic behavior, we focus on the physics of rare earth nickelates as an archetype of complexity emerging within the charge transfer regime. The intriguing prospect of realizing the physics of high T c cuprates through heterostructuring resulted in a massive endeavor to epitaxially stabilize these materials in ultra-thin form.A plethora of new phenomena unfolded in such artificial structures due to the effect of epitaxial strain, quantum confinement, and interfacial charge transfer. Here we review the present status of artificial rareearth nickelates in an effort to uncover the interconnection between the electronic and magnetic behavior and the underlying crystal structure. We conclude by discussing future directions to disentangle the puzzle regarding the origin of the metal-insulator transition, the role of oxygen holes, and the true nature of the antiferromagnetic spin configuration in the ultra-thin limit. *

Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph metric may capture a graph's resilience to failure or its routing efficiency. Knowledge of appropriate metric values may influence the engineering of future topologies, repair strategies in the face of failure, and understanding of fundamental properties of existing networks. Unfortunately, there are typically no algorithms to generate graphs matching one or more proposed metrics and there is little understanding of the relationships among individual metrics or their applicability to different settings.We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d capture progressively more properties of G at the cost of more complex representation of the probability distribution. Using this series, we can quantitatively measure the distance between two graphs and construct random graphs that accurately reproduce virtually all metrics proposed in the literature. The nature of the dK-series implies that it will also capture any future metrics that may be proposed. Using our approach, we construct graphs for d = 0, 1, 2, 3 and demonstrate that these graphs reproduce, with increasing accuracy, important properties of measured and modeled Internet topologies. We find that the d = 2 case is sufficient for most practical purposes, while d = 3 essentially reconstructs the Internet AS-and router-level topologies exactly. We hope that a systematic method to analyze and synthesize topologies offers a significant improvement to the set of tools available to network topology and protocol researchers.

This paper presents ModelNet, a scalable Internet emulation environment that enables researchers to deploy unmodified software prototypes in a configurable Internet-like environment and subject them to faults and varying network conditions. Edge nodes running user-specified OS and application software are configured to route their packets through a set of ModelNet core nodes, which cooperate to subject the traffic to the bandwidth, congestion constraints, latency, and loss profile of a target network topology. This paper describes and evaluates the ModelNet architecture and its implementation, including novel techniques to balance emulation accuracy against scalability. The current ModelNet prototype is able to accurately subject thousands of instances of a distrbuted application to Internet-like conditions with gigabits of bisection bandwidth. Experiments with several large-scale distributed services demonstrate the generality and effectiveness of the infrastructure.