Wählen als Gruppenerfahrung?

Lazarsfeld et al. have formulated a voting model, which is based on the influences of group embedding. This essentially means that people adapt their voting behaviour according to their social embeddings. However, the individualisation thesis has recently claimed that group embeddings have become looser and more often contradictory. Can the empiric findings of Lazarsfeld therefore still be valid? This analysis, which is based on a panel study on the Styrian Local Elections 2000, sets out to test the applicability of this voting model. It can be shown clearly, that people are still more likely to vote for the parties, which are popular within their social surroundings. However, when put under cross pressures, people tend to change their party preferences, whereas relevant cross pressures are not only resulting from social embeddings, but also from the evaluation of politicians, issues and so on.     

Combining the t test and Wilcoxon's rank-sum test

In the two-sample location-shift problem, Student's t test or Wilcoxon's rank-sum test are commonly applied. The latter test can be more powerful for non-normal data. Here, we propose to combine the two tests within a maximum test. We show that the constructed maximum test controls the type I error rate and has good power characteristics for a variety of distributions; its power is close to that of the more powerful of the two tests. Thus, irrespective of the distribution, the maximum test stabilizes the power. To carry out the maximum test is a more powerful strategy than selecting one of the single tests. The proposed test is applied to data of a clinical trial.     

Social origin,field of study and graduates’ career progression: does social inequality vary across fields?

Research on stratification and mobility has consistently shown that in the UK there is a direct impact of social origin on occupational destination net of educational attainment even for degree‐holders. However, only a few studies applied a longitudinal and dynamic perspective on how intergenerational mobility shapes graduates’ working careers. Using multilevel growth curve modelling and data from the 1970 British cohort study (BCS70), we contribute to this research by looking at the emergence of social inequalities during the first ten years since labour market entry. We further distinguish between graduates of different fields of study as we expect social disparities to develop differently due to differences in initial occupational placement and upward mobility processes. We find that parental class does not affect occupational prestige over and above prior achievement. Separate analyses by the field of study show that initial differences in occupational prestige and career progression do not differ between graduates from different classes of origin in STEM fields, and arts and humanities. It is only in the social sciences that working‐class graduates start with lower occupational prestige but soon catch up with their peers from higher classes. Overall, our results indicate no direct effect of social origin on occupational attainment for degree‐holders once we broaden our focus to a dynamic life course perspective.     

Excessive Gambling and Online Gambling Communities

The Internet provides an accessible context for online gambling and gambling-related online communities, such as discussion forums for gamblers. These communities may be particularly attractive to young gamblers who are active Internet users. The aim of this study was to examine the use of gambling-related online communities and their relevance to excessive gambling among 15–25-year-old Finnish Internet users (N?=?1200). Excessive gambling was assessed by using the South Oaks Gambling Screen. Respondents were asked in a survey about their use of various kinds of gambling-related online communities, and sociodemographic and behavioral factors were adjusted. The results of the study revealed that over half (54.33%) of respondents who had visited gambling-related online communities were either at-risk gamblers or probable pathological gamblers. Discussion in these communities was mainly based on sharing gambling tips and experiences, and very few respondents said that they related to gambling problems and recovery. In three different regression models, visiting gambling-related online communities was a significant predictor for excessive gambling (with 95% confidence level) even after adjusting confounding factors. The association of visiting such sites was even stronger among probable pathological gamblers than among at-risk gamblers. Health professionals working with young people should be aware of the role of online communities in terms of development and persistence of excessive gambling. Monitoring the use of online gambling communities as well as utilizing recovery-oriented support both offline and online would be important in preventing further problems. Gambling platforms should also include warnings about excessive gambling and provide links to helpful sources.     

A tighter insertion-based approximation of the crossing number

Let G be a planar graph and F a set of additional edges not yet in G. The multiple edge insertion problem (MEI) asks for a drawing of \(G+F\) with the minimum number of pairwise edge crossings, such that the subdrawing of G is plane. Finding an exact solution to MEI is NP-hard for general F. We present the first polynomial time algorithm for MEI that achieves an additive approximation guarantee—depending only on the size of F and the maximum degree of G, in the case of connected G. Our algorithm seems to be the first directly implementable one in that realm, too, next to the single edge insertion. It is also known that an (even approximate) solution to the MEI problem would approximate the crossing number of the F-almost-planar graph \(G+F\), while computing the crossing number of \(G+F\) exactly is NP-hard already when \(|F|=1\). Hence our algorithm induces new, improved approximation bounds for the crossing number problem of F-almost-planar graphs, achieving constant-factor approximation for the large class of such graphs of bounded degrees and bounded size of F.