Effective vaccination strategies for realistic social networks

We consider the effectiveness of targeted vaccination at preventing the spread of infectious disease in a realistic social network. We compare vaccination strategies based on no information (random vaccination) to complete information (PageRank) about the network. The most effective strategy we find is to vaccinate those people with the most unvaccinated contacts. However, this strategy requires considerable information and computational effort which may not be practical. The next best strategies vaccinate people with many contacts who in turn have few contacts.     

A last updating evolution model for online social networks

As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.     

战后日本的军国主义

二战以后，随着日本经济的复苏和发展，日本国内的右翼势力及其一些政要人物公开掩饰侵略罪行，逃避战争责任，联系战后日本的政治和军事表现，笔者认为其实质就是美化侵略历史，复活军国主义思想，为日本谋求政治大国和军事大国做准备，不能不引起中日两国人民和其他国家人民的严重警惕。     

Networked analysis of the Shanghai subway network,in China

Recently, cities have become larger and larger, and more and more people are living in large cities. This phenomenon has caused serious traffic congestion which is very detrimental to the development of large cities. In this context, the subway has become the most effective solution for relieving traffic congestion and subways have been constructed in many cities, so the reliability and robustness of subways should be guaranteed. In this paper, Shanghai subway network, in China, will be analyzed and investigated; the topological characteristics and functional properties can be studied in order to assess the reliability and robustness. The topological characteristics can be measured using several parameters; meanwhile the fraction of removed nodes of Shanghai subway network is discussed and compared against that for a random network, and the critical threshold of this fraction is obtained. Two novel parameters called the functionality loss and connectivity of subway lines are proposed for measuring the transport functionality and the connectivity of subway lines. Subway lines 4 and 7 are selected as examples for evaluating the connectivity of lines subjected to different attack protocols. This study indicates that the subway network is robust against random attacks but fragile for malicious attacks, and the highest betweenness node-based attacks can cause the most serious damage to subway networks among the different attack protocols.     

A framework to approach problems of forensic anthropology using complex networks

We have developed a method to analyze and interpret emerging structures in a set of data which lacks some information. It has been conceived to be applied to the problem of getting information about people who disappeared in the Argentine state of Tucumán from 1974 to 1981. Even if the military dictatorship formally started in Argentina had begun in 1976 and lasted until 1983, the disappearance and assassination of people began some months earlier. During this period several circuits of Illegal Detention Centres (IDC) were set up in different locations all over the country. In these secret centres, disappeared people were illegally kept without any sort of constitutional guarantees, and later assassinated. Even today, the final destination of most of the disappeared people’s remains is still unknown. The fundamental hypothesis in this work is that a group of people with the same political affiliation whose disappearances were closely related in time and space shared the same place of captivity (the same IDC or circuit of IDCs). This hypothesis makes sense when applied to the systematic method of repression and disappearances which was actually launched in Tucumán, Argentina (2007) [11]. In this work, the missing individuals are identified as nodes on a network and connections are established among them based on the individuals’ attributes while they were alive, by using rules to link them. In order to determine which rules are the most effective in defining the network, we use other kind of knowledge available in this problem: previous results from the anthropological point of view (based on other sources of information, both oral and written, historical and anthropological data, etc.); and information about the place (one or more IDCs) where some people were kept during their captivity. For these best rules, a prediction about these people’s possible destination is assigned (one or more IDCs where they could have been kept), and the success of the prediction is evaluated. By applying this methodology, we have been successful in 71% of the cases. The best rules take into account the proximity of the locations where the kidnappings took place, and link events which occurred in periods of time from 5 to 7 days. Finally, we used one of the best rules to build a network of IDCs in an attempt to formalize the relation between the illegal detention centres. We found that this network makes sense because there are survivors’ testimonies which confirm some of these connections.     

Lottery and Auction on Quantum Blockchain

This paper proposes a protocol for lottery and a protocol for auction on quantum Blockchain. Our protocol of lottery satisfies randomness, unpredictability, unforgeability, verifiability, decentralization and unconditional security. Our protocol of auction satisfies bid privacy, posterior privacy, bids’ binding, decentralization and unconditional security. Except quantum Blockchain, the main technique involved in both protocols is quantum bit commitment.     

Influence of topology in the evolution of coordination in complex networks under information diffusion constraints

In this paper, we study the influence of the topological structure of social systems on the evolution of coordination in them. We simulate a coordination game (“Stag-hunt”) on four well-known classes of complex networks commonly used to model social systems, namely scale-free, small-world, random and hierarchical-modular, as well as on the well-mixed model. Our particular focus is on understanding the impact of information diffusion on coordination, and how this impact varies according to the topology of the social system. We demonstrate that while time-lags and noise in the information about relative payoffs affect the emergence of coordination in all social systems, some topologies are markedly more resilient than others to these effects. We also show that, while non-coordination may be a better strategy in a society where people do not have information about the payoffs of others, coordination will quickly emerge as the better strategy when people get this information about others, even with noise and time lags. Societies with the so-called small-world structure are most conducive to the emergence of coordination, despite limitations in information propagation, while societies with scale-free topologies are most sensitive to noise and time-lags in information diffusion. Surprisingly, in all topologies, it is not the highest connected people (hubs), but the slightly less connected people (provincial hubs) who first adopt coordination. Our findings confirm that the evolution of coordination in social systems depends heavily on the underlying social network structure.     

A network of two-Chinese-character compound words in the Japanese language

Some statistical properties of a network of two-Chinese-character compound words in the Japanese language are reported. In this network, a node represents a Chinese character and an edge represents a two-Chinese-character compound word. It is found that this network has properties of being “small-world” and “scale-free”. A network formed by only Chinese characters for common use (joyo-kanji in Japanese), which is regarded as a subclass of the original network, also has the small-world property. However, a degree distribution of the network exhibits no clear power law. In order to reproduce the disappearance of the power-law property, a model for a selecting process of the Chinese characters for common use is proposed.     

Exploring the robustness of urban bus network: A case from Southern China

The robustness of urban bus network is essential to a city that heavily relies on buses as its main transportation solution. In this paper, the urban bus network has been modeled as a directed and space L network, and Changsha, a transportation hub of nearly 8 million people and hundreds of bus lines in southern China, is taken as a case. Based on the quantitative analyses of the topological properties, it is found that Changsha urban bus network is a scale-free network, not a small-world network. To evaluate the robustness of the network, five scenarios of network failure are simulated, including a random failure and four types of intentional attacks that differed in key node identification methods (i.e., unweighted degree or betweenness centrality) and attack strategies (i.e., normal or cascading attack). It is revealed that intentional attacks are more destructive than a random failure, and cascading attacks are more disruptive than normal attacks in the urban bus network. In addition, the key nodes identification methods are found to play a critical role in the robustness of the urban bus network. Specifically, cascading attack could be more disruptive when the betweenness centrality is used to identify key nodes; in contrast, normal attack could be more disruptive when the unweighted degree is used to identify key nodes. Our results could provide reference for risk management of urban bus network.     

Functional holography analysis: simplifying the complexity of dynamical networks

We present a novel functional holography (FH) analysis devised to study the dynamics of task-performing dynamical networks. The latter term refers to networks composed of dynamical systems or elements, like gene networks or neural networks. The new approach is based on the realization that task-performing networks follow some underlying principles that are reflected in their activity. Therefore, the analysis is designed to decipher the existence of simple causal motives that are expected to be embedded in the observed complex activity of the networks under study. First we evaluate the matrix of similarities (correlations) between the activities of the network's components. We then perform collective normalization of the similarities (or affinity transformation) to construct a matrix of functional correlations. Using dimension reduction algorithms on the affinity matrix, the matrix is projected onto a principal three-dimensional space of the leading eigenvectors computed by the algorithm. To retrieve back information that is lost in the dimension reduction, we connect the nodes by colored lines that represent the level of the similarities to construct a holographic network in the principal space. Next we calculate the activity propagation in the network (temporal ordering) using different methods like temporal center of mass and cross correlations. The causal information is superimposed on the holographic network by coloring the nodes locations according to the temporal ordering of their activities. First, we illustrate the analysis for simple, artificially constructed examples. Then we demonstrate that by applying the FH analysis to modeled and real neural networks as well as recorded brain activity, hidden causal manifolds with simple yet characteristic geometrical and topological features are deciphered in the complex activity. The term "functional holography" is used to indicate that the goal of the analysis is to extract the maximum amount of functional information about the dynamical network as a whole unit.     

Coevolution of game and network structure with adjustable linking

Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.     

Accurate frequency atlas of molecular iodine near 532 nm measured by an optical frequency comb generator

An optical frequency comb generator (OFCG) at 1064 nm with a modulation frequency of 2 GHz is developed for an accurate optical frequency link between iodine absorption lines near 532 nm. With the OFCG, we have measured frequency differences between seventeen ¹²⁷I₂ transitions with a measurement uncertainty of about 240 Hz (relatively 4.3×10⁻¹³), which is mainly contributed from the frequency repeatability of iodine-stabilized Nd:YAG lasers. The measured transitions provide an attractive frequency reference network and are excellent candidates for the practical realization of the meter.     

Dynamical behaviour of an epidemic on complex networks with population mobility

In this paper, we study the dynamical behaviour of an epidemic on complex networks with population mobility. In our model, the number of people on each node is unrestricted as the nodes of the network are considered as cities, communities, and so on. Because people can travel between different cities, we study the effect of a population's mobility on the epidemic spreading. In view of the population's mobility, we suppose that the susceptible individual can be infected by an infected individual in the same city or other connected cities. Simulations are presented to verify our analysis.     

Basic Study on Imaging Interferometer using Long Gradient-Index Lenses for Optical Coherence Tomography

An imaging interferometer with two long gradient-index (GRIN) lenses and a charge coupled device (CCD) sensor array is proposed and studied for application to an optical coherence tomography system that can observe the subsurface structure of internal organs through a small hole in the body. An image of lines 11 μm wide was obtained using the phase-shifting method and a test pattern as a sample. The lateral resolution obtained was 22 μm. The axial resolution was also measured and found to be 19.4 μm by measuring the coherence function. The dynamic range was about 60 dB, based on the RF spectrum of the beat signal. A sectional image of a 10-yen Japanese coin was measured as a rough surface sample.     

Comparison of gold leaf thickness in Namban folding screens using X-ray fluorescence

In this work, the thickness of the gold leaf applied in six Japanese folding screens is compared using a nondestructive approach. Four screens belonging to the Momoyama period (~1573–1603) and two screens belonging to the early Edo period (~1603–1868) were analyzed in situ using energy dispersive X-ray fluorescence, and the thickness of the applied gold leaf was evaluated using a methodology based on the attenuation of the different characteristic lines of gold in the gold leaf layer. Considering that the leaf may well not be made of pure gold, we established that, for the purpose of comparing the intensity ratios of the Au lines, layers made with gold leaf of high grade can be considered identical. The gold leaf applied in one of the screens from the Edo period was found to be thinner than the gold leaf applied in the other ones. This is consistent with the development of the beating technology to obtain ever more thin gold leafs.     

Analysis of Japanese banks’ historical tree diagram

By using the historical data from the Japanese banks’ database at “The Bankers Library” of Japanese Banker Association, we analyze the historical network of banks from 1868 to 2006. Firstly, we define a bank every year by a particle and draw a space-time evolution process of merger, division, establishment, and failure by a tree diagram structure. We found that the distribution of the tree basin size of real data and simulation result are mostly fitting well. Secondly, we analyze the raw data of financial statements of banks collected by the National Diet library. We confirm that the distributions of the amount of deposits have fat-tail every year, however, small deviations are observed relating to governmental policy.     

Theoretical analysis of X-ray magnetic circular dichroism at the Yb L<Subscript>2, 3</Subscript> absorption edges of YbInCu<Subscript>4</Subscript> in high magnetic fields around the field-induced valence transition

The complex network theory is a way to investigate the complex systems with minimum information about their entities and corresponding interactions. There is a growing interest to studying the earthquake phenomena by the method of networks. Several network features characterize the complexity of seismic events. Unfortunately they depend on how we construct the network. Here we study the role of cell size or in other word the resolution on the network properties for the Iran’s seismic data. We have found that all the network topological features vary as a power of the resolution. Furthermore by increasing the resolution, the networks become random and uncorrelated.     

The map equation

Many real-world networks are so large that we must simplify their structure before we can extract useful information about the systems they represent. As the tools for doing these simplifications proliferate within the network literature, researchers would benefit from some guidelines about which of the so-called community detection algorithms are most appropriate for the structures they are studying and the questions they are asking. Here we show that different methods highlight different aspects of a network's structure and that the the sort of information that we seek to extract about the system must guide us in our decision. For example, many community detection algorithms, including the popular modularity maximization approach, infer module assignments from an underlying model of the network formation process. However, we are not always as interested in how a system's network structure was formed, as we are in how a network's extant structure influences the system's behavior. To see how structure influences current behavior, we will recognize that links in a network induce movement across the network and result in system-wide interdependence. In doing so, we explicitly acknowledge that most networks carry flow. To highlight and simplify the network structure with respect to this flow, we use the map equation. We present an intuitive derivation of this flow-based and information-theoretic method and provide an interactive on-line application that anyone can use to explore the mechanics of the map equation. The differences between the map equation and the modularity maximization approach are not merely conceptual. Because the map equation attends to patterns of flow on the network and the modularity maximization approach does not, the two methods can yield dramatically different results for some network structures. To illustrate this and build our understanding of each method, we partition several sample networks. We also describe an algorithm and provide source code to efficiently decompose large weighted and directed networks based on the map equation.     

Social and place-focused communities in location-based online social networks

Thanks to widely available, cheap Internet access and the ubiquity of smartphones,millions of people around the world now use online location-based social networkingservices. Understanding the structural properties of these systems and their dependenceupon users’ habits and mobility has many potential applications, including resourcerecommendation and link prediction. Here, we construct and characterise social andplace-focused graphs by using longitudinal information about declared social relationshipsand about users’ visits to physical places collected from a popular online location-basedsocial service. We show that although the social and place-focused graphs are constructedfrom the same data set, they have quite different structural properties. We find that thesocial and location-focused graphs have different global and meso-scale structure, and inparticular that social and place-focused communities have negligible overlap.Consequently, group inference based on community detection performed on the social graphalone fails to isolate place-focused groups, even though these do exist in the network. Bystudying the evolution of tie structure within communities, we show that the time periodover which location data are aggregated has a substantial impact on the stability ofplace-focused communities, and that information about place-based groups may be moreuseful for user-centric applications than that obtained from the analysis of socialcommunities alone.     

Association Between Social Network and Physical Function in Community-Dwelling Older Adults in Japan

Objective: A poor social network and the decline of physical function are known to be critical risk factors for functional decline in older adults. The aim of this study was to investigate the relationships between social network and physical function in Japanese community-dwelling older adults. Methods: Participants were 339 adults aged 65 years or older (mean age : 73.0 years, women :70.2%), living independently in their communities. A self-reported questionnaire was used to assess social network on two different scales―the 6-item Lubben Social Network Scale (6LSNS) and frequency of contact with other people. Handgrip strength, knee extension strength, gait speed, Timed Up and Go Test (TUG) results, and 5-repetition chair stand test (CST) scores were used to determine physical function. A multiple regression analysis that adjusted for confounding factors was used to analyze the relationship between the social network scales and each physical function test. Results: According to the results of a multiple regression analysis, a high 6LSNS score was significantly associated with greater handgrip strength (B = 0.63, p = 0.03), faster CST (B = −0.23, p = 0.01), and faster TUG (B = −0.12, p = 0.03), and high frequency of contact was significantly associated with greater handgrip strength (B = 1.08, p = 0.01). Conclusions: Social network was associated with muscle strength and physical performance. Consequently, older adults with poor social networks require an assessment of physical function, since their physical functions have possibly deteriorated.