Dark Energy Constraints after Planck

The Planck collaboration has recently published maps of the Cosmic Microwave Background radiation with the highest precision. In the standard flat $\Lambda$CDM framework, Planck data show that the Hubble constant $H_0$ is in tension with that measured by the several direct probes on $H_0$. In this paper, we perform a global analysis from the current observational data in the general dark energy models and find that resolving this tension on $H_0$ requires the dark energy model with its equation of state (EoS) $w\neq-1$. Firstly, assuming the $w$ to be a constant, the Planck data favor $w < -1$ at about $2\,\sigma$ confidence level when combining with the supernovae "SNLS" compilation. And consequently the value derived on $H_0$, $H_0=71.3\pm2.0$ ${\rm km\,s^{-1}\,Mpc^{-1}}$ (68% C.L.), is consistent with that from direct $H_0$ probes. We then investigate the dark energy model with a time-evolving $w$, and obtain the 68% C.L. constraints $w_0=-0.81\pm0.19$ and $w_a=-1.9\pm1.1$ from the Planck data and the "SNLS" compilation. Current data still slightly favor the Quintom dark energy scenario with EoS across the cosmological constant boundary $w\equiv-1$.Comment: 8 pages, 4 figures, 2 table

Impacts on Cosmological Constraints from Degeneracies

In this paper, we study the degeneracies among several cosmological parameters in detail and discuss their impacts on the determinations of these parameters from the current and future observations. By combining the latest data sets, including type-Ia supernovae "Union2.1" compilation, WMAP seven-year data and the baryon acoustic oscillations from the SDSS Data Release Seven, we perform a global analysis to determine the cosmological parameters, such as the equation of state of dark energy w, the curvature of the universe \Omega_k, the total neutrino mass \sum{m_\nu}, and the parameters associated with the power spectrum of primordial fluctuations (n_s, \alpha_s and r). We pay particular attention on the degeneracies among these parameters and the influences on their constraints, by with or without including these degeneracies, respectively. We find that $w$ and \Omega_k or \sum{m_\nu} are strongly correlated. Including the degeneracies will significantly weaken the constraints. Furthermore, we study the capabilities of future observations and find these degeneracies can be broken very well. Consequently, the constraints of cosmological parameters can be improved dramatically.Comment: 9 figures, 6 tables, Accepted for publication in JCA

Cosmological solutions and observational constraints on 5-dimensional braneworld cosmology with gravitating Nambu-Goto matching conditions

We investigate the cosmological implications of the recently constructed 5-dimensional braneworld cosmology with gravitating Nambu-Goto matching conditions. Inserting both matter and radiation sectors, we first extract the analytical cosmological solutions. Additionally, we use observational data from Type Ia Supernovae (SNIa) and Baryon Acoustic Oscillations (BAO), along with requirements of Big Bang Nucleosynthesis (BBN), in order to impose constraints on the parameters of the model. We find that the scenario at hand is in very good agreement with observations, and thus a small departure from the standard Randall-Sundrum scenario is allowed.Comment: 22 pages, 5 figures, version published in Phys. Rev. D. arXiv admin note: text overlap with arXiv:1312.429

Information Cascades on Arbitrary Topologies

In this paper, we study information cascades on graphs. In this setting, each node in the graph represents a person. One after another, each person has to take a decision based on a private signal as well as the decisions made by earlier neighboring nodes. Such information cascades commonly occur in practice and have been studied in complete graphs where everyone can overhear the decisions of every other player. It is known that information cascades can be fragile and based on very little information, and that they have a high likelihood of being wrong. Generalizing the problem to arbitrary graphs reveals interesting insights. In particular, we show that in a random graph $G(n,q)$, for the right value of $q$, the number of nodes making a wrong decision is logarithmic in $n$. That is, in the limit for large $n$, the fraction of players that make a wrong decision tends to zero. This is intriguing because it contrasts to the two natural corner cases: empty graph (everyone decides independently based on his private signal) and complete graph (all decisions are heard by all nodes). In both of these cases a constant fraction of nodes make a wrong decision in expectation. Thus, our result shows that while both too little and too much information sharing causes nodes to take wrong decisions, for exactly the right amount of information sharing, asymptotically everyone can be right. We further show that this result in random graphs is asymptotically optimal for any topology, even if nodes follow a globally optimal algorithmic strategy. Based on the analysis of random graphs, we explore how topology impacts global performance and construct an optimal deterministic topology among layer graphs