What's in the Numbers? Child Welfare Statistics and the Children (NI) Order

This article draws attention to the importance of routinely collected administrative data as an important source for understanding the characteristics of the Northern Ireland child welfare system as it has developed since the Children (Northern Ireland) Order 1995 became its legislative base. The article argues that the availability of such data is a strength of the Northern Ireland child welfare system and urges local politicians, lobbyists, researchers, policy-makers, operational managers, practitioners and service user groups to make more use of them. The main sources of administrative data are identified. Illustration of how these can be used to understand and to ask questions about the system is provided by considering some of the trends since the Children Order was enacted. The “protection” principle of the Children Order provides the focus for the illustration. The statistical trends considered relate to child protection referrals, investigations and registrations and to children and young people looked after under a range of court orders available to ensure their protection and well-being.

Estimating quantum chromatic numbers

We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP algorithm and describe an hierarchy of variants of the commuting quantum chromatic number which converge to it. We introduce the tracial rank of a graph, a parameter that gives a lower bound for the commuting quantum chromatic number and parallels the projective rank, and prove that it is multiplicative. We describe the tracial rank, the projective rank and the fractional chromatic numbers in a unified manner that clarifies their connection with the commuting quantum chromatic number, the quantum chromatic number and the classical chromatic number, respectively. Finally, we present a new SDP algorithm that yields a parameter larger than the Lovász number and is yet a lower bound for the tracial rank of the graph. We determine the precise value of the tracial rank of an odd cycle.