arXiv subjects

Koji Nemoto

Publications and source records attributed to Koji Nemoto.

At least 19 recordsLinked to original sources

arXiv2026

Approximate master equations for the spatial public goods game

The spatial public goods game has been used to examine factors that promote cooperation. Owing to the complexity of the dynamics of this game, previous studies on this model neglected analytical approaches and relied entirely on numerical calculations using the Monte Carlo (MC) simulations. In this paper, we present the approximate master equations (AMEs) for this model. We report that the results obtained by the AMEs are mostly qualitatively consistent with those obtained by the MC simulations. Furthermore, we show that it is possible to obtain phase boundaries analytically in certain parameter regions. In the region where the noise in strategy decisions is very large, the phase boundary can be obtained analytically by considering perturbations from the steady state of the voter model. In the noiseless region, discontinuous phase transitions occur because of the characteristics of the function that represents strategy updating. Our approach is useful for clarifying the details of the mechanisms that promote cooperation and can be easily applied to other group interaction models.

physics.soc-ph↗

arXiv2026

The SIS Competition Model for Conflicting Rumors

We propose an SIS competition model describing the propagation of conflicting rumors, such as fake news and its corrections. This simple model captures the interaction between rumor propagation and opinion dynamics, where rumors drive opinion changes and, conversely, individuals' opinions determine the infection rates of rumors. We analytically derive all steady states and their stability. These results uncover a novel coexistence mechanism. This coexistence corresponds to a scenario where belief in one rumor (e.g., fake news) paradoxically aids the spread of the opposing rumor (e.g., corrective information). Due to this mechanism, a nontrivial but realistic phenomenon occurs where a lower infection rate actually enhances the spread of a rumor. Furthermore, although the model does not explicitly incorporate majority conformity, a phenomenon where the majority gains an advantage emerges spontaneously. Consequently, even if one rumor has a higher infection rate, it may be eliminated by the other if its initial share fails to exceed a critical threshold. We analytically derive this threshold using the singular perturbation method.

physics.soc-ph↗

arXiv2018

Sudden spreading of infections in an epidemic model with a finite seed fraction

We study a simple case of the susceptible-weakened-infected-removed model in regular random graphs in a situation where an epidemic starts from a finite fraction of initially infected nodes (seeds). Previous studies have shown that, assuming a single seed, this model exhibits a kind of discontinuous transition at a certain value of infection rate. Performing Monte Carlo simulations and evaluating approximate master equations, we find that the present model has two critical infection rates for the case with a finite seed fraction. At the first critical rate the system shows a percolation transition of clusters composed of removed nodes, and at the second critical rate, which is larger than the first one, a giant cluster suddenly grows and the order parameter jumps even though it has been already rising. Numerical evaluation of the master equations shows that such sudden epidemic spreading does occur if the degree of the underlying network is large and the seed fraction is small.

physics.soc-ph↗

arXiv2017

Efficiency of prompt quarantine measures on a susceptible-infected-removed model in networks

This study focuses on investigating the manner in which a prompt quarantine measure suppresses epidemics in networks. A simple and ideal quarantine measure is considered in which an individual is detected with a probability immediately after it becomes infected and the detected one and its neighbors are promptly isolated. The efficiency of this quarantine in suppressing a susceptible-infected-removed (SIR) model is tested in random graphs and uncorrelated scale-free networks. Monte Carlo simulations are used to show that the prompt quarantine measure outperforms random and acquaintance preventive vaccination schemes in terms of reducing the number of infected individuals. The epidemic threshold for the SIR model is analytically derived under the quarantine measure, and the theoretical findings indicate that prompt executions of quarantines are highly effective in containing epidemics. Even if infected individuals are detected with a very low probability, the SIR model under a prompt quarantine measure has finite epidemic thresholds in fat-tailed scale-free networks in which an infected individual can always cause an outbreak of a finite relative size without any measure. The numerical simulations also demonstrate that the present quarantine measure is effective in suppressing epidemics in real networks.

physics.soc-ph↗

arXiv2016

Local cluster-size statistics in the critical phase of bond percolation on the Cayley tree

We study bond percolation of the Cayley tree (CT) by focusing on the probability distribution function (PDF) of a local variable, namely, the size of the cluster including a selected vertex. Because the CT does not have a dominant bulk region, which is free from the boundary effect, even in the large-size limit, the phase of the system on it is not well defined. We herein show that local observation is useful to define the phase of such a system in association with the well-defined phase of the system on the Bethe lattice, that is, an infinite regular tree without boundary. Above the percolation threshold, the PDFs of the vertex at the center of the CT (the origin) and of the vertices near the boundary of the CT (the leaves) have different forms, which are also dissimilar to the PDF observed in the ordinary percolating phase of a Euclidean lattice. The PDF for the origin of the CT is bimodal: a decaying exponential function and a system-size-dependent asymmetric peak, which obeys a finite-size-scaling law with a fractal exponent. These modes are respectively related to the PDFs of the finite and infinite clusters in the nonuniqueness phase of the Bethe lattice. On the other hand, the PDF for the leaf of the CT is a decaying power function. This is similar to the PDF observed at a critical point of a Euclidean lattice but is attributed to the nesting structure of the CT around the boundary.

cond-mat.stat-mech↗

arXiv2016

Outbreaks in susceptible-infected-removed epidemics with multiple seeds

We study a susceptible-infected-removed (SIR) model with multiple seeds on a regular random graph. Many researchers have studied the epidemic threshold of epidemic models above which a global outbreak can occur, starting from an infinitesimal fraction of seeds. However, there have been few studies of epidemic models with finite fractions of seeds. The aim of this paper is to clarify what happens in phase transitions in such cases. The SIR model in networks exhibits two percolation transitions. We derive the percolation transition points for the SIR model with multiple seeds to show that as the infection rate increases epidemic clusters generated from each seed percolate before a single seed can induce a global outbreak.

physics.soc-ph↗

arXiv2014

Discontinuous Transition of a Multistage Independent Cascade Model on Networks

We propose a multistage version of the independent cascade model, which we call a multistage independent cascade (MIC) model, on networks. This model is parameterized by two probabilities: the probability $T_1$ that a node adopting a fad increases the awareness of a neighboring susceptible node, and the probability $T_2$ that an adopter directly causes a susceptible node to adopt the fad. We formulate a tree approximation for the MIC model on an uncorrelated network with an arbitrary degree distribution $p_k$. Applied on a random regular network with degree $k=6$, this model exhibits a rich phase diagram, including continuous and discontinuous transition lines for fad percolation, and a continuous transition line for the percolation of susceptible nodes. In particular, the percolation transition of fads is discontinuous (continuous) when $T_1$ is larger (smaller) than a certain value. A similar discontinuous transition is also observed in random graphs and scale-free networks. Furthermore, assigning a finite fraction of initial adopters dramatically changes the phase boundaries.

physics.soc-ph↗

arXiv2014

Critical Phase in Complex Networks: a Numerical Study

We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and percolating phase at the critical point. The critical point is stretched to a finite region, called the critical phase, on nonamenable graphs. To investigate the critical phase, we introduce a fractal exponent, which characterizes a subextensive order of the system. We perform the Monte Carlo simulations for percolation on two nonamenable graphs - the binary tree and the enhanced binary tree. The former shows the nonpercolating phase and the critical phase, whereas the latter shows all three phases. We also examine the possibility of critical phase in complex networks. Our conjecture is that networks with a growth mechanism have only the critical phase and the percolating phase. We study percolation on a stochastically growing network with and without a preferential attachment mechanism, and a deterministically growing network, called the decorated flower, to show that the critical phase appears in those models. We provide a finite-size scaling by using the fractal exponent, which would be a powerful method for numerical analysis of the phase transition involving the critical phase.

cond-mat.dis-nn↗

arXiv2014

Generalized scaling theory for critical phenomena including essential singularity and infinite dimensionality

We propose a generic scaling theory for critical phenomena that includes power-law and essential singularities in finite and infinite dimensional systems. In addition, we clarify its validity by analyzing the Potts model in a simple hierarchical network, where a saddle-node bifurcation of the renormalization-group fixed point governs the essential singularity.

cond-mat.stat-mech↗

arXiv2013

Hierarchical scale-free network is fragile against random failure

We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev- Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation threshold is zero. We also show that the percolation threshold of intentional attacks is 1. Our results suggest that this hierarchical scale-free network is very fragile against both random failure and intentional attacks. Such a structural defect is common in many hierarchical network models.

cond-mat.dis-nn↗

arXiv2013

Profile and scaling of the fractal exponent of percolations in complex networks

We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted Berezinskii-Kosterlitz-Thouless singularity, it is very hard for numerical simulations to determine the transition point precisely. Since the neighbor of the ordered phase is not a simple disordered phase but a critical phase, conventional finite size scaling technique does not work. In our finite size scaling, the forms of the scaling functions for the order parameter and the fractal exponent determine the transition point and critical exponents numerically for an infinite order transition as well as a standard second order transition. We confirm the validity of our scaling hypothesis through Monte-Carlo simulations for bond percolations in some network models: the decorated (2,2)-flower and the random attachment growing network, where an infinite order transition occurs, and the configuration model, where a second order transition occurs.

cond-mat.dis-nn↗

arXiv2012

Criticality governed by the stable renormalization fixed point of the Ising model in the hierarchical small-world network

We study the Ising model in a hierarchical small-world network by renormalization group analysis, and find a phase transition between an ordered phase and a critical phase, which is driven by the coupling strength of the shortcut edges. Unlike ordinary phase transitions, which are related to unstable renormalization fixed points (FPs), the singularity in the ordered phase of the present model is governed by the FP that coincides with the stable FP of the ordered phase. The weak stability of the FP yields peculiar criticalities including logarithmic behavior. On the other hand, the critical phase is related to a nontrivial FP, which depends on the coupling strength and is continuously connected to the ordered FP at the transition point. We show that this continuity indicates the existence of a finite correlation-length-like quantity inside the critical phase, which diverges upon approaching the transition point.

cond-mat.stat-mech↗

arXiv2012

Robustness of correlated networks against propagating attacks

We investigate robustness of correlated networks against propagating attacks modeled by a susceptible-infected-removed model. By Monte-Carlo simulations, we numerically determine the first critical infection rate, above which a global outbreak of disease occurs, and the second critical infection rate, above which disease disintegrates the network. Our result shows that correlated networks are robust compared to the uncorrelated ones, regardless of whether they are assortative or disassortative, when a fraction of infected nodes in an initial state is not too large. For large initial fraction, disassortative network becomes fragile while assortative network holds robustness. This behavior is related to the layered network structure inevitably generated by a rewiring procedure we adopt to realize correlated networks.

physics.soc-ph↗

arXiv2012

Phase transition without global ordering in a hierarchical scale-free network

We study the site-bond percolation on a hierarchical scale-free network, namely, the decorated (2,2)-flower, by using the renormalization group technique. The phase diagram essentially depends on the fraction of occupied sites. Surprisingly, when each site is unoccupied even with a small probability, the system permits neither the percolating phase nor the nonpercolating phase, but rather only critical phases. Although the order parameter always remains zero, a transition still exists between the critical phases that is characterized by the value of the fractal exponent, which measures the degree of criticality; the system changes from one critical state to another with the jump of the fractal exponent at the transition point. The phase boundary depends on the fraction of occupied sites. When the fraction of unoccupied sites exceeds a certain value, the transition line between the critical phases disappears, and a unique critical phase remains.

cond-mat.dis-nn↗

arXiv2010

Generating-function approach for bond percolations in hierarchical networks

We study bond percolations on hierarchical scale-free networks with the open bond probability of the shortcuts $\tilde{p}$ and that of the ordinary bonds $p$. The system has a critical phase in which the percolating probability $P$ takes an intermediate value $0<P<1$. Using generating function approach, we calculate the fractal exponent $ψ$ of the root clusters to show that $ψ$ varies continuously with $\tilde{p}$ in the critical phase. We confirm numerically that the distribution $n_s$ of cluster size $s$ in the critical phase obeys a power law $n_s \propto s^{-τ}$, where $τ$ satisfies the scaling relation $τ=1+ψ^{-1}$. In addition the critical exponent $β(\tilde{p})$ of the order parameter varies as $\tilde{p}$, from $β\simeq 0.164694$ at $\tilde{p}=0$ to infinity at $\tilde{p}=\tilde{p}_c=5/32$.

cond-mat.dis-nn↗

arXiv2010

Critical Phase of Bond Percolations on Growing Networks

The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^ψ$ and the mean number of clusters with size $s$ per node follows a power function $n_s \propto s^{-τ}$ in the whole range of open bond probability $p$. The exponent $τ$ and the fractal exponent $ψ$ are also derived as a function of $p$ and the degree exponent $γ$, and are found to satisfy the scaling relation $τ=1+ψ^{-1}$. Numerical results with several network sizes are quite well fitted by a finite size scaling for a wide range of $p$ and $γ$, which gives a clear evidence for the existence of a critical phase.

cond-mat.dis-nn↗

arXiv2008

Abnormal diffusion of a single vortex in the two dimensional XY model

We study thermal diffusion dynamics of a single vortex in two dimensional XY model. By numerical simulations we find an abnormal diffusion such that the mobility decreases with time $t$ as $1/\ln t$. In addition we construct a one dimensional diffusion-like equation to model the dynamics and confirm that it conserves quantitative property of the abnormal diffusion. By analyzing the reduced model, we find that the radius of the collectively moving region with the vortex core grows as $R(t) \propto t^{1/2}$. This suggests that the mobility of the vortex is described by dynamical correlation length as $1/\ln R(t)$.

cond-mat.supr-con↗

arXiv2008

Ferromagnetic Ising spin systems on the growing random tree

We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+α$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an estimate of the divergent temperature $T_s$ below which the zero-field susceptibility of the system diverges. Our result shows that $T_s$ is related to $α$ as $\tanh(J/T_s)=α/[2(α+1)]$, where $J$ is the ferromagnetic interaction. An analysis of exactly solvable limit for the model and numerical calculation support the validity of this estimate.

cond-mat.stat-mech↗