Controlling the uncontrolled: Are there incidental experimenter effects on physiologic responding?

The degree to which experimenters shape participant behavior has long been of interest in experimental social science research. Here, we extend this question to the domain of peripheral psychophysiology, where experimenters often have direct, physical contact with participants, yet researchers do not consistently test for their influence. We describe analytic tools for examining experimenter effects in peripheral physiology. Using these tools, we investigate nine data sets totaling 1,341 participants and 160 experimenters across different roles (e.g., lead research assistants, evaluators, confederates) to demonstrate how researchers can test for experimenter effects in participant autonomic nervous system activity during baseline recordings and reactivity to study tasks. Our results showed (a) little to no significant variance in participants' physiological reactivity due to their experimenters, and (b) little to no evidence that three characteristics of experimenters that are well known to shape interpersonal interactions-status (using five studies with 682 total participants), gender (using two studies with 359 total participants), and race (in two studies with 554 total participants)-influenced participants' physiology. We highlight several reasons that experimenter effects in physiological data are still cause for concern, including the fact that experimenters in these studies were already restricted on a number of characteristics (e.g., age, education). We present recommendations for examining and reducing experimenter effects in physiological data and discuss implications for replication

The statistical mechanics of networks

We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the same role in the study of networks as is played by the Boltzmann distribution in classical statistical mechanics; they offer the best prediction of network properties subject to the constraints imposed by a given set of observations. We give exact solutions of models within this class that incorporate arbitrary degree distributions and arbitrary but independent edge probabilities. We also discuss some more complex examples with correlated edges that can be solved approximately or exactly by adapting various familiar methods, including mean-field theory, perturbation theory, and saddle-point expansions.Comment: 15 pages, 4 figure

Solution of the 2-star model of a network

The p-star model or exponential random graph is among the oldest and best-known of network models. Here we give an analytic solution for the particular case of the 2-star model, which is one of the most fundamental of exponential random graphs. We derive expressions for a number of quantities of interest in the model and show that the degenerate region of the parameter space observed in computer simulations is a spontaneously symmetry broken phase separated from the normal phase of the model by a conventional continuous phase transition.Comment: 5 pages, 3 figure

Sharing Social Network Data: Differentially Private Estimation of Exponential-Family Random Graph Models

Motivated by a real-life problem of sharing social network data that contain sensitive personal information, we propose a novel approach to release and analyze synthetic graphs in order to protect privacy of individual relationships captured by the social network while maintaining the validity of statistical results. A case study using a version of the Enron e-mail corpus dataset demonstrates the application and usefulness of the proposed techniques in solving the challenging problem of maintaining privacy \emph{and} supporting open access to network data to ensure reproducibility of existing studies and discovering new scientific insights that can be obtained by analyzing such data. We use a simple yet effective randomized response mechanism to generate synthetic networks under $\epsilon$-edge differential privacy, and then use likelihood based inference for missing data and Markov chain Monte Carlo techniques to fit exponential-family random graph models to the generated synthetic networks.Comment: Updated, 39 page

Young children working together:Cooperative learning effects on group work of children in Grade 1 of primary education

It was examined whether cooperative learning within the Success for All (SfA) program led to improved group work behaviour of Grade 1 pupils. 168 pupils of six SfA schools and 144 pupils of four control schools participated. Positive and negative group work behaviour was observed during a group task, taking into account socioemotional ethos, group participation, and type of dialogue. Longitudinal multilevel analysis was used for the sequence of observed 20-s time intervals. SfA groups showed more positive and less negative group work behaviour compared to control groups, whilst controlling for several group characteristics. Results suggest that negative group work behaviour increased gradually during the whole task in control groups, while in SfA groups it increased only towards the end of the task. The findings indicate that cooperative learning may lead to improved group work behaviour of young pupils (6–7 years old)

Familiarity modulates neural tracking of sung and spoken utterances

Music is often described in the laboratory and in the classroom as a beneficial tool for memory encoding and retention, with a particularly strong effect when words are sung to familiar compared to unfamiliar melodies. However, the neural mechanisms underlying this memory benefit, especially for benefits related to familiar music are not well understood. The current study examined whether neural tracking of the slow syllable rhythms of speech and song is modulated by melody familiarity. Participants became familiar with twelve novel melodies over four days prior to MEG testing. Neural tracking of the same utterances spoken and sung revealed greater cerebro-acoustic phase coherence for sung compared to spoken utterances, but did not show an effect of familiar melody when stimuli were grouped by their assigned (trained) familiarity. When participant's subjective ratings of perceived familiarity during the MEG testing session were used to group stimuli, however, a large effect of familiarity was observed. This effect was not specific to song, as it was observed in both sung and spoken utterances. Exploratory analyses revealed some in-session learning of unfamiliar and spoken utterances, with increased neural tracking for untrained stimuli by the end of the MEG testing session. Our results indicate that top-down factors like familiarity are strong modulators of neural tracking for music and language. Participants’ neural tracking was related to their perception of familiarity, which was likely driven by a combination of effects from repeated listening, stimulus-specific melodic simplicity, and individual differences. Beyond simply the acoustic features of music, top-down factors built into the music listening experience, like repetition and familiarity, play a large role in the way we attend to and encode information presented in a musical context

Critical phenomena in exponential random graphs

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence between particle states in a grand canonical ensemble of statistical physics. By adjusting the specific values of these subgraph densities, one can analyze the influence of various local features on the global structure of the network. Loosely put, a phase transition occurs when a singularity arises in the limiting free energy density, as it is the generating function for the limiting expectations of all thermodynamic observables. We derive the full phase diagram for a large family of 3-parameter exponential random graph models with attraction and show that they all consist of a first order surface phase transition bordered by a second order critical curve.Comment: 14 pages, 8 figure