Variant Monte Carlo algorithm for driven elastic strings in random media

We discuss the non-local Variant Monte Carlo algorithm which has been successfully employed in the study of driven elastic strings in disordered media at the depinning threshold. Here we prove two theorems, which establish that the algorithm satisfies the crucial no-passing rule and that, after some initial time, the string exclusively moves forward. The Variant Monte Carlo algorithm overcomes the shortcomings of local methods, as we show by analyzing the depinning threshold of a single-pin problem.Comment: 6 pages, 2 figures, proceedings of Conference on Computational Physics, CCP2004 (Genova, Italy

Parents\u27 beliefs about emotion and children\u27s subsequent coping strategies as influences on children\u27s level of peer victimization

The current study examined the relation between parents\u27 emotion socialization beliefs and the strategies children use to cope with peer victimization. It was hypothesized that parents\u27 beliefs about emotions would predict how their children cope with instances of school bullying. Children\u27s coping strategies, in turn, were expected to predict their actual level of peer victimization. Children\u27s level of peer victimization was measured via reports from children, peers, and teachers

Robinson-Schensted-Knuth correspondence in the geometry of partial flag varieties

In this paper we generalize to the case of partial flags a result proved both by Spaltenstein and by Steinberg that relates the relative position of two complete flags and the irreducible components of the flag variety in which they lie, using the Robinson-Schensted-Knuth correspondence.Comment: 10 pages, replaced to include an extra reference that also proves lemma 2.