All scale-free networks are sparse

We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this finding by analytical reasoning and by a numerical method, proposed here, based on extreme value arguments, which can be applied to any given degree distribution. Our results reveal a fundamental reason why large scale-free networks without constraints on minimum and maximum degree must be sparse.Comment: 4 pages, 2 figure

Selective coherence transfers in homonuclear dipolar coupled spin systems

Mapping the physical dipolar Hamiltonian of a solid-state network of nuclear spins onto a system of nearest-neighbor couplings would be extremely useful for a variety of quantum information processing applications, as well as NMR structural studies. We demonstrate such a mapping for a system consisting of an ensemble of spin pairs, where the coupling between spins in the same pair is significantly stronger than the coupling between spins on different pairs. An amplitude modulated RF field is applied on resonance with the Larmor frequency of the spins, with the frequency of the modulation matched to the frequency of the dipolar coupling of interest. The spin pairs appear isolated from each other in the regime where the RF power (omega_1) is such that omega_weak << omega_1 << omega_strong. Coherence lifetimes within the two-spin system are increased from 19 us to 11.1 ms, a factor of 572.Comment: 4 pages. Paper re-submitted with minor changes to clarify that the scheme demonstrated is not an exact mapping onto a nearest neighbor system. However, this is the first demonstration of a controlled evolution in a subspace of an extended spin system, on a timescale that is much larger than the dipolar dephasing tim

SOPHIE velocimetry of Kepler transit candidates. XV. KOI-614b, KOI-206b, and KOI-680b: a massive warm Jupiter orbiting a G0 metallic dwarf and two highly inflated planets with a distant companion around evolved F-type stars

We report the validation and characterization of three new transiting exoplanets using SOPHIE radial velocities: KOI-614b, KOI-206b, and KOI-680b. KOI-614b has a mass of $2.86\pm0.35~{\rm M_{Jup}}$ and a radius of $1.13^{+0.26}_{-0.18}~{\rm R_{Jup}}$, and it orbits a G0, metallic ([Fe/H]=$0.35\pm0.15$) dwarf in 12.9 days. Its mass and radius are familiar and compatible with standard planetary evolution models, so it is one of the few known transiting planets in this mass range to have an orbital period over ten days. With an equilibrium temperature of $T_{eq}=1000 \pm 45$ K, this places KOI-614b at the transition between what is usually referred to as "hot" and "warm" Jupiters. KOI-206b has a mass of $2.82\pm 0.52~{\rm M_{Jup}}$ and a radius of $1.45\pm0.16~{\rm R_{Jup}}$, and it orbits a slightly evolved F7-type star in a 5.3-day orbit. It is a massive inflated hot Jupiter that is particularly challenging for planetary models because it requires unusually large amounts of additional dissipated energy in the planet. On the other hand, KOI-680b has a much lower mass of $0.84\pm0.15~{\rm M_{Jup}}$ and requires less extra-dissipation to explain its uncommonly large radius of $1.99\pm0.18~{\rm R_{Jup}}$. It is one of the biggest transiting planets characterized so far, and it orbits a subgiant F9-star well on its way to the red giant stage, with an orbital period of 8.6 days. With host stars of masses of $1.46\pm0.17~M_{\odot}$ and $1.54 \pm 0.09~M_{\odot}$, respectively, KOI-206b, and KOI-680b are interesting objects for theories of formation and survival of short-period planets around stars more massive than the Sun. For those two targets, we also find signs of a possible distant additional companion in the system

Statistical Properties of Contact Maps

A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the possible configurations of a polypeptide chain of N amino acids, represented by (N-1)-step self avoiding walks on a lattice, grows exponentially with N for all dimensions D>1. We carry out exact enumerations in D=2 on the square and triangular lattices for walks of up to 20 steps and investigate various statistical properties of contact maps corresponding to such walks. We also study the exact statistics of contact maps generated by walks on a ladder.Comment: Latex file, 15 pages, 12 eps figures. To appear on Phys. Rev.

Information Loss in Coarse Graining of Polymer Configurations via Contact Matrices

Contact matrices provide a coarse grained description of the configuration omega of a linear chain (polymer or random walk) on Z^n: C_{ij}(omega)=1 when the distance between the position of the i-th and j-th step are less than or equal to some distance "a" and C_{ij}(omega)=0 otherwise. We consider models in which polymers of length N have weights corresponding to simple and self-avoiding random walks, SRW and SAW, with "a" the minimal permissible distance. We prove that to leading order in N, the number of matrices equals the number of walks for SRW, but not for SAW. The coarse grained Shannon entropies for SRW agree with the fine grained ones for n <= 2, but differs for n >= 3.Comment: 18 pages, 2 figures, latex2e Main change: the introduction is rewritten in a less formal way with the main results explained in simple term

SOPHIE velocimetry of Kepler transit candidates XVII. The physical properties of giant exoplanets within 400 days of period

While giant extrasolar planets have been studied for more than two decades now, there are still some open questions such as their dominant formation and migration process, as well as their atmospheric evolution in different stellar environments. In this paper, we study a sample of giant transiting exoplanets detected by the Kepler telescope with orbital periods up to 400 days. We first defined a sample of 129 giant-planet candidates that we followed up with the SOPHIE spectrograph (OHP, France) in a 6-year radial velocity campaign. This allow us to unveil the nature of these candidates and to measure a false-positive rate of 54.6 +/- 6.5 % for giant-planet candidates orbiting within 400 days of period. Based on a sample of confirmed or likely planets, we then derive the occurrence rates of giant planets in different ranges of orbital periods. The overall occurrence rate of giant planets within 400 days is 4.6 +/- 0.6 %. We recover, for the first time in the Kepler data, the different populations of giant planets reported by radial velocity surveys. Comparing these rates with other yields, we find that the occurrence rate of giant planets is lower only for hot jupiters but not for the longer period planets. We also derive a first measurement on the occurrence rate of brown dwarfs in the brown-dwarf desert with a value of 0.29 +/- 0.17 %. Finally, we discuss the physical properties of the giant planets in our sample. We confirm that giant planets receiving a moderate irradiation are not inflated but we find that they are in average smaller than predicted by formation and evolution models. In this regime of low-irradiated giant planets, we find a possible correlation between their bulk density and the Iron abundance of the host star, which needs more detections to be confirmed.Comment: To appear in Astronomy and Astrophysic

Algorithm engineering for optimal alignment of protein structure distance matrices

Protein structural alignment is an important problem in computational biology. In this paper, we present first successes on provably optimal pairwise alignment of protein inter-residue distance matrices, using the popular Dali scoring function. We introduce the structural alignment problem formally, which enables us to express a variety of scoring functions used in previous work as special cases in a unified framework. Further, we propose the first mathematical model for computing optimal structural alignments based on dense inter-residue distance matrices. We therefore reformulate the problem as a special graph problem and give a tight integer linear programming model. We then present algorithm engineering techniques to handle the huge integer linear programs of real-life distance matrix alignment problems. Applying these techniques, we can compute provably optimal Dali alignments for the very first time

Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing

We construct a local realistic hidden-variable model that describes the states and dynamics of bulk-ensemble NMR information processing up to about 12 nuclear spins. The existence of such a model rules out violation of any Bell inequality, temporal or otherwise, in present high-temperature, liquid-state NMR experiments. The model does not provide an efficient description in that the number of hidden variables grows exponentially with the number of nuclear spins.Comment: REVTEX, 7 page

Efficient and exact sampling of simple graphs with given arbitrary degree sequence

Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap based (Markov-Chain Monte Carlo algorithms) or stub-matching based (the Configuration Model). Both types are ill-controlled, with typically unknown mixing times for link-swap methods and uncontrolled rejections for the Configuration Model. Here we propose an efficient, polynomial time algorithm that generates statistically independent graph samples with a given, arbitrary, degree sequence. The algorithm provides a weight associated with each sample, allowing the observable to be measured either uniformly over the graph ensemble, or, alternatively, with a desired distribution. Unlike other algorithms, this method always produces a sample, without back-tracking or rejections. Using a central limit theorem-based reasoning, we argue, that for large N, and for degree sequences admitting many realizations, the sample weights are expected to have a lognormal distribution. As examples, we apply our algorithm to generate networks with degree sequences drawn from power-law distributions and from binomial distributions.Comment: 8 pages, 3 figure

Diffusive spin transport

Information to be stored and transported requires physical carriers. The quantum bit of information (qubit) can for instance be realised as the spin 1/2 degree of freedom of a massive particle like an electron or as the spin 1 polarisation of a massless photon. In this lecture, I first use irreducible representations of the rotation group to characterise the spin dynamics in a least redundant manner. Specifically, I describe the decoherence dynamics of an arbitrary spin S coupled to a randomly fluctuating magnetic field in the Liouville space formalism. Secondly, I discuss the diffusive dynamics of the particle's position in space due to the presence of randomly placed impurities. Combining these two dynamics yields a coherent, unified picture of diffusive spin transport, as applicable to mesoscopic electronic devices or photons propagating in cold atomic clouds.Comment: Lecture notes, published in A. Buchleitner, C. Viviescas, and M. Tiersch (Eds.), "Entanglement and Decoherence. Foundations and Modern Trends", Lecture Notes in Physics 768, Springer, Berlin (2009