Polytropic equation of state and primordial quantum fluctuations

We study the primordial Universe in a cosmological model where inflation is driven by a fluid with a polytropic equation of state $p = \alpha\rho + k\rho^{1 + 1/n}$. We calculate the dynamics of the scalar factor and build a Universe with constant density at the origin. We also find the equivalent scalar field that could create such equation of state and calculate the corresponding slow-roll parameters. We calculate the scalar perturbations, the scalar power spectrum and the spectral index.Comment: 16 pages, 4 figure

Generalized Chaplygin gas with α=0\alpha = 0 and the ΛCDM\Lambda CDM cosmological model

The generalized Chaplygin gas model is characterized by the equation of state $p = - \frac{A}{\rho^\alpha}$. It is generally stated that the case $\alpha = 0$ is equivalent to a model with cosmological constant and dust ($\Lambda CDM$). In this work we show that, if this is true for the background equations, this is not true for the perturbation equations. Hence, the mass spectrum predicted for both models may differ.Comment: Latex file, 4 pages, 2 figures in eps forma

No-horizon theorem for spacetimes with spacelike G1 isometry groups

We consider four-dimensional spacetimes $(M,{\mathbf g})$ which obey the Einstein equations ${\mathbf G}={\mathbf T}$, and admit a global spacelike $G_{1}={\mathbb R}$ isometry group. By means of dimensional reduction and local analyis on the reduced (2+1) spacetime, we obtain a sufficient condition on ${\mathbf T}$ which guarantees that $(M,{\mathbf g})$ cannot contain apparent horizons. Given any (3+1) spacetime with spacelike translational isometry, the no-horizon condition can be readily tested without the need for dimensional reduction. This provides thus a useful and encompassing apparent horizon test for $G_{1}$-symmetric spacetimes. We argue that this adds further evidence towards the validity of the hoop conjecture, and signals possible violations of strong cosmic censorship.Comment: 8 pages, LaTeX, uses IOP package; published in Class. Quantum Gra

Penetração Intra-Gástrica do Tubo Conector de Banda Gástrica Colocada por Via Laparoscópica

info:eu-repo/semantics/publishedVersio

Ranking and clustering of nodes in networks with smart teleportation

Random teleportation is a necessary evil for ranking and clustering directed networks based on random walks. Teleportation enables ergodic solutions, but the solutions must necessarily depend on the exact implementation and parametrization of the teleportation. For example, in the commonly used PageRank algorithm, the teleportation rate must trade off a heavily biased solution with a uniform solution. Here we show that teleportation to links rather than nodes enables a much smoother trade-off and effectively more robust results. We also show that, by not recording the teleportation steps of the random walker, we can further reduce the effect of teleportation with dramatic effects on clustering.Comment: 10 pages, 7 figure