An evolving model of online bipartite networks

Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike  , show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p$p$, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p$p$. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.     

Identifying missing and spurious connections via the bi-directional diffusion on bipartite networks

Link prediction and spurious link detection in complex networks have attracted increasing attention from both physical and computer science communities, due to their wide applications in many real systems. Related previous works mainly focus on monopartite networks while these problems in bipartite networks are not yet systematically addressed. Containing two different kinds of nodes, bipartite networks are essentially different from monopartite networks, especially in node similarity calculation: the similarity between nodes of different kinds (called inter-similarity) is not well defined. In this letter, we employ the local diffusion processes to measure the inter-similarity in bipartite networks. We find that the inter-similarity is asymmetric if the diffusion is applied in different directions. Accordingly, we propose a bi-directional hybrid diffusion method which is shown to achieve higher accuracy than the existing diffusion methods in identifying missing and spurious links in bipartite networks.     

Navigation in large subway networks: An informational approach

The structural properties of the subway network are crucial in effective transportation in cities. This paper presents an information perspective of navigation in four different subway networks: New York City, Paris, Barcelona and Moscow. We addressed our study to investigate what is that makes it complicated to navigate in these kinds of networks and we carried out a comparison between them and their intrinsic constraints. Our methodological approach is based on a set of cost/efficiency indicators which are defined in the complex networks literature. We find that the overall complexity in finding stations measured by the average search information S linearly increases as a function of the network size N. The direct implication of this finding is that from these basic levels of required information, the average value H(k) can be represented as a function of the node degree k. Finally, through analyzing subway networks in space P, we reveal the existing service modularity among subway routes using a rescaled expression of S.     

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.     

An approach to the study of strong-field laser-induced autoionization

Summary An approach is presented to the study of laser-induced autoionization which usescomplex dressed states as a basis, instead of the commonly used Fano eigenstates. The complex dressed states are the eigenstates of an effective Hamiltonian governing the equations of motion for the atomic probability amplitudes in the broad background assumption and in the rotating frame at the laser frequency. The electron and photon spectra are described in terms of the eigenvalues associated with the complex dressed states.

---

Riassunto Viene presentato un approccio allo studio dell'autoionizzazione indotta da laser che, al posto degli autostati di Fano, utilizza quale base una coppia distati vestiti complessi. Tali stati sono gli autostati di una hamiltoniana effettiva che governa le equazioni di moto per le ampiezze di probabilità atomiche in un sistema di riferimento ruotante alla frequenza del laser e nell'ipotesi di continuo largo. Gli spettri di elettroni e fotoni sono descritti in termini degli autovalori associati agli stati vestiti complessi.

---

Резюме Предлагается подход к исследованию автоионизации, индуцированной лазерным сильным полем, в котором используются, как, базис, комплексные “одетые” состояния, вместо обычных собственных состояний Фано. Комплексные “одетые” состояния представляют собственные состояния эффективного гамильтониана, определяющего уравнения движения для амплитуды вероятности атома во вращвющейся системе отсчета с лазерной частотой и в предположении широкого континуума. Электронные и фотонные спектры описываются в терминах собственных значений, связанных с комплексными “одетыми” состояниями.

     

A uniform framework of projection and community detection for one-mode network in bipartite networks

Projection is a widely used method in bipartite networks. However, each projection has a specific application scenario and differs in the forms of mapping for bipartite networks. In this paper, inspired by the network-based information exchange dynamics, we propose a uniform framework of projection. Subsequently, an information exchange rate projection based on the nature of community structures of a network(named IERCP) is designed to detect community structures of bipartite networks. Results from the synthetic and real-world networks show that the IERCP algorithm has higher performance compared with the other projection methods. It suggests that the IERCP may extract more information hidden in bipartite networks and minimize information loss.     

一种新的网络传播中最有影响力的节点发现方法

在复杂网络的传播模型研究中, 如何发现最具影响力的传播节点在理论和现实应用中都有重大的意义. 目前的研究一般使用节点的度数、紧密度、介数和K-shell等中心化指标来评价影响力, 这种方法虽然简单, 但是由于它们仅利用了节点自身的内部属性, 因而在评价影响力时精确度并不高, 普遍性适用性较弱.为了解决这个问题, 本文提出了KSC (K-shell and community centrality)指标模型. 此模型不但考虑了节点的内部属性, 而且还综合考虑了节点的外部属性, 例如节点所属的社区等. 然后利用SIR (susceptible-infected-recovered)模型对传播过程进行仿真, 实验证明所提出的方法可以更好地发现最具有影响力的节点, 且可适用于各种复杂网络. 本文为这项具有挑战性研究提供了新的思想和方法. 关键词： 复杂网络 最具影响力的节点 社区划分 中性化测量     

An effective method to improve the robustness of small-world networks under attack

In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network.Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario.     

A vibrational approach to node centrality and vulnerability in complex networks

We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs. We define the measure as the node displacement, or the amplitude of vibration of each node, under fluctuation due to the thermal bath in which the network is supposed to be submerged. We prove exact relations among the thus defined node displacement, the information centrality and the Kirchhoff index. The relation between the first two suggests that the node displacement has a better resolution of the vulnerability than the information centrality, because the latter is the sum of the local node displacement and the node displacement averaged over the entire network.     

A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks

A large number of networks in the real world have a scale-free structure, and the parameters of the networks change stochastically with time. Searching for the shortest paths in a scale-free dynamic and stochastic network is not only necessary for the estimation of the statistical characteristics such as the average shortest path length of the network, but also challenges the traditional concepts related to the “shortest path” of a network and the design of path searching strategies. In this paper, the concept of shortest path is defined on the basis of a scale-free dynamic and stochastic network model, and a temporal ant colony optimization (TACO) algorithm is proposed for searching for the shortest paths in the network. The convergence and the setup for some important parameters of the TACO algorithm are discussed through theoretical analysis and computer simulations, validating the effectiveness of the proposed algorithm.     

A self-consistent approach to measure preferential attachment in networks and its application to an inherent structure network

Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment rule using time-dependent data. Model networks are grown with known preferential attachment rules to test the method, which is seen to be robust. The method is then applied to a scale-free inherent structure (IS) network, which represents the connections between minima via transition states on a potential energy landscape. Even though this network is static, we can examine the growth of the network as a function of a threshold energy (rather than time), where only those transition states with energies lower than the threshold energy contribute to the network. For these networks we are able to detect the presence of preferential attachment, and this helps to explain the ubiquity of funnels on potential energy landscapes. However, the scale-free degree distribution shows some differences from that of a model network grown using the obtained preferential attachment rules, implying that other factors are also important in the growth process.     

Neural networks for the dimensionality reduction of GOME measurement vector in the estimation of ozone profiles

Dimensionality reduction can be of crucial importance in the application of inversion schemes to atmospheric remote sensing data. In this study the problem of dimensionality reduction in the retrieval of ozone concentration profiles from the radiance measurements provided by the instrument Global Ozone Monitoring Experiment (GOME) on board of ESA satellite ERS-2 is considered. By means of radiative transfer modelling, neural networks and pruning algorithms, a complete procedure has been designed to extract the GOME spectral ranges most crucial for the inversion. The quality of the resulting retrieval algorithm has been evaluated by comparing its performance to that yielded by other schemes and co-located profiles obtained with lidar measurements.     

Detecting connectivity of small,dense oscillator networks from dynamical measurements based on a phase modeling approach

An approach is presented for detecting the connectivity between the oscillator elements from the measured multivariate time series data. Our methodology is based upon the phase equation modeling of the oscillator networks, where not only the connection matrix but also the natural frequencies and the interaction function of the oscillators are estimated. Application of this technique to simulated data as well as experimental ones from electrochemical oscillators shows its capability for precise detection of defects in the connection matrix for small-size networks. Dependence of the methodology on the observational noise, the network size, the number of defects, and the data length is also examined.     

An analytic equation of state based on analytic mean-field potential approach and application to three phases of metallic Zirconium

The analytic mean-field approach (AMFP) was applied to study the thermodynamic properties of Zirconium (Zr). The analytic expressions for the Helmholtz free energy, internal energy and equation of state have been derived. The formalism for the case of the Morse potential is used in this work. The four potential parameters are determined by fitting the molar volume of the three phases of Zr. The calculated molar volume of α, β and ω Zr are in fairly good agreement with the available experimental data. The results presented in this paper verify that the AMFP is a useful approach to study the thermodynamic properties of Zr. Furthermore, we predict the variation of the relationship of free energy and internal energy versus the molar volume at various temperatures and the dependence of the bulk modulus, the thermal expansion coefficient and the heat capacity on temperature at zero pressure of α, β and ω Zr.      

A matching-theoretic approach to resource allocation in D2D-enabled downlink NOMA cellular networks

This paper investigates the resource allocation problem in non-orthogonal multiple-access (NOMA) cellular networks underlaid with OMA-based device-to-device (D2D) communication. This network architecture enjoys the intrinsic features of NOMA and D2D communications; namely, spectral efficiency, massive connectivity, and low-latency. Despite these indispensable features, the combination of NOMA and D2D communications exacerbates the resource allocation problem in cellular networks due to the tight coupling among their constraints and conflict over access to shared resources. The aim of our work is to maximize the downlink network sum-rate, while meeting the minimum rate requirements of the cellular tier and underlay D2D communication, and incorporating interference management as well as other practical constraints. To this end, many-to-many matching and difference-of-convex programming are employed to develop a holistic sub-channels and power allocation algorithmic solution. In addition to analyzing the properties of the proposed solution, its performance is benchmarked against an existing solution and the traditional OMA-based algorithm. The proposed solution demonstrates superiority in terms of network sum-rate, users’ connectivity, minimum rate satisfaction, fairness, and interference management, while maintaining acceptable computational complexity.     

Artificial neural networks applied to the analysis of synchrotron nuclear resonant scattering data

The capabilities of artificial neural networks (ANNs) have been investigated for the analysis of nuclear resonant scattering (NRS) data obtained at a synchrotron source. The major advantage of ANNs over conventional analysis methods is that, after an initial training phase, the analysis is fully automatic and practically instantaneous, which allows for a direct intervention of the experimentalist on‐site. This is particularly interesting for NRS experiments, where large amounts of data are obtained in very short time intervals and where the conventional analysis method may become quite time‐consuming and complicated. To test the capability of ANNs for the automation of the NRS data analysis, a neural network was trained and applied to the specific case of an Fe/Cr multilayer. It was shown how the hyperfine field parameters of the system could be extracted from the experimental NRS spectra. The reliability and accuracy of the ANN was verified by comparing the output of the network with the results obtained by conventional data analysis.     

Real-time determination of fringe pattern frequencies: An application to pressure measurement

Retrieving information in real time from fringe patterns is a topic of a great deal of interest in scientific and engineering applications of optical methods. This paper presents a method for fringe frequency determination based on the capability of neural networks to recognize signals that are similar but not identical to signals used to train the neural network. Sampled patterns are generated by calibration and stored in memory. Incoming patterns are analyzed by a back-propagation neural network at the speed of the recording device, a CCD camera. This method of information retrieval is utilized to measure pressures on a boundary layer flow. The sensor combines optics and electronics to analyze dynamic pressure distributions and to feed information to a control system that is capable to preserve the stability of the flow.     

Cluster synchronization in the adaptive complex dynamical networks via a novel approach

This Letter investigates cluster synchronization in the adaptive complex dynamical networks with nonidentical nodes by a local control method and a novel adaptive strategy for the coupling strengths of the networks. In this approach, the coupling strength of each node adjusts adaptively only based on the state information of its neighborhood. By means of the proposed scheme, the sufficient conditions for achieving cluster synchronization are derived analytically by utilizing Lyapunov stability theory. It is demonstrated that the synchronization performance is sensitively affected by the control gain, the inner-coupling matrix and the network topological structure. The numerical simulations are performed to verify the effectiveness of the theoretical results.     

Weighted networks of scientific communication: the measurement and topological role of weight

In order to take the weight of connection into consideration and to find a natural measurement of weight, we have collected papers in Econophysics and constructed a network of scientific communication to integrate idea transportation among econophysicists by collaboration, citation and personal discussion. Some basic statistics such as weight per degree are discussed in Fan et al. J. Mod. Phys. B (17–19) (2004) 2505. In this paper, by including the papers published recently, further statistical results for the network are reported. Clustering coefficient of weighted networks is introduced and empirically studied in this network. We also compare the typical statistics on this network under different weight assignments, including random and inverse weight. The conclusion from weight-redistributed network is helpful to the investigation of the topological role of weight.