SearcharxivSearch

arXiv subjects

S. Hwang

Publications and source records attributed to S. Hwang.

12 recordsLinked to original sources

Performance of the prototype beam drift chamber for LAMPS at RAON with proton and Carbon-12 beams

Beam Drift Chamber (BDC) is designed to reconstruct the trajectories of incident rare isotope beams provided by RAON (Rare isotope Accelerator complex for ON-line experiments) into the experimental target of LAMPS (Large Acceptance Multi-Purpose Spectrometer). To conduct the performance test of the BDC, the prototype BDC (pBDC) is manufactured and evaluated with the high energy ion beams from HIMAC (Heavy Ion Medical Accelerator in Chiba) facility in Japan. Two kinds of ion beams, 100 MeV proton, and 200 MeV/u $^{12}$C, have been utilized for this evaluation, and the track reconstruction efficiency and position resolution have been measured as the function of applied high voltage. This paper introduces the construction details and presents the track reconstruction efficiency and position resolution of pBDC.

physics.ins-det

Spin orbit torque switching of antiferromagnet through the Neel reorientation in rare-earth ferrite

We suggest coherent switching of canted antiferromagnetic (AFM) spins using spin-orbit torque (SOT) in small magnet. The magnetic system of orthoferrite features biaxial easy anisotropy and the Dzyaloshinskii Moriya interaction, which is perpendicular to the easy axes and therefore creates weak magnetization (m). A damping-like component of the SOT induces N\'eel reorientation along one of the easy axes and then exerts torque on m, leading to tilting of the N\'eel order l. The torque on the magnetization becomes stronger due to coupling with the induced Oersted field or the field-like component of the SOT, enhancing the tilting of l. Therefore, l is found to experience deterministic switching after the SOT is turned off. Based upon both numerical and analytical analysis of the coherent switching, XOR logic gates are also found to be implemented in a single magnetic layer. In addition, we investigate how magnetic parameters affect the critical reorientation angle and current density in a simple layered structure of platinum and a canted AFM. Our findings are expected to provide an alternative spin-switching mechanism for ultrafast applications such as spin logic and electronic devices.

cond-mat.mtrl-sci

Efficient algorithm to compute mutually connected components in interdependent networks

Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that the time complexity of this algorithm is approximately $O({N^{1.2} })$ for random graphs, which is more efficient than $O(N^{2})$ of the brute-force algorithm. We confirm the correctness of our algorithm by comparing the behavior of the order parameter as links are removed with existing results for three types of double-layer multiplex networks. We anticipate that this algorithm will be used for simulations of large-size systems that have been previously inaccessible.

cond-mat.stat-mech

Origin of the mixed-order transition in multiplex networks: the Ashkin-Teller model

Recently, diverse phase transition (PT) types have been obtained in multiplex networks, such as discontinuous, continuous, and mixed-order PTs. However, they emerge from individual systems, and there is no theoretical understanding of such PTs in a single framework. Here, we study a spin model called the Ashkin-Teller (AT) model in a mono-layer scale-free network; this can be regarded as a model of two species of Ising spin placed on each layer of a double-layer network. The four-spin interaction in the AT model represents the inter-layer interaction in the multiplex network. Diverse PTs emerge depending on the inter-layer coupling strength and network structure. Especially, we find that mixed-order PTs occur at the critical end points. The origin of such behavior is explained in the framework of Landau-Ginzburg theory.

cond-mat.stat-mech

Origin of the hub spectral dimension in scale-free networks

The return-to-origin probability and the first passage time distribution are essential quantities for understanding transport phenomena in diverse systems. The behaviors of these quantities typically depend on the spectral dimension $d_s$. However, it was recently revealed that in scale-free networks these quantities show a crossover between two power-law regimes characterized by $ d_s $ and the so-called hub spectral dimension $d_s^{\textrm{(hub)}}$ due to the heterogeneity of connectivities of each node. To understand the origin of $d_s^{\textrm{(hub)}}$ from a theoretical perspective, we study a random walk problem on hierarchical scale-free networks by using the renormalization group (RG) approach. Under the RG transformation, not only the system size but also the degree of each node changes due to the scale-free nature of the degree distribution. We show that the anomalous behavior of random walks involving the hub spectral dimension $d_s^{\textrm{(hub)}}$ is induced by the conservation of the power-law degree distribution under the RG transformation.

cond-mat.stat-mech

Fast Algorithm for Relaxation Processes in Big-data Systems

Relaxation processes driven by a Laplacian matrix can be found in many real-world big-data systems, for example, in search engines on the World-Wide-Web and the dynamic load balancing protocols in mesh networks. To numerically implement such processes, a fast-running algorithm for the calculation of the pseudo inverse of the Laplacian matrix is essential. Here we propose an algorithm which computes fast and efficiently the pseudo inverse of Markov chain generator matrices satisfying the detailed-balance condition, a general class of matrices including the Laplacian. The algorithm utilizes the renormalization of the Gaussian integral. In addition to its applicability to a wide range of problems, the algorithm outperforms other algorithms in its ability to compute within a manageable computing time arbitrary elements of the pseudo inverse of a matrix of size millions by millions. Therefore our algorithm can be used very widely in analyzing the relaxation processes occurring on large-scale networked systems.

cond-mat.stat-mech

Avoiding a Spanning Cluster in Percolation Models

When dynamics in a system proceeds under suppressive external bias, the system can undergo an abrupt phase transition, as it occurs for example in the epidemic spreading. Recently, an explosive percolation (EP) model was introduced in line with such phenomena. The order of the EP transition has not been clarified in a unified framework covering low dimensional systems and the mean-field limit. We introduce a stochastic model, in which a rule for dynamics is designed to avoid the formation of a spanning cluster through competitive selection in Euclidean space. We show by heuristic arguments that, in the thermodynamic limit and depending on a control parameter, the EP transition can be either continuous or discontinuous if $d < d_c$ and is always continuous if $d \geq d_c$, where $d$ is the spatial dimension and $d_c$ the upper critical dimension.

cond-mat.stat-mech

First passage time for random walks in heterogeneous networks

The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous networks, is not yet fully understood. Here, we study, both analytically and numerically, the scaling behavior of the FPT distribution to a given target node, averaged over all starting nodes. We find that random walks arrive quickly at a local hub, and therefore, the FPT distribution shows a crossover with respect to time from fast decay behavior (induced from the attractive effect to the hub) to slow decay behavior (caused by the exploring of the entire system). Moreover, the mean FPT is independent of the degree of the target node in the case of compact exploration. These theoretical results justify the necessity of using a random jump protocol (empirically used in search engines) and provide guidelines for designing an effective network to make information quickly accessible.

cond-mat.stat-mech

Spectral dimensions of hierarchical scale-free networks with shortcuts

The spectral dimension has been widely used to understand transport properties on regular and fractal lattices. Nevertheless, it has been little studied for complex networks such as scale-free and small world networks. Here we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractals or non-fractals depending on the weight of shortcuts. Applying the renormalization group (RG) approach to the Gaussian model, we obtain the spectral dimension exactly. While the spectral dimension varies between $1$ and $2$ for the fractal case, it remains at $2$, independent of the variation of network structure for the non-fractal case. The crossover behavior between the two cases is studied through the RG flow analysis. The analytic results are confirmed by simulation results and their implications for the architecture of complex systems are discussed.

cond-mat.stat-mech

Improved Neutron-Capture Element Abundances in Planetary Nebulae

Spectroscopy of planetary nebulae (PNe) provides the means to investigate s-process enrichments of neutron(n)-capture elements that cannot be detected in asymptotic giant branch (AGB) stars. However, accurate abundance determinations of these elements present a challenge. Corrections for unobserved ions can be large and uncertain, since in many PNe only one ion of a given n-capture element has been detected. Furthermore, the atomic data governing the ionization balance of these species are not well-determined, inhibiting the derivation of accurate ionization corrections. We present initial results of a program that addresses these challenges. Deep high resolution optical spectroscopy of ~20 PNe has been performed to detect emission lines from trans-iron species including Se, Br, Kr, Rb, and Xe. The optical spectral region provides access to multiple ions of these elements, which reduces the magnitude and importance of uncertainties in the ionization corrections. In addition, experimental and theoretical efforts are providing determinations of the photoionization cross-sections and recombination rate coefficients of Se, Kr, and Xe ions. These new atomic data will make it possible to derive robust ionization corrections for these elements. Together, our observational and atomic data results will enable n-capture element abundances to be determined with unprecedented accuracy in ionized nebulae.

astro-ph

Nonsemisimple Fusion Algebras and the Verlinde Formula

We find a nonsemisimple fusion algebra F_p associated with each (1,p) Virasoro model. We present a nonsemisimple generalization of the Verlinde formula which allows us to derive F_p from modular transformations of characters.

hep-th

Logarithmic Conformal Field Theories via Logarithmic Deformations

We construct logarithmic conformal field theories starting from an ordinary conformal field theory -- with a chiral algebra C and the corresponding space of states V -- via a two-step construction: i) deforming the chiral algebra representation on V\tensor End K[[z,1/z]], where K is an auxiliary finite-dimensional vector space, and ii) extending C by operators corresponding to the endomorphisms End K. For K=C^2, with End K being the two-dimensional Clifford algebra, our construction results in extending C by an operator that can be thought of as \partial^{-1}E, where \oint E is a fermionic screening. This covers the (2,p) Virasoro minimal models as well as the sl(2) WZW theory.

hep-th