Reciprocatory magnetic reconnection in a coronal bright point

Coronal bright points (CBPs) are small-scale and long-duration brightenings in the lower solar corona. They are often explained in terms of magnetic reconnection. We aim to study the sub-structures of a CBP and clarify the relationship among the brightenings of different patches inside the CBP. The event was observed by the X-ray Telescope (XRT) aboard the Hinode spacecraft on 2009 August 22$-$23. The CBP showed repetitive brightenings (or CBP flashes). During each of the two successive CBP flashes, i.e., weak and strong flashes which are separated by $\sim$2 hr, the XRT images revealed that the CBP was composed of two chambers, i.e., patches A and B. During the weak flash, patch A brightened first, and patch B brightened $\sim$2 min later. During the transition, the right leg of a large-scale coronal loop drifted from the right side of the CBP to the left side. During the strong flash, patch B brightened first, and patch A brightened $\sim$2 min later. During the transition, the right leg of the large-scale coronal loop drifted from the left side of the CBP to the right side. In each flash, the rapid change of the connectivity of the large-scale coronal loop is strongly suggestive of the interchange reconnection. For the first time we found reciprocatory reconnection in the CBP, i.e., reconnected loops in the outflow region of the first reconnection process serve as the inflow of the second reconnection process.Comment: 13 pages, 8 figure

Kosterlitz-Thouless transition of quantum XY model in two dimensions

The two-dimensional $S=1/2$ XY model is investigated with an extensive quantum Monte Carlo simulation. The helicity modulus is precisely estimated through a continuous-time loop algorithm for systems up to $128 \times 128$ near and below the critical temperature. The critical temperature is estimated as $T_{\rm KT} = 0.3427(2)J$. The obtained estimates for the helicity modulus are well fitted by a scaling form derived from the Kosterlitz renormalization group equation. The validity of the Kosterlitz-Thouless theory for this model is confirmed.Comment: 8 pages, 2 tables, 6 figure

Evolving graphs: dynamical models, inverse problems and propagation

Applications such as neuroscience, telecommunication, online social networking, transport and retail trading give rise to connectivity patterns that change over time. In this work, we address the resulting need for network models and computational algorithms that deal with dynamic links. We introduce a new class of evolving range-dependent random graphs that gives a tractable framework for modelling and simulation. We develop a spectral algorithm for calibrating a set of edge ranges from a sequence of network snapshots and give a proof of principle illustration on some neuroscience data. We also show how the model can be used computationally and analytically to investigate the scenario where an evolutionary process, such as an epidemic, takes place on an evolving network. This allows us to study the cumulative effect of two distinct types of dynamics