Structure and Response in the World Trade Network

We examine how the structure of the world trade network has been shaped by globalization and recessions over the last 40 years. We show that by treating the world trade network as an evolving system, theory predicts the trade network is more sensitive to evolutionary shocks and recovers more slowly from them now than it did 40 years ago, due to structural changes in the world trade network induced by globalization. We also show that recession-induced change to the world trade network leads to an \emph{increased} hierarchical structure of the global trade network for a few years after the recession.Comment: 4 pages, 4 figures, to appear in Phys. Rev. Let

Perform a gyro test of general relativity in a satellite and develop associated control technology

The progress accomplished in the Stanford Gyro Relativity program during the period November 1974 to October 1975 was described. Gyro developments were continued in the main laboratory dewar, concentrating on the operation of a three axis gyro readout and on improvements to the methods of canceling trapped fields in the rotor; these efforts culminated in the first successful observation of the London moment in the spinning gyro rotor in March 1975. Following a review meeting at that time, a new goal was formulated for the next 12 to 18 months, namely to operate a gyroscope in the new ultra-low field facility with readout resolution approaching 1 arc-second. The following other tasks were also completed: (1) sputtering work, (2) magnetometry, (3) construction and installation of the North Star simulator, (4) analysis of torques on the gyro, especially in inclined orbits, (5) equivalence principle accelerometer, and (6) analysis of a twin-satellite test of relativity

TELEPENSOUTH project: Measurement of the Earth gravitomagnetic field in a terrestrial laboratory

We will expose a preliminary study on the feasibility of an experiment leading to a direct measurement of the gravitomagnetic field generated by the rotational motion of the Earth. This measurement would be achieved by means of an appropriate coupling of a TELEscope and a Foucault PENdulum in a laboratory on ground, preferably at the SOUTH pole. An experiment of this kind was firstly proposed by Braginski, Polnarev and Thorne, 18 years ago, but it was never re-analyzed.Comment: 7 pages, LaTeX, Springer style files included. Contribution to the Proceedings of the Spanish Relativity Meeting-ERE-2001 (Madrid, September 2001). To appear in the book "Relativistic Astrophysics", Lecture Notes in Physics, Springer Verlag (2002), edited by L. Fernandez-Jambrina, L.M. Gonzalez-Romer

Module identification in bipartite and directed networks

Modularity is one of the most prominent properties of real-world complex networks. Here, we address the issue of module identification in two important classes of networks: bipartite networks and directed unipartite networks. Nodes in bipartite networks are divided into two non-overlapping sets, and the links must have one end node from each set. Directed unipartite networks only have one type of nodes, but links have an origin and an end. We show that directed unipartite networks can be conviniently represented as bipartite networks for module identification purposes. We report a novel approach especially suited for module detection in bipartite networks, and define a set of random networks that enable us to validate the new approach

Universal quantum computation using the discrete time quantum walk

A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time quantum walk. We show the discrete time quantum walk is able to implement the same universal gate set and thus both discrete and continuous time quantum walks are computational primitives. Additionally we give a set of components on which the discrete time quantum walk provides perfect state transfer.Comment: 9 pages, 10 figures. Updated after referee comments - Section V expanded and minor changes to other parts of the tex

Control of Multi-level Voltage States in a Hysteretic SQUID Ring-Resonator System

In this paper we study numerical solutions to the quasi-classical equations of motion for a SQUID ring-radio frequency (rf) resonator system in the regime where the ring is highly hysteretic. In line with experiment, we show that for a suitable choice of of ring circuit parameters the solutions to these equations of motion comprise sets of levels in the rf voltage-current dynamics of the coupled system. We further demonstrate that transitions, both up and down, between these levels can be controlled by voltage pulses applied to the system, thus opening up the possibility of high order (e.g. 10 state), multi-level logic and memory.Comment: 8 pages, 9 figure

Modularity measure of networks with overlapping communities

In this paper we introduce a non-fuzzy measure which has been designed to rank the partitions of a network's nodes into overlapping communities. Such a measure can be useful for both quantifying clusters detected by various methods and during finding the overlapping community-structure by optimization methods. The theoretical problem referring to the separation of overlapping modules is discussed, and an example for possible applications is given as well

Weighted network modules

The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with weights) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomised control graphs as well, we show that groups of 3 or more strong links prefer to cluster together in both original graphs.Comment: 19 pages, 7 figure

Creating and observing N-partite entanglement with atoms

The Mermin inequality provides a criterion for experimentally ruling out local-realistic descriptions of multiparticle systems. A violation of this inequality means that the particles must be entangled, but does not, in general, indicate whether N-partite entanglement is present. For this, a stricter bound is required. Here we discuss this bound and use it to propose two different schemes for demonstrating N-partite entanglement with atoms. The first scheme involves Bose-Einstein condensates trapped in an optical lattice and the second uses Rydberg atoms in microwave cavities.Comment: 12 pages, 4 figure