Linking pattern to process in cultural evolution: explaining material culture diversity among the Northern Khanty of Northwest Siberia

Book description: This volume offers an integrative approach to the application of evolutionary theory in studies of cultural transmission and social evolution and reveals the enormous range of ways in which Darwinian ideas can lead to productive empirical research, the touchstone of any worthwhile theoretical perspective. While many recent works on cultural evolution adopt a specific theoretical framework, such as dual inheritance theory or human behavioral ecology, Pattern and Process in Cultural Evolution emphasizes empirical analysis and includes authors who employ a range of backgrounds and methods to address aspects of culture from an evolutionary perspective. Editor Stephen Shennan has assembled archaeologists, evolutionary theorists, and ethnographers, whose essays cover a broad range of time periods, localities, cultural groups, and artifacts

Sensitivity of CO2 migration estimation on reservoir temperature and pressure uncertainty

The density and viscosity of supercritical CO2 are sensitive to pressure and temperature (PT) while the viscosity of brine is sensitive primarily to temperature. Oil field PT data in the vicinity of WESTCARB's Phase III injection pilot test site in the southern San Joaquin Valley, California, show a range of PT values, indicating either PT uncertainty or variability. Numerical simulation results across the range of likely PT indicate brine viscosity variation causes virtually no difference in plume evolution and final size, but CO2 density variation causes a large difference. Relative ultimate plume size is almost directly proportional to the relative difference in brine and CO2 density (buoyancy flow). The majority of the difference in plume size occurs during and shortly after the cessation of injection. © 2009 Lawrence Berkeley National Laboratory

Estimating Jones and HOMFLY polynomials with One Clean Qubit

The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class. This is the class of problems solvable in polynomial time on a quantum computer acting on an initial state in which one qubit is pure and the rest are maximally mixed. Here we generalize this result by showing that one clean qubit computers can efficiently approximate the Jones and single-variable HOMFLY polynomials of the trace closure of a braid at any root of unity.Comment: 22 pages, 11 figures, revised in response to referee comment

Temporal Network Analysis of Small Group Discourse

The analysis of school-age children engaged in engineering projects has proceeded by examining the conversations that take place among those children. The analysis of classroom discourse often considers a conversational turn to be the unit of analysis. In this study, small-group conversations among students engaged in a robotics project are analyzed by forming a dynamic network with the students as nodes and the utterances of each turn as edges. The data collected for this project contained more than 1000 turns for each group, with each group consisting of 4 students (and the occasional inclusion of a teacher or other interloper). The conversational turns were coded according to their content to form edges that vary qualitatively, with the content codes taken from prior literature on small group discourse during engineering design projects, resulting in approximately 10 possible codes for each edge. Analyzed as a time sequence of networks, clusters across turns were created that allow for a larger unit of analysis than is usually used. These larger units of analysis are more fruitfully connected to the stages of engineering design. Furthermore, the patterns uncovered allow for hypotheses to be made about the dynamics of transition between these stages, and also allow for these hypotheses to be compared to expert consideration of the group’s stage at various times. Although limited by noise and inter-group variation, the larger units allowed for greater insight into group processes during the engineering design cycle

Adiabatic optimization without local minima

Several previous works have investigated the circumstances under which quantum adiabatic optimization algorithms can tunnel out of local energy minima that trap simulated annealing or other classical local search algorithms. Here we investigate the even more basic question of whether adiabatic optimization algorithms always succeed in polynomial time for trivial optimization problems in which there are no local energy minima other than the global minimum. Surprisingly, we find a counterexample in which the potential is a single basin on a graph, but the eigenvalue gap is exponentially small as a function of the number of vertices. In this counterexample, the ground state wavefunction consists of two "lobes" separated by a region of exponentially small amplitude. Conversely, we prove if the ground state wavefunction is single-peaked then the eigenvalue gap scales at worst as one over the square of the number of vertices.Comment: 20 pages, 1 figure. Journal versio