Searcharxiv⌕ Search

arXiv subjects

N. Ito

Publications and source records attributed to N. Ito.

16 recordsLinked to original sources
arXiv2023

Scaling laws of failure dynamics on complex networks

The topology of the network of load transmitting connections plays an essential role in the cascading failure dynamics of complex systems driven by the redistribution of load after local breakdown events. In particular, as the network structure is gradually tuned from regular to completely random a transition occurs from the localized to mean field behavior of failure spreading. Based on finite size scaling in the fiber bundle model of failure phenomena, here we demonstrate that outside the localized regime, the load bearing capacity and damage tolerance on the macro-scale, and the statistics of clusters of failed nodes on the micro-scale obey scaling laws with exponents which depend on the topology of the load transmission network and on the degree of disorder of the strength of nodes. Most notably, we show that the spatial structure of damage governs the emergence of the localized to mean field transition: as the network gets gradually randomized failed clusters formed on locally regular patches merge through long range links generating a percolation like transition which reduces the load concentration on the network. The results may help to design network structures with an improved robustness against cascading failure.

cond-mat.dis-nn↗
arXiv2022

A nearby long gamma-ray burst from a merger of compact objects

Gamma-ray bursts (GRBs) are flashes of high-energy radiation arising from energetic cosmic explosions. Bursts of long (>2 s) duration are produced by the core-collapse of massive stars, those of short (< 2 s) duration by the merger of two neutron stars (NSs). A third class of events with hybrid high-energy properties was identified, but never conclusively linked to a stellar progenitor. The lack of bright supernovae rules out typical core-collapse explosions, but their distance scales prevent sensitive searches for direct signatures of a progenitor system. Only tentative evidence for a kilonova has been presented. Here we report observations of the exceptionally bright GRB211211A that classify it as a hybrid event and constrain its distance scale to only 346 Mpc. Our measurements indicate that its lower-energy (from ultraviolet to near-infrared) counterpart is powered by a luminous (~1E42 erg/s) kilonova possibly formed in the ejecta of a compact binary merger.

astro-ph.HE↗
arXiv2018

Quantum paramagnet near spin-state transition

Spin-state transition, also known as spin crossover, plays a key role in diverse systems, including minerals and biological materials. In theory, the boundary range between the low- and high-spin states is expected to enrich the transition and give rise to unusual physical states. However, no compound that realizes a nearly degenerate critical range as the ground state without requiring special external conditions has yet been experimentally identified. This study reports that, by comprehensive measurements of macroscopic physical properties, X-ray diffractometry, and neutron spectroscopy, the Sc substitution in LaCoO$_3$ destabilizes its nonmagnetic low-spin state and generates an anomalous paramagnetic state accompanied by the enhancement of transport gap and magneto-lattice-expansion as well as the contraction of Co--O distance with the increase of electron site-transfer. These phenomena are not well described by the mixture of conventional low- and high-spin states, but by their quantum superposition occurring on the verge of a spin-state transition. The present study enables us to significantly accelerate the design of new advanced materials without requiring special equipment based on the concept of quantum spin-state criticality.

cond-mat.str-el↗
arXiv2015

Detector for measuring the $π^+\to e^+ν_e$ branching fraction

The PIENU experiment at TRIUMF is aimed at a measurement of the branching ratio $R^{e/μ}$ = ${Γ\big((π^{+} \rightarrow e^{+} ν_{e}) + (π^{+} \rightarrow e^{+} ν_{e}γ)\big)}/{Γ\big((π^{+} \rightarrow μ^{+} ν_μ)+(π^{+} \rightarrow μ^{+} ν_μγ)\big)}$ with precision $<$0.1\%. Incident pions, delivered at the rate of 60 kHz with momentum 75 MeV/c, were degraded and stopped in a plastic scintillator target. Pions and their decay product positrons were detected with plastic scintillators and tracked with multiwire proportional chambers and silicon strip detectors. The energies of the positrons were measured in a spectrometer consisting of a large NaI(T$\ell$) crystal surrounded by an array of pure CsI crystals. This paper provides a description of the PIENU experimental apparatus and its performance in pursuit of $R^{e/μ}$.

physics.ins-det↗
arXiv2012

Quantification of group chasing and escaping process

We study a simple group chase and escape model by introducing new parameters with which configurations of chasing and escaping in groups are classified into three characteristic patterns. In particular, the parameters distinguish two essential configurations: a one-directional formation of chasers and escapees, and an escapee surrounded by chasers. In addition, pincer movements and aggregating processes of chasers and escapees are also quantified. Appearance of these configurations highlights efficiency of hunting during chasing and escaping.

physics.comp-ph↗
arXiv2011

Efficient Implementations of Molecular Dynamics Simulations for Lennard-Jones Systems

Efficient implementations of the classical molecular dynamics (MD) method for Lennard-Jones particle systems are considered. Not only general algorithms but also techniques that are efficient for some specific CPU architectures are also explained. A simple spatial-decomposition-based strategy is adopted for parallelization. By utilizing the developed code, benchmark simulations are performed on a HITACHI SR16000/J2 system consisting of IBM POWER6 processors which are 4.7 GHz at the National Institute for Fusion Science (NIFS) and an SGI Altix ICE 8400EX system consisting of Intel Xeon processors which are 2.93 GHz at the Institute for Solid State Physics (ISSP), the University of Tokyo. The parallelization efficiency of the largest run, consisting of 4.1 billion particles with 8192 MPI processes, is about 73% relative to that of the smallest run with 128 MPI processes at NIFS, and it is about 66% relative to that of the smallest run with 4 MPI processes at ISSP. The factors causing the parallel overhead are investigated. It is found that fluctuations of the execution time of each process degrade the parallel efficiency. These fluctuations may be due to the interference of the operating system, which is known as OS Jitter.

cond-mat.stat-mech↗
arXiv2011

Search for Massive Neutrinos in the Decay pi --> e nu

Evidence of massive neutrinos in the pi --> e nu decay spectrum was sought with the background pi --> mu --> e decay chain highly suppressed. Upper limits (90% C.L.) on the neutrino mixing matrix element |U_ei|^2 in the neutrino mass region 60--129 MeV/c^2 were set at the level of 10^-8.

hep-ex↗
arXiv2010

Study of a Large NaI(Tl) Crystal

Using a narrow band positron beam, the response of a large high-resolution NaI(Tl) crystal to an incident positron beam was measured. It was found that nuclear interactions cause the appearance of additional peaks in the low energy tail of the deposited energy spectrum.

physics.ins-det↗
arXiv2010

High Purity Pion Beam at TRIUMF

An extension of the TRIUMF M13 low-energy pion channel designed to suppress positrons based on an energy-loss technique is described. A source of beam channel momentum calibration from the decay pi+ --> e+ nu is also described.

physics.acc-ph↗
arXiv2008

Forbush decreases and turbulence levels at CME fronts

We seek to estimate the average level of MHD turbulence near coronal mass ejection (CME) fronts as they propagate from the Sun to the Earth. We examine the cosmic ray data from the GRAPES-3 tracking muon telescope at Ooty, together with the data from other sources for three well observed Forbush decrease events. Each of these events are associated with frontside halo Coronal Mass Ejections (CMEs) and near-Earth magnetic clouds. In each case, we estimate the magnitude of the Forbush decrease using a simple model for the diffusion of high energy protons through the largely closed field lines enclosing the CME as it expands and propagates from the Sun to the Earth. We use estimates of the cross-field diffusion coefficient $D_{\perp}$ derived from published results of extensive Monte Carlo simulations of cosmic rays propagating through turbulent magnetic fields. Our method helps constrain the ratio of energy density in the turbulent magnetic fields to that in the mean magnetic fields near the CME fronts. This ratio is found to be $\sim$ 2% for the 11 April 2001 Forbush decrease event, $\sim$ 6% for the 20 November 2003 Forbush decrease event and $\sim$ 249% for the much more energetic event of 29 October 2003.

astro-ph↗
arXiv2006

A rejection-free Monte Carlo method for the hard-disk system

We construct a rejection-free Monte Carlo method for the hard-disk system. Rejection-free Monte Carlo methods preserve the time-evolution behavior of the standard Monte Carlo method, and this relationship is confirmed for our method by observing nonequilibrium relaxation of a bond-orientational order parameter. The rejection-free method gives a greater computational efficiency than the standard method at high densities. The rejection free method is implemented in a shrewd manner using optimization methods to calculate a rejection probability and to update the system. This method should allow an efficient study of the dynamics of two-dimensional solids at high density.

cond-mat.stat-mech↗
arXiv2006

Massive Parallel Quantum Computer Simulator

We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers.

quant-ph↗
arXiv2000

Experimental evidence for G.U.T. Proton Decay

Deep underground in Kolar Gold Fields, in southern India, an experiment to detect proton decay had been carried out since the end of 1980. Analysis of data yielded the following results; (l) the life time of proton is about 1 x 1031 years, (2) it decays into wide spectrum of decay modes, p -> e+ + pai0, p ->anti-nutrino + K+ and so on, and (3) the life time and the distribution of decay modes are close to the predictions of SU(5) SUSY GUT. Four events representing possibly neutron oscillation are also seen.

hep-ex↗
arXiv1994

Discrete stochastic models for traffic flow

We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties and calculate the so-called fundamental diagrams (flow vs.\ density) for parallel dynamics. This is done numerically by computer simulations of the model and by means of an improved mean-field approximation which takes into account short-range correlations. For cars with maximum velocity 1 the simplest non-trivial approximation gives the exact result. For higher velocities the analytical results, obtained by iterated application of the approximation scheme, are in excellent agreement with the numerical simulations.

cond-mat↗
arXiv1993

Cluster vs Single-Spin Algorithms -- Which are More Efficient?

A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms of site updates per second or the dynamical critical exponents. Our main result is that the cluster algorithms become more efficient when the system size, $L^d$, exceeds, $L\sim 70$--$300$ for $d=2$ and $L\sim 80$--$200$ for $d=3$. The exact value of the crossover is dependent upon the computer being used. The lower end of the crossover range is typical of workstations while the higher end is typical of vector computers. Hence, even for workstations, the system sizes needed for efficient use of the cluster algorithm is relatively large.

cond-mat↗