Algorithms to measure diversity and clustering in social networks through dot product graphs.

Social networks are often analyzed through a graph model of the network. The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar. In the model, a d-dimensional vector a v represents the extent to which individual v has each of a set of d attributes or opinions. Then two individuals u and v are assumed to be friends, that is, they are connected in the graph model, if and only if a u · a v  ≥ t, for some fixed, positive threshold t. The resulting graph is called a d-dot product graph.. We consider two measures for diversity and clustering in social networks by using a d-dot product graph model for the network. Diversity is measured through the size of the largest independent set of the graph, and clustering is measured through the size of the largest clique. We obtain a tight result for the diversity problem, namely that it is polynomial-time solvable for d = 2, but NP-complete for d ≥ 3. We show that the clustering problem is polynomial-time solvable for d = 2. To our knowledge, these results are also the first on the computational complexity of combinatorial optimization problems on dot product graphs. We also consider the situation when two individuals are connected if their preferences are not opposite. This leads to a variant of the standard dot product graph model by taking the threshold t to be zero. We prove in this case that the diversity problem is polynomial-time solvable for any fixed d

Reply to Farine and Aplin: Chimpanzees choose their association and interaction partners

Farine and Aplin (1) question the validity of our study reporting group-specific social dynamics in chimpanzees (2). As alternative to our approach, Farine and Aplin advance a “prenetwork permutation” methodology that tests against random assortment (3). We appreciate Farine and Aplin’s interest and applied their suggested approaches to our data. The new analyses revealed highly similar results to those of our initial approach. We further dispel Farine and Aplin’s critique by outlining its incompatibility to our study system, methodology, and analysis.First, when we apply the suggested prenetwork permutation to our proximity dataset, we again find significant population-level differences in association rates, while controlling for population size [as derived from Farine and Aplin’s script (4); original result, P < 0.0001; results including prenetwork permutation, P < 0.0001]. Furthermore, when we … ↵1To whom correspondence may be addressed. Email: ejcvanleeuwen{at}gmail.com

Conserving Approximations in Time-Dependent Density Functional Theory

In the present work we propose a theory for obtaining successively better approximations to the linear response functions of time-dependent density or current-density functional theory. The new technique is based on the variational approach to many-body perturbation theory (MBPT) as developed during the sixties and later expanded by us in the mid nineties. Due to this feature the resulting response functions obey a large number of conservation laws such as particle and momentum conservation and sum rules. The quality of the obtained results is governed by the physical processes built in through MBPT but also by the choice of variational expressions. We here present several conserving response functions of different sophistication to be used in the calculation of the optical response of solids and nano-scale systems.Comment: 11 pages, 4 figures, revised versio

On the Executability of Interactive Computation

The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTMs) has been proposed to characterise which behaviours are reactively executable. In this article we provide a comparison of the two models. We show, on the one hand, that the behaviour exhibited by ITMs is reactively executable, and, on the other hand, that the stream translations naturally associated with RTMs are interactively computable. We conclude from these results that the theory of reactive executability subsumes the theory of interactive computability. Inspired by the existing model of ITMs with advice, which provides a model of evolving computation, we also consider RTMs with advice and we establish that a facility of advice considerably upgrades the behavioural expressiveness of RTMs: every countable transition system can be simulated by some RTM with advice up to a fine notion of behavioural equivalence.Comment: 15 pages, 0 figure

Cepheid Parallaxes and the Hubble Constant

Revised Hipparcos parallaxes for classical Cepheids are analysed together with 10 HST-based parallaxes (Benedict et al.). In a reddening-free V,I relation we find that the coefficient of logP is the same within the uncertainties in our Galaxy as in the LMC, contrary to some previous suggestions. Cepheids in the inner region of NGC4258 with near solar metallicities (Macri et al.) confirm this result. We obtain a zero-point for the reddening-free relation and apply it to Cepheids in galaxies used by Sandage et al. to calibrate the absolute magnitudes of SNIa and to derive the Hubble constant. We revise their result from 62 to 70+/-5 km/s/Mpc. The Freedman et al. 2001 value is revised from 72 to 76+/-8 km/s/Mpc. These results are insensitive to Cepheid metallicity corrections. The Cepheids in the inner region of NGC4258 yield a modulus of 29.22+/-0.03(int) compared with a maser-based modulus of 29.29+/-0.15. Distance moduli for the LMC, uncorrected for any metallicity effects, are; 18.52+/-0.03 from a reddening-free relation in V,I; 18.47+/-0.03 from a period-luminosity relation at K; 18.45+/-0.04 from a period-luminosity-colour relation in J,K. Adopting a metallicity correction in V,I from Marci et al. leads to a true LMC modulus of 18.39+/-0.05.Comment: 9 pages, 1 figure, on-line material from [email protected]. Accepted for MNRA

First optical images of circumstellar dust surrounding the debris disk candidate HD 32297

Near-infrared imaging with the Hubble Space Telescope recently revealed a circumstellar dust disk around the A star HD 32297. Dust scattered light is detected as far as 400 AU radius and the linear morphology is consistent with a disk ~10 degrees away from an edge-on orientation. Here we present the first optical images that show the dust scattered light morphology from 560 to 1680 AU radius. The position angle of the putative disk midplane diverges by 31 degrees and the color of dust scattering is most likely blue. We associate HD 32297 with a wall of interstellar gas and the enigmatic region south of the Taurus molecular cloud. We propose that the extreme asymmetries and blue disk color originate from a collision with a clump of interstellar material as HD 32297 moves southward, and discuss evidence consistent with an age of 30 Myr or younger.Comment: 5 pages; Accepted for publication in ApJ Letter

A deconvolution map-making method for experiments with circular scanning strategies

Aims. To investigate the performance of a deconvolution map-making algorithm for an experiment with a circular scanning strategy, specifically in this case for the analysis of Planck data, and to quantify the effects of making maps using simplified approximations to the true beams. Methods. We present an implementation of a map-making algorithm which allows the combined treatment of temperature and polarisation data, and removal of instrumental effects, such as detector time constants and finite sampling intervals, as well as the deconvolution of arbitrarily complex beams from the maps. This method may be applied to any experiment with a circular scanning-strategy. Results. Low-resolution experiments were used to demonstrate the ability of this method to remove the effects of arbitrary beams from the maps and to demonstrate the effects on the maps of ignoring beam asymmetries. Additionally, results are presented of an analysis of a realistic full-scale simulated data-set for the Planck LFI 30 GHz channel. Conclusions. Our method successfully removes the effects of the beams from the maps, and although it is computationally expensive, the analysis of the Planck LFI data should be feasible with this approach.Comment: 14 pages, 14 figures, accepte