Measurement of Rydberg state lifetimes using cold trapped neutral atoms

In this paper, I review some recent high-precision Rydberg state lifetime measurements using a cold-trapped sample of neutral atoms held in a magneto-optical trap. The measurements were performed in rubidium for the S, P and D states varying the principal quantum number from n = 26 to 45 using the field ionization technique. The experimental results were compared with quantum mechanical calculations and good agreement was observed. This is an important demonstration of how cold atomic samples can be used to perform high-precision spectroscopy in the time domain.

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

Accessibility in complex networks

This Letter describes a method for the quantification of the diversity of non-linear dynamics in complex networks as a consequence of self-avoiding random walks. The methodology is analyzed in the context of theoretical models and illustrated with respect to the characterization of the accessibility in urban streets. (C) 2008 Elsevier B.V. All rights reserved.

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of Sao Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model. (C) 2008 Elsevier B.V. All rights reserved.

Hierarchical spatial organization of geographical networks

In this work, we propose a hierarchical extension of the polygonality index as the means to characterize geographical planar networks. By considering successive neighborhoods around each node, it is possible to obtain more complete information about the spatial order of the network at progressive spatial scales. The potential of the methodology is illustrated with respect to synthetic and real geographical networks.

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

A general treatment of geometric phases and dynamical invariants

Based only on the parallel-transport condition, we present a general method to compute Abelian or non-Abelian geometric phases acquired by the basis states of pure or mixed density operators, which also holds for nonadiabatic and noncyclic evolution. Two interesting features of the non-Abelian geometric phase obtained by our method stand out: i) it is a generalization of Wilczek and Zee`s non-Abelian holonomy, in that it describes nonadiabatic evolution where the basis states are parallelly transported between distinct degenerate subspaces, and ii) the non-Abelian character of our geometric phase relies on the transitional evolution of the basis states, even in the nondegenerate case. We apply our formalism to a two-level system evolving nonadiabatically under spontaneous decay to emphasize the non- Abelian nature of the geometric phase induced by the reservoir. We also show, through the generalized invariant theory, that our general approach encompasses previous results in the literature. Copyright (c) EPLA, 2008.

Fast long-range connections in transportation networks

Multidimensional scaling is applied in order to visualize an analogue of the small-world effect implied by edges having different displacement velocities in transportation networks. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highway network enhanced by some of the main US airlines routes. We also show that the travel time in these two networks is drastically changed by attacks targeting the edges with large displacement velocities. (C) 2011 Elsevier By. All rights reserved.

Protecting clean critical points by local disorder correlations

We show that a broad class of quantum critical points can be stable against locally correlated disorder even if they are unstable against uncorrelated disorder. Although this result seemingly contradicts the Harris criterion, it follows naturally from the absence of a random-mass term in the associated order parameter field theory. We illustrate the general concept with explicit calculations for quantum spin-chain models. Instead of the infinite-randomness physics induced by uncorrelated disorder, we find that weak locally correlated disorder is irrelevant. For larger disorder, we find a line of critical points with unusual properties such as an increase of the entanglement entropy with the disorder strength. We also propose experimental realizations in the context of quantum magnetism and cold-atom physics. Copyright (C) EPLA, 2011

An entropy-based approach to automatic image segmentation of satellite images

An entropy-based image segmentation approach is introduced and applied to color images obtained from Google Earth. Segmentation refers to the process of partitioning a digital image in order to locate different objects and regions of interest. The application to satellite images paves the way to automated monitoring of ecological catastrophes, urban growth, agricultural activity, maritime pollution, climate changing and general surveillance. Regions representing aquatic, rural and urban areas are identified and the accuracy of the proposed segmentation methodology is evaluated. The comparison with gray level images revealed that the color information is fundamental to obtain an accurate segmentation. (C) 2010 Elsevier B.V. All rights reserved.

Using metrics from complex networks to evaluate machine translation

Establishing metrics to assess machine translation (MT) systems automatically is now crucial owing to the widespread use of MT over the web. In this study we show that such evaluation can be done by modeling text as complex networks. Specifically, we extend our previous work by employing additional metrics of complex networks, whose results were used as input for machine learning methods and allowed MT texts of distinct qualities to be distinguished. Also shown is that the node-to-node mapping between source and target texts (English-Portuguese and Spanish-Portuguese pairs) can be improved by adding further hierarchical levels for the metrics out-degree, in-degree, hierarchical common degree, cluster coefficient, inter-ring degree, intra-ring degree and convergence ratio. The results presented here amount to a proof-of-principle that the possible capturing of a wider context with the hierarchical levels may be combined with machine learning methods to yield an approach for assessing the quality of MT systems. (C) 2010 Elsevier B.V. All rights reserved.

Axially symmetric soliton solutions in a Skyrme-Faddeev-type model with Gies`s extension

We construct static soliton solutions with non-zero Hopf topological charges to a theory which is the extended Skyrme-Faddeev model with a further quartic term in derivatives. We use an axially symmetric ansatz based on toroidal coordinates, and solve the resulting two coupled nonlinear partial differential equations in two variables by a successive over-relaxation method. We construct numerical solutions with the Hopf charge up to 4. The solutions present an interesting behavior under the changes of a special combination of the coupling constants of the quartic terms.

Identifying the borders of mathematical knowledge

Based on a divide and conquer approach, knowledge about nature has been organized into a set of interrelated facts, allowing a natural representation in terms of graphs: each `chunk` of knowledge corresponds to a node, while relationships between such chunks are expressed as edges. This organization becomes particularly clear in the case of mathematical theorems, with their intense cross-implications and relationships. We have derived a web of mathematical theorems from Wikipedia and, thanks to the powerful concept of entropy, identified its more central and frontier elements. Our results also suggest that the central nodes are the oldest theorems, while the frontier nodes are those recently added to the network. The network communities have also been identified, allowing further insights about the organization of this network, such as its highly modular structure.

On the efficiency of transportation systems in large cities

We report an analysis of the accessibility between different locations in big cities, which is illustrated with respect to London and Paris. The effects of the respective underground systems in facilitating more uniform access to diverse places are also quantified and investigated. It is shown that London and Paris have markedly different patterns of accessibility, as a consequence of the number of bridges and large parks of London, and that in both cases the respective underground systems imply in general, thought in distinct manners, an increase of accessibility. Copyright (C) EPLA, 2010

The double Caldeira-Leggett model: Derivation and solutions of the master equations, reservoir-induced interactions and decoherence

In this paper we analyze the double Caldeira-Leggett model: the path integral approach to two interacting dissipative harmonic oscillators. Assuming a general form of the interaction between the oscillators, we consider two different situations: (i) when each oscillator is coupled to its own reservoir, and (ii) when both oscillators are coupled to a common reservoir. After deriving and solving the master equation for each case, we analyze the decoherence process of particular entanglements in the positional space of both oscillators. To analyze the decoherence mechanism we have derived a general decay function, for the off-diagonal peaks of the density matrix, which applies both to common and separate reservoirs. We have also identified the expected interaction between the two dissipative oscillators induced by their common reservoir. Such a reservoir-induced interaction, which gives rise to interesting collective damping effects, such as the emergence of relaxation- and decoherence-free subspaces, is shown to be blurred by the high-temperature regime considered in this study. However, we find that different interactions between the dissipative oscillators, described by rotating or counter-rotating terms, result in different decay rates for the interference terms of the density matrix. (C) 2010 Elsevier B.V. All rights reserved.