1,473,565 research outputs found

    Medical education : a process in evolution

    Get PDF
    The count down to the eventual migration to Mater Dei is well under way at the University of Malta Medical School. Against this backdrop, exam fever is evident amongst our undergraduate students and those postgraduate students who are in their final year are concentrating on finalising their research and writing up their theses. It is heartening to see the work of years coming to fruition for our students who year after year do their alma mater proud.peer-reviewe

    The early evolution of the H-free process

    Full text link
    The H-free process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal H-free graph obtained at the end of the process. When H is strictly 2-balanced, we show that for some c>0, with high probability as nn \to \infty, the minimum degree in G is at least cn1(vH2)/(eH1)(logn)1/(eH1)cn^{1-(v_H-2)/(e_H-1)}(\log n)^{1/(e_H-1)}. This gives new lower bounds for the Tur\'an numbers of certain bipartite graphs, such as the complete bipartite graphs Kr,rK_{r,r} with r5r \ge 5. When H is a complete graph KsK_s with s5s \ge 5 we show that for some C>0, with high probability the independence number of G is at most Cn2/(s+1)(logn)11/(eH1)Cn^{2/(s+1)}(\log n)^{1-1/(e_H-1)}. This gives new lower bounds for Ramsey numbers R(s,t) for fixed s5s \ge 5 and t large. We also obtain new bounds for the independence number of G for other graphs H, including the case when H is a cycle. Our proofs use the differential equations method for random graph processes to analyse the evolution of the process, and give further information about the structure of the graphs obtained, including asymptotic formulae for a broad class of subgraph extension variables.Comment: 36 page

    Evolution of magnetic flux in an isolated reconnection process

    Get PDF
    A realistic notion of magnetic reconnection is essential to understand the dynamics of magnetic fields in plasmas. Therefore a three-dimensional reconnection process is modeled in a region of nonvanishing magnetic field and is analyzed with respect to the way in which the connection of magnetic flux is changed. The process is localized in space in the sense that the diffusion region is limited to a region of finite radius in an otherwise ideal plasma. A kinematic, stationary model is presented, which allows for analytical solutions. Aside from the well-known flipping of magnetic flux in the reconnection process, the localization requires additional features which were not present in previous two- and 2.5-dimensional models. In particular, rotational plasma flows above and below the diffusion region are found, which substantially modify the process. (C) 2003 American Institute of Physics.</p
    corecore