Post-ISCO Ringdown Amplitudes in Extreme Mass Ratio Inspiral

An extreme mass ratio inspiral consists of two parts: adiabatic inspiral and plunge. The plunge trajectory from the innermost stable circular orbit (ISCO) is special (somewhat independent of initial conditions). We write an expression for its solution in closed-form and for the emitted waveform. In particular we extract an expression for the associated black-hole ringdown amplitudes, and evaluate them numerically.Comment: 21 pages, 5 figures. v4: added section with numerical evaluation of the ringdown amplitude

Templates for stellar mass black holes falling into supermassive black holes

The spin modulated gravitational wave signals, which we shall call smirches, emitted by stellar mass black holes tumbling and inspiralling into massive black holes have extremely complicated shapes. Tracking these signals with the aid of pattern matching techniques, such as Wiener filtering, is likely to be computationally an impossible exercise. In this article we propose using a mixture of optimal and non-optimal methods to create a search hierarchy to ease the computational burden. Furthermore, by employing the method of principal components (also known as singular value decomposition) we explicitly demonstrate that the effective dimensionality of the search parameter space of smirches is likely to be just three or four, much smaller than what has hitherto been thought to be about nine or ten. This result, based on a limited study of the parameter space, should be confirmed by a more exhaustive study over the parameter space as well as Monte-Carlo simulations to test the predictions made in this paper.Comment: 12 pages, 4 Tables, 4th LISA symposium, submitted to CQ

Modulus Computational Entropy

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables $Z_{1},\ldots,Z_{\ell}$ correlated with $X$, obtains some further information $Z_{\ell+1}$ about $X$. Analogously to the information-theoretic case, one might expect that also for the \emph{computational} variants of entropy the loss depends only on the actual leakage, i.e. on $Z_{\ell+1}$. Surprisingly, Krenn et al.\ have shown recently that for the most commonly used definitions of computational entropy this holds only if the computational quality of the entropy deteriorates exponentially in $|(Z_{1},\ldots,Z_{\ell})|$. This means that the current standard definitions of computational entropy do not allow to fully capture leakage that occurred "in the past", which severely limits the applicability of this notion. As a remedy for this problem we propose a slightly stronger definition of the computational entropy, which we call the \emph{modulus computational entropy}, and use it as a technical tool that allows us to prove a desired chain rule that depends only on the actual leakage and not on its history. Moreover, we show that the modulus computational entropy unifies other,sometimes seemingly unrelated, notions already studied in the literature in the context of information leakage and chain rules. Our results indicate that the modulus entropy is, up to now, the weakest restriction that guarantees that the chain rule for the computational entropy works. As an example of application we demonstrate a few interesting cases where our restricted definition is fulfilled and the chain rule holds.Comment: Accepted at ICTS 201

Determinants of migrant career success: A study of recent skilled migrants in Australia

Australia has been aggressively pursuing skilled migrants to sustain its population and foster economic growth. However, many skilled migrants experience a downward career move upon migration to Australia. Based on a survey of recent skilled migrants, this study investigates how individual (age, years of settlement, qualifications), national/societal (citizenship and settlement), and organization‐level (climate of inclusion) factors influence their career success. Overall, we found that: (1) age at migration matters more than length of settlement in predicting skilled migrant career success; (2) citizenship uptake and living in a neighbourhood with a greater number of families from the same country of origin facilitate post‐migration career success; and (3) perceptions of one\u27s social/informal networks in the workplace – a dimension of perceived organizational climate of inclusion – also have a positive impact on migrant career outcomes

Repercussions of the COVID-19 pandemic on child and adolescent mental health: A matter of concern—A joint statement from EAP and ECPCP

COVID-19 pandemic and the consequent rigid social distancing measures implemented, including school closures, have heavily impacted children's and adolescents' psychosocial wellbeing, and their mental health problems significantly increased. However, child and adolescent mental health were already a serious problem before the Pandemic all over the world. COVID-19 is not just a pandemic, it is a syndemic and mentally or socially disadvantaged children and adolescents are the most affected. Non-Communicable Diseases (NCDs) and previous mental health issues are an additional worsening condition. Even though many countries have responded with decisive efforts to scale-up mental health services, a more integrated and community-based approach to mental health is required. EAP and ECPCP makes recommendations to all the stakeholders to take action to promote, protect and care for the mental health of a generation

On Conformal Deformations

For a conformal theory it is natural to seek the conformal moduli space, M_c to which it belongs, generated by the exactly marginal deformations. By now we should have the tools to determine M_c in the presence of enough supersymmetry. Here it is shown that its dimension is determined in terms of a certain index. Moreover, the D-term of the global group is an obstruction for deformation, in presence of a certain amount of preserved supersymmetry. As an example we find that the deformations of the membrane (3d) field theory, under certain conditions, are in 35/SL(4,C). Other properties including the local geometry of M_c are discussed.Comment: 10 page

Matched Asymptotic Expansion for Caged Black Holes - Regularization of the Post-Newtonian Order

The "dialogue of multipoles" matched asymptotic expansion for small black holes in the presence of compact dimensions is extended to the Post-Newtonian order for arbitrary dimensions. Divergences are identified and are regularized through the matching constants, a method valid to all orders and known as Hadamard's partie finie. It is closely related to "subtraction of self-interaction" and shows similarities with the regularization of quantum field theories. The black hole's mass and tension (and the "black hole Archimedes effect") are obtained explicitly at this order, and a Newtonian derivation for the leading term in the tension is demonstrated. Implications for the phase diagram are analyzed, finding agreement with numerical results and extrapolation shows hints for Sorkin's critical dimension - a dimension where the transition turns second order.Comment: 28 pages, 5 figures. v2:published versio

Hypercontractivity, Sum-of-Squares Proofs, and their Applications

We study the computational complexity of approximating the 2->q norm of linear operators (defined as ||A||_{2->q} = sup_v ||Av||_q/||v||_2), as well as connections between this question and issues arising in quantum information theory and the study of Khot's Unique Games Conjecture (UGC). We show the following: 1. For any constant even integer q>=4, a graph $G$ is a "small-set expander" if and only if the projector into the span of the top eigenvectors of G's adjacency matrix has bounded 2->q norm. As a corollary, a good approximation to the 2->q norm will refute the Small-Set Expansion Conjecture--a close variant of the UGC. We also show that such a good approximation can be obtained in exp(n^(2/q)) time, thus obtaining a different proof of the known subexponential algorithm for Small Set Expansion. 2. Constant rounds of the "Sum of Squares" semidefinite programing hierarchy certify an upper bound on the 2->4 norm of the projector to low-degree polynomials over the Boolean cube, as well certify the unsatisfiability of the "noisy cube" and "short code" based instances of Unique Games considered by prior works. This improves on the previous upper bound of exp(poly log n) rounds (for the "short code"), as well as separates the "Sum of Squares"/"Lasserre" hierarchy from weaker hierarchies that were known to require omega(1) rounds. 3. We show reductions between computing the 2->4 norm and computing the injective tensor norm of a tensor, a problem with connections to quantum information theory. Three corollaries are: (i) the 2->4 norm is NP-hard to approximate to precision inverse-polynomial in the dimension, (ii) the 2->4 norm does not have a good approximation (in the sense above) unless 3-SAT can be solved in time exp(sqrt(n) polylog(n)), and (iii) known algorithms for the quantum separability problem imply a non-trivial additive approximation for the 2->4 norm.Comment: v1: 52 pages. v2: 53 pages, fixed small bugs in proofs of section 6 (on UG integrality gaps) and section 7 (on 2->4 norm of random matrices). Added comments about real-vs-complex random matrices and about the k-extendable vs k-extendable & PPT hierarchies. v3: fixed mistakes in random matrix section. The result now holds only for matrices with random entries instead of random column

Leukocytes Breach Endothelial Barriers by Insertion of Nuclear Lobes and Disassembly of Endothelial Actin Filaments

Israel Science Foundation (grant 87/12) Flight Attendant Medical Research Institute Foundation (FAMRI) (grant FAMRI032001_CoE), USA Minerva Foundation, Germany Wellcome Trust (grant 098291/Z/12/Z to S.N.