A Note on Adult Overwintering of Dasymutilla Nigripes in Michigan (Hymenoptera: Mutillidae)

Excerpt: Although Dasymutilla nigripes (Fabricius) is one of the more common Michigan velvet ant species, little is known about its life cycle. In his summary of mutillid life cycles, Michel (1928) indicated that mutillids of northern latitudes probably overwinter in the prepupal stage within the subterranean cells of their hymenopterous hosts. Bohart and McSwain (1939) cited prepupal overwintering as normal for Dasymutilla sackenii (Cresson) in California. However, Potts and Smith (1944), also working in California, collected overwintering adult female Dasymutilla aureola pacifica (Cresson)

How Do Friendships Form?

We examine how people form social networks among their peers. We use a unique dataset that tells us the volume of email between any two people in the sample. The data are from students and recent graduates of Dartmouth College. First year students interact with peers in their immediate proximity and form long term friendships with a subset of these people. This result is consistent with a model in which the expected value of interacting with an unknown person is low (making traveling solely to meet new people unlikely), while the benefits from interacting with the same person repeatedly are high. Geographic proximity and race are greater determinants of social interaction than are common interests, majors, or family background. Two randomly chosen white students interact three times more often than do a black student and a white student. However, placing the black and white student in the same freshman dorm increases their frequency of interaction by a factor of three. A traditional "linear in group means" model of peer ability is only a reasonable approximation to the ability of actual peers chosen when we form the groups around all key factors including distance, race and cohort.

The comprehension revolution : a twenty-year history of process and practice related to reading comprehension

Includes bibliographie

Mixing Time of the Rudvalis Shuffle

We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants considered by Diaconis and Saloff-Coste. We show that in each case Theta(n^3 log n) shuffles are required for the permutation to randomize, which matches (up to constants) previously known upper bounds. In contrast, for the two variants, the mixing time of an individual card is only Theta(n^2) shuffles.Comment: 9 page