When should you sack a football manager? Results from a simple model applied to the English Premiership

What strategy should a football (soccer, in American parlance) club adopt when deciding whether to sack its manager? This paper introduces a simple model assuming that a club's objective is to maximize the number of league points that it scores per season. The club's strategy consists of three choices: the length of the honeymoon period during which it will not consider sacking a new manager, the level of the performance trapdoor below which the manager get the sack, and the weight that it will give to more recent games compared to earlier ones. Some data from the last six seasons of the English Premiership are used to calibrate the model. At this early stage of the research, the best strategy appears to have only a short honeymoon period of eight games (much less than the actual shortest period of 12 games), to set the trapdoor at 0.74 points per game, and to put 47% of the weight on the last five games. A club adopting this strategy would obtain on average 56.8 points per season, compared to a Premiership average of 51.8 points.     

On Bayes and unbiased estimators of loss

We consider estimation of loss for generalized Bayes or pseudo-Bayes estimators of a multivariate normal mean vector, θ. In 3 and higher dimensions, the MLEX is UMVUE and minimax but is inadmissible. It is dominated by the James-Stein estimator and by many others. Johnstone (1988, On inadmissibility of some unbiased estimates of loss,Statistical Decision Theory and Related Topics, IV (eds. S. S. Gupta and J. O. Berger), Vol. 1, 361–379, Springer, New York) considered the estimation of loss for the usual estimatorX and the James-Stein estimator. He found improvements over the Stein unbiased estimator of risk. In this paper, for a generalized Bayes point estimator of θ, we compare generalized Bayes estimators to unbiased estimators of loss. We find, somewhat surprisingly, that the unbiased estimator often dominates the corresponding generalized Bayes estimator of loss for priors which give minimax estimators in the original point estimation problem. In particular, we give a class of priors for which the generalized Bayes estimator of θ is admissible and minimax but for which the unbiased estimator of loss dominates the generalized Bayes estimator of loss. We also give a general inadmissibility result for a generalized Bayes estimator of loss. Research supported by NSF Grant DMS-97-04524.     

A representation of the Belavkin equation via Feynman path integrals

 The Belavkin equation, describing the continuous measurement of the position of a quantum particle, is studied. A rigorous representation of its solution by means of an infinite dimensional oscillatory integral (Feynman path integral) defined on the complex Cameron-Martin space is given. Received: 7 January 2002 / Revised version: 20 June 2002 / Published online: 19 December 2002 Mathematics Subject Classification (2000): 81, 81S40, 60H15 Key words or phrases: Belavkin equation – Continuous measurement – Quantum theory – Oscillatory integrals – Feynman path integrals     

Beryllium (boron) clustering quest in relativistic multifragmentation (BECQUEREL Project)

A physical program of irradiation of emulsions in beams of relativistic nuclei named the BECQUEREL Project is reviewed. It is destined to study in detail the processes of relativistic fragmentation of light radioactive and stable nuclei. The expected results would make it possible to answer some topical questions concerning the cluster structure of light nuclei. Owing to the best spatial resolution, the nuclear emulsions would enable one to obtain unique and evident results. The most important irradiations will be performed in the secondary beams of He, Be, B, C, and N radioactive nuclei formed on the basis of JINR Nuclotron beams of stable nuclei. We present results on the charged state topology of relativistic fragmentation of the ¹⁰B nucleus at low energy-momentum transfers as the first step of the research.     

Crystallographic report: A new polymorph for bis[bis(N,N‐dibenzyldithiocarbamato)cadmium(II)]

The title compound is a centrosymmetric dimer with each cadmium in a distorted CdS₅ square pyramidal geometry. The Cd–S bond distances range from 2.5626(11) to 2.8459(11) Å. Copyright © 2004 John Wiley & Sons, Ltd.     

Group Representation of Relativistic Quantum Crystal Optics

A group representation of radiation propagation in an anisotropic medium is developed. The system of wave equations for electromagnetic potentials, obtained from the Maxwell equations with account for the constitutive equations, has been factorized. It is shown that the linear differential operator of the factorized system is orthogonal in transparent crystals and unitary in gyrotropic ones and is represented through the momentum operator. On the basis of the commutation relations for the components of this operator, the eigenvalue problem has been solved and the expression for the change in the radiant energy in the crystal in the form of spherical waves has been obtained. The dependences of the ray and phase velocities and the polarization vectors of waves on the birefringence anisotropy and gyrotropy as well as on the angular momentum, displacement current, and bound charge determining them have been analyzed. It has been established that in the general case of gyrotropic crystals where the nonreciprocity phenomenon takes place and in magnetoelectrics Maxwell equations are represented in a form similar to the Dirac equations and the electromagnetic radiation is correctly described by means of bispinors and is quantized as fermions.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

Numerical approximation of generalized Newtonian fluids using Powell–Sabin–Heindl elements: I. theoretical estimates

In this paper we consider the numerical approximation of steady and unsteady generalized Newtonian fluid flows using divergence free finite elements generated by the Powell–Sabin–Heindl elements. We derive a priori and a posteriori finite element error estimates and prove convergence of the method of successive approximations for the steady flow case. A priori error estimates of unsteady flows are also considered. These results provide a theoretical foundation and supporting numerical studies are to be provided in Part II. Copyright © 2003 John Wiley & Sons, Ltd.