Self-attracting walk on heterogeneous networks

Universal cover-time distribution of heterogeneous random walks

The cover-time problem, i.e., the time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addressing the full distribution of cover times for random walk on complex structures has been a long-standing challenge and has attracted persistent efforts. Usually it is assumed that the random walk is noncompact, to facilitate theoretical treatments by neglecting the correlations between visits. The known results are essentially limited to noncompact and homogeneous systems, where different sites are on an equal footing and have identical or close mean first-passage times, such as random walks on a torus. In contrast, realistic random walks are prevailingly heterogeneous with diversified mean first-passage times. Does a universal distribution still exist? Here, by considering the most general situations of noncompact random walks, we uncover a generalized rescaling relation for the cover time, exploiting the diversified mean first-passage times that have not been accounted for before. This allows us to concretely establish a universal distribution of the rescaled cover times for heterogeneous noncompact random walks, which turns out to be the Gumbel universality class that is ubiquitous for a large family of extreme value statistics. Our analysis is based on the transfer matrix framework, which is generic in that, besides heterogeneity, it is also robust against biased protocols, directed links, and self-connecting loops. The finding is corroborated with extensive numerical simulations of diverse heterogeneous noncompact random walks on both model and realistic topological structures. Our technical ingredient may be exploited for other extreme value or ergodicity problems with nonidentical distributions.

Unexpected advantages of exploitation for target searches in complex networks

Exploitation universally emerges in various decision-making contexts, e.g., animals foraging, web surfing, the evolution of scientists' research topics, and our daily lives. Despite its ubiquity, exploitation, which refers to the behavior of revisiting previous experiences, has often been considered to delay the search process of finding a target. In this paper, we investigate how exploitation affects search performance by applying a non-Markovian random walk model, where a walker randomly revisits a previously visited node using long-term memory. We analytically study two broad forms of network structures, namely, (i) clique-like networks and (ii) lollipop-like networks and find that exploitation can significantly improve search performance in lollipop-like networks, whereas it hinders target search in clique-like networks. Moreover, we numerically verify that exploitation can reduce the time needed to fully explore the underlying networks using 550 diverse real-world networks. Based on the analytic result, we define the lollipop-likeness of a network and observe a positive relationship between the advantage of exploitation and lollipop-likeness.

Optimizing hospital distribution across districts to reduce tuberculosis fatalities

The spatial distributions of diverse facilities are often understood in terms of the optimization of the commute distance or the economic profit. Incorporating more general objective functions into such optimization framework may be useful, helping the policy decisions to meet various social and economic demands. As an example, we consider how hospitals should be distributed to minimize the total fatalities of tuberculosis (TB). The empirical data of Korea shows that the fatality rate of TB in a district decreases with the areal density of hospitals, implying their correlation and the possibility of reducing the nationwide fatalities by adjusting the hospital distribution across districts. Approximating the fatality rate by the probability of a patient not to visit a hospital in her/his residential district for the duration period of TB and evaluating the latter probability in the random-walk framework, we obtain the fatality rate as an exponential function of the hospital density with a characteristic constant related to each district’s effective lattice constant estimable empirically. This leads us to the optimal hospital distribution which finds the hospital density in a district to be a logarithmic function of the rescaled patient density. The total fatalities is reduced by 13% with this optimum. The current hospital density deviates from the optimized one in different manners from district to district, which is analyzed in the proposed model framework. The assumptions and limitations of our study are also discussed.

Understanding the temporal pattern of spreading in heterogeneous networks: Theory of the mean infection time

For a reliable prediction of an epidemic or information spreading pattern in complex systems, well-defined measures are essential. In the susceptible-infected model on heterogeneous networks, the cluster of infected nodes in the intermediate-time regime exhibits too large fluctuation in size to use its mean size as a representative value. The cluster size follows quite a broad distribution, which is shown to be derived from the variation of the cluster size with the time when a hub node was first infected. On the contrary, the distribution of the time taken to infect a given number of nodes is well concentrated at its mean, suggesting the mean infection time is a better measure. We show that the mean infection time can be evaluated by using the scaling behaviors of the boundary area of the infected cluster and use it to find a nonexponential but algebraic spreading phase in the intermediate stage on strongly heterogeneous networks. Such slow spreading originates in only small-degree nodes left susceptible, while most hub nodes are already infected in the early exponential-spreading stage. Our results offer a way to detour around large statistical fluctuations and quantify reliably the temporal pattern of spread under structural heterogeneity.

Nonstationary Markovian replication process causing diverse diffusions

We introduce a single generative mechanism that can be used to describe diverse nonstationary diffusions. A nonstationary Markovian replication process for steps is considered for which we derive analytically the time evolution of the probability distribution of the walker's displacement and the generalized telegrapher equation with time-varying coefficients, and we find that diffusivity can be determined by temporal changes of replication of an immediate step. By controlling the replications, we realize diverse diffusions such as alternating diffusion, superdiffusion, subdiffusion, and marginal diffusion, which originate from oscillating, increasing, decreasing, and slowly increasing or decreasing replications with time, respectively.