The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion

For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling limit. The proof is based on an extension of the new expansion for percolation derived in a previous paper, and involves treating the magnetic field as a complex variable. A special case of our result for the two-point function implies that the probability that the cluster of the origin consists of n sites, at the critical point, is given by a multiple of n^{-3/2}, plus an error term of order n^{-3/2-\epsilon} with \epsilon >0. This is a strong statement that the critical exponent delta is given by delta =2.Comment: 56 pages, 3 Postscript figures, in AMS-LaTeX, with graphicx, epic, and xr package

Random Planar Lattices and Integrated SuperBrownian Excursion

In this paper, a surprising connection is described between a specific brand of random lattices, namely planar quadrangulations, and Aldous' Integrated SuperBrownian Excursion (ISE). As a consequence, the radius r_n of a random quadrangulation with n faces is shown to converge, up to scaling, to the width r=R-L of the support of the one-dimensional ISE. More generally the distribution of distances to a random vertex in a random quadrangulation is described in its scaled limit by the random measure ISE shifted to set the minimum of its support in zero. The first combinatorial ingredient is an encoding of quadrangulations by trees embedded in the positive half-line, reminiscent of Cori and Vauquelin's well labelled trees. The second step relates these trees to embedded (discrete) trees in the sense of Aldous, via the conjugation of tree principle, an analogue for trees of Vervaat's construction of the Brownian excursion from the bridge. From probability theory, we need a new result of independent interest: the weak convergence of the encoding of a random embedded plane tree by two contour walks to the Brownian snake description of ISE. Our results suggest the existence of a Continuum Random Map describing in term of ISE the scaled limit of the dynamical triangulations considered in two-dimensional pure quantum gravity.Comment: 44 pages, 22 figures. Slides and extended abstract version are available at http://www.loria.fr/~schaeffe/Pub/Diameter/ and http://www.iecn.u-nancy.fr/~chassain

Será Deseada: A graphic novel about experiences of abortion in Mexico

This is the final version. Available on open access from the link in this recordEconomic and Social Research Council (ESRC

Diffusion and drift of graphene flake on graphite surface

Diffusion and drift of a graphene flake on a graphite surface are analyzed. A potential energy relief of the graphene flake is computed using ab initio and empirical calculations. Based on the analysis of this relief, different mechanisms of diffusion and drift of the graphene flake on the graphite surface are considered. A new mechanism of diffusion and drift of the flake is proposed. According to the proposed mechanism, rotational transition of the flake from commensurate to incommensurate state takes place with subsequent simultaneous rotation and translational motion until a commensurate state is reached again, and so on. Analytic expressions for the diffusion coefficient and mobility of the flake corresponding to different mechanisms are derived in wide ranges of temperatures and sizes of the flake. The molecular dynamics simulations and estimates based on ab initio and empirical calculations demonstrate that the proposed mechanism can be dominant under certain conditions. The influence of structural defects on the diffusion of the flake is examined on the basis of calculations of the potential energy relief and molecular dynamics simulations. The methods of control over the diffusion and drift of graphene components in nanoelectromechanical systems are discussed. The possibility to experimentally determine the barriers to relative motion of graphene layers based on the study of diffusion of a graphene flake is considered. The results obtained can be also applied to polycyclic aromatic molecules on graphene and should be qualitatively valid for a set of commensurate adsorbate-adsorbent systems.Comment: 42 pages, 7 figure

Repeated amphetamine treatment induces neurite outgrowth and enhanced amphetamine-stimulated dopamine release in rat pheochromocytoma cells (PC12 cells) via a protein kinase C- and mitogen activated protein kinase-dependent mechanism

Repeated intermittent treatment with amphetamine (AMPH) induces both neurite outgrowth and enhanced AMPH-stimulated dopamine (DA) release in PC12 cells. We investigated the role of protein kinases in the induction of these AMPH-mediated events by using inhibitors of protein kinase C (PKC), mitogen activated protein kinase (MAP kinase) or protein kinase A (PKA). PKC inhibitors chelerythrine (100 nm and 300 nm), Ro31-8220 (300 nm) and the MAP kinase kinase inhibitor, PD98059 (30 µm) inhibited the ability of AMPH to elicit both neurite outgrowth and the enhanced AMPH-stimulated DA release. The direct-acting PKC activator, 12- O -tetradecanoyl phorbol 13-acetate (TPA, 250 nm) mimicked the ability of AMPH to elicit neurite outgrowth and enhanced DA release. On the contrary, a selective PKA inhibitor, 100 µm Rp-8-Br-cAMPS, blocked only the development of AMPH-stimulated DA release but not the neurite outgrowth. Treatment of the cells with acute AMPH elicited an increase in the activity of PKC and MAP kinase but not PKA. These results demonstrated that AMPH-induced increases in MAP kinase and PKC are important for induction of both the enhancement in transporter-mediated DA release and neurite outgrowth but PKA was only required for the enhancement in AMPH-stimulated DA release. Therefore the mechanisms by which AMPH induces neurite outgrowth and the enhancement in AMPH-stimulated DA release can be differentiated.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/66040/1/j.1471-4159.2003.02127.x.pd

Yoyo Tricks with AES

In this paper we present new fundamental properties of SPNs. These properties turn out to be particularly useful in the adaptive chosen ciphertext/plaintext setting and we show this by introducing for the first time key-independent yoyo-distinguishers for 3- to 5-rounds of AES. All of our distinguishers beat previous records and require respectively $3, 4$ and $2^{25.8}$ data and essentially zero computation except for observing differences. In addition, we present the first key-independent distinguisher for 6-rounds AES based on yoyos that preserve impossible zero differences in plaintexts and ciphertexts. This distinguisher requires an impractical amount of $2^{122.83}$ plaintext/ciphertext pairs and essentially no computation apart from observing the corresponding differences. We then present a very favorable key-recovery attack on 5-rounds of AES that requires only $2^{11.3}$ data complexity and $2^{31}$ computational complexity, which as far as we know is also a new record. All our attacks are in the adaptively chosen plaintext/ciphertext scenario. Our distinguishers for AES stem from new and fundamental properties of generic SPNs, including generic SAS and SASAS, that can be used to preserve zero differences under the action of exchanging values between existing ciphertext and plaintext pairs. We provide a simple distinguisher for 2 generic SP-rounds that requires only 4 adaptively chosen ciphertexts and no computation on the adversaries side. We then describe a generic and deterministic yoyo-game for 3 generic SP-rounds which preserves zero differences in the middle but which we are not capable of exploiting in the generic setting

Bison: Instantiating the Whitened Swap-Or-Not Construction

International audienceWe give the first practical instance-bison-of the Whitened Swap-Or-Not construction. After clarifying inherent limitations of the construction, we point out that this way of building block ciphers allows easy and very strong arguments against differential attacks