Economic small-world behavior in weighted networks

The small-world phenomenon has been already the subject of a huge variety of papers, showing its appeareance in a variety of systems. However, some big holes still remain to be filled, as the commonly adopted mathematical formulation is valid only for topological networks. In this paper we propose a generalization of the theory of small worlds based on two leading concepts, efficiency and cost, and valid also for weighted networks. Efficiency measures how well information propagates over the network, and cost measures how expensive it is to build a network. The combination of these factors leads us to introduce the concept of economic small worlds, that formalizes the idea of networks that are “cheap” to build, and nevertheless efficient in propagating information, both at global and local scale. In this way we provide an adequate tool to quantitatively analyze the behaviour of complex networks in the real world. Various complex systems are studied, ranging from the realm of neural networks, to social sciences, to communication and transportation networks. In each case, economic small worlds are found. Moreover, using the economic small-world framework, the construction principles of these networks can be quantitatively analyzed and compared, giving good insights on how efficiency and economy principles combine up to shape all these systems. Received 6 November 2002 / Received in final form 24 January 2003 Published online 1st April 2003 RID="a" ID="a"e-mail: latora@ct.infn.it     

Efficiency and robustness in ant networks of galleries

Recent theoretical and empirical studies have focused on the topology of large networks of communication/interactions in biological, social and technological systems. Most of them have been studied in the scope of the small-world and scale-free networks theory. Here we analyze the characteristics of ant networks of galleries produced in a 2-D experimental setup. These networks are neither small-worlds nor scale-free networks and belong to a particular class of network, i.e. embedded planar graphs emerging from a distributed growth mechanism. We compare the networks of galleries with both minimal spanning trees and greedy triangulations. We show that the networks of galleries have a path system efficiency and robustness to disconnections closer to the one observed in triangulated networks though their cost is closer to the one of a tree. These networks may have been prevented to evolve toward the classes of small-world and scale-free networks because of the strong spatial constraints under which they grow, but they may share with many real networks a similar trend to result from a balance of constraints leading them to achieve both path system efficiency and robustness at low cost.Received: 16 July 2004, Published online: 26 November 2004PACS: 89.75.Fb Structures and organization in complex systems - 89.75.Hc Networks and genealogical trees - 87.23.Ge Dynamics of social systems     

Naming game on small-world networks with geographical effects

The naming game model characterizes the main evolutionary features of languages or more generally of communication systems. Very recently, the combination of complex networks and the naming game has received much attention and the influences of various topological properties on the corresponding dynamical behavior have been widely studied. In this paper, we investigate the naming game on small-world geographical networks. The small-world geographical networks are constructed by randomly adding links to two-dimensional regular lattices, and it is found that the convergence time is a nonmonotonic function of the geographical distance of randomly added shortcuts. This phenomenon indicates that, although a long geographical distance of the added shortcuts favors consensus achievement, too long a geographical distance of the added shortcuts inhibits the convergence process, making it even slower than the moderates.     

Evolutionary ultimatum game on complex networks under incomplete information

This paper studies the evolutionary ultimatum game on networks when agents have incomplete information about the strategies of their neighborhood agents. Our model assumes that agents may initially display low fairness behavior, and therefore, may have to learn and develop their own strategies in this unknown environment. The Genetic Algorithm Learning Classifier System (GALCS) is used in the model as the agent strategy learning rule. Aside from the Watts-Strogatz (WS) small-world network and its variations, the present paper also extends the spatial ultimatum game to the Barabási-Albert (BA) scale-free network. Simulation results show that the fairness level achieved is lower than in situations where agents have complete information about other agents’ strategies. The research results display that fairness behavior will always emerge regardless of the distribution of the initial strategies. If the strategies are randomly distributed on the network, then the long-term agent fairness levels achieved are very close given unchanged learning parameters. Neighborhood size also has little effect on the fairness level attained. The simulation results also imply that WS small-world and BA scale-free networks have different effects on the spatial ultimatum game. In ultimatum game on networks with incomplete information, the WS small-world network and its variations favor the emergence of fairness behavior slightly more than the BA network where agents are heterogeneously structured.     

Spectral determinant on graphs with generalized boundary conditions

The spectral determinant of the Schr?dinger operator ( - Δ + V(x)) on a graph is computed for general boundary conditions. (Δ is the Laplacian and V(x) is some potential defined on the graph). Applications to restricted random walks on graphs are discussed. Received 9 July 2001     

Randomness Effect on Cooperation in Memory-Based Snowdrift Game

A memory-based snowdrift game (MBSG) on spatial small-world networks is investigated. It is found that cooperation rate versus temptation shows some step structures on small-world networks, similar to the case on regular lattices. With the increment of rewiring probability based on four-neighbourregular lattices, more steps are observable. Interestingly, it is observed that cooperation rate peaks at a specific value of temptation, which indicates that properly encouraging selfish actions may lead to better cooperative behaviours in the MBSG on small-world networks. Memory effects are also discussed for different rewiring probabilities. Furthermore, optimal regions arefound in the parameter planes. The strategy-related average degrees of individuals are helpful to understand the obtained results.     

On the theory of light scattering in molecular liquids

The theory of light scattering for a system of linear molecules with anisotropic polarizabilities is considered. As a starting point for our theory, we express the result of a scattering experiment in VV and VH symmetry as dynamic correlation functions of tensorial densities ρ _lm(q) with l = 0 and l = 2. l, m denote indices of spherical harmonics. To account for all observed hydrodynamic singularities, a generalization of the theory of Schilling and Scheidsteger [1] for these correlation functions is presented, which is capable to describe the light scattering experiments from the liquid regime to the glassy state. As a microscopic theory it fulfills all sum rules contrary to previous phenomenological theories. We emphasize the importance of the helicity index m for the microscopic theory by showing, that only the existence of m = 1 components lead to the well known Rytov dip in liquids and to the appearance of transversal sound waves in VH symmetry in the deeply supercooled liquid and the glass. Exact expressions for the phenomenological frequency dependent rotation translation coupling coefficients of previous theories are derived. Received 3 July 2000 and Received in final form 7 November 2000     

基于鹰鸽量子博弈理论评价科研院所的科技自主创新能力

科研院所的科技自主创新能力是推动国家科技进步和经济发展,应对国际经济危机的主要动力,创建科学、完善的科技创新能力评价方法有助于提升科研院所科技创新能力,并为国家制定科技创新决策提供参考依据。本文基于鹰鸽量子博弈理论,提出了一种评价科研院所自主创新能力的方法。介绍了量子博弈论的各基本要素在科技自主创新体系中所对应的物理内涵,根据鹰鸽量子博弈理论建立了科技自主创新能力评价模型,分析了纠缠度与收益矩阵之间的关系,确立了依靠各参与者在鹰鸽量子博弈中的纠缠度来表征科技自主创新能力的方法。给出了科研院所科技自主创新能力的量子博弈论解释,构建了科技自主创新能力评价指标体系,并确定了评价的合成计算方法,即量子纠缠度的计算方法。最后,以中科院部分研究所为实例进行了科技自主创新能力的评价,并利用主成份分析法和中物院的简单统计方法对得到的数据进行了对比分析,结果证明了提出的方法合理且有可操作性。     

Excited states of Ne isoelectronic ions: SAC-CI study

Excited states of the s, p, and d symmetries up to principal quantum number n = 4 are studied for the first eight members of Ne isoelectronic sequence (Ne to Cl⁷⁺) by the SAC-CI (symmetry-adapted-cluster configuration-interaction) method. The valence STO basis sets of Clementi et al. and the optimized excited STO are used by the STO-6G expansion method. The calculated transition energies agree well with the experimental values wherever available. Received 26 July 2000 and Received in final form 14 September 2000     

Cooperative dynamics of snowdrift game on spatial distance-dependent small-world networks

We investigate the evolution of cooperative behaviors of small-world networking agents in a snowdrift game mode, where two agents (nodes) are connected with probability depending on their spatial Euclidean lattice distance in the power-law form controlled by an exponent α. Extensive numerical simulations indicate that the game dynamics crucially depends on the spatial topological structure of underlying networks with different values of the exponent α. Especially, in the distance-independent case of α=0, the small-world connectivity pattern contributes to an enhancement of cooperation compared with that in regular lattices, even for the case of having a high cost-to-benefit ratio r. However, with the increment of α>0, when r≥0.4, the spatial distance-dependent small-world (SDSW) structure tends to inhibit the evolution of cooperation in the snowdrift game.     

Studies of the exactly dimerized bilayer Heisenberg model via strong coupling expansions

The one-triplet excitation spectra and thermodynamic properties for the dimerized phase of the frustrated bilayer Heisenberg model are studied using strong-coupling expansion theory. The model has an exact dimerized ground state as well as exact one-triplet excitations in a special case that the frustration J₂ is equal to the in-plane coupling J₁. We demonstrate that the models with and without frustrations have distinct excitation spectra, so their thermodynamic properties exhibit quite different behaviors. Especially, the low-temperature behaviors of the frustrated model with J ₁=J ₂ are independent of the inter-dimer couplings, due to the exact one-triplet excitations. Received 16 March 2000 and Received in final form 2 July 2000     

The statistical mechanics of turbo codes

The “turbo codes”, recently proposed by Berrou et al. [1] are written as a disordered spin Hamiltonian. It is shown that there exists a threshold such that for signal to noise ratios the error probability per bit vanishes in the thermodynamic limit, i.e. the limit of infinitely long sequences. The value of the threshold has been computed for two particular turbo codes. It is found that it depends on the code. These results are compared with numerical simulations. Received 14 March 2000 and Received in final form 17 July 2000     

Synchronization of coupled oscillators on small-world networks

We investigate the synchronous dynamics of Kuramoto oscillators and van der Pol oscillators on Watts-Strogatz type small-world networks. The order parameters to characterize macroscopic synchronization are calculated by numerical integration. We focus on the difference between frequency synchronization and phase synchronization. In both oscillator systems, the critical coupling strength of the phase order is larger than that of the frequency order for the small-world networks. The critical coupling strength for the phase and frequency synchronization diverges as the network structure approaches the regular one. For the Kuramoto oscillators, the behavior can be described by a power-law function and the exponents are obtained for the two synchronizations. The separation of the critical point between the phase and frequency synchronizations is found only for small-world networks in the theoretical models studied.     

Evidence of critical fluctuations from the magnetoconductivity data in Bi2Sr2Ca2Cu3O10+x phase

The fluctuation-induced magnetoconductivity of the Bi₂Sr₂Ca₂Cu₃O_10+x phase is studied above zero-field critical temperature Tc(0) and for moderate magnetic fields. It is found that the Gaussian approximation for superconducting fluctuations underestimates the negative fluctuation magnetoconductance drastically in the Tc(0) < T < Tc(0) + 20 K temperature range. Taking into account the critical fluctuation contribution on the base of self-consistent Hartree approximation makes it possible to explain the data quantitatively in terms of the only Aslamazov-Larkin contribution for different magnetic fields and temperatures, consistently with the zero field data. Received 14 April 2000 and Received in final form 13 July 2000     

From 2D hyperbolic forests to 3D Euclidean entangled thickets

A method is developed to construct and analyse a wide class of graphs embedded in Euclidean 3D space, including multiply-connected and entangled examples. The graphs are derived via embeddings of infinite families of trees (forests) in the hyperbolic plane, and subsequent folding into triply periodic minimal surfaces, including the P, D, gyroid and H surfaces. Some of these graphs are natural generalisations of bicontinuous topologies to bi-, tri-, quadra- and octa-continuous forms. Interwoven layer graphs and periodic sets of finite clusters also emerge from the algorithm. Many of the graphs are chiral. The generated graphs are compared with some organo-metallic molecular crystals with multiple frameworks and molecular mesophases found in copolymer melts. Received 10 December 1999     

Quantum decoherence from adiabatic entanglement with external one or a few degrees of freedom

Based on the Born-Oppenhemer approximation, the concept of adiabatic quantum entanglement is introduced to account for quantum decoherence of a quantum system due to its interaction with a large system of one or a few degrees of freedom. In the adiabatic limit, it is shown that the wave function of the total system formed by the quantum system plus the large system can be factorized as an entangled state with correlation between adiabatic quantum states and quasi-classical motion configurations of the large system. In association with a novel viewpoint about quantum measurement, which has been directly verified by most recent experiments [e.g., S. Durr et al., Nature 33, 359 (1998)], it is shown that the adiabatic entanglement is indeed responsible for the quantum decoherence and thus can be regarded as a “clean” quantum measurement when the large system behaves as a classical object. By taking the large system respectively to be a macroscopically distinguishable spatial variable, a high spin system and a harmonic oscillator with a coherent initial state, three illustrations are presented with their explicit solutions in this paper. Received 26 February 2000 and Received in final form 14 July 2000     

Monomer-dimer model on a scale-free small-world network

The explicit determination of the number of monomer-dimer arrangements on a network is a theoretical challenge, and exact solutions to monomer-dimer problem are available only for few limiting graphs with a single monomer on the boundary, e.g., rectangular lattice and quartic lattice; however, analytical research (even numerical result) for monomer-dimer problem on scale-free small-world networks is still missing despite the fact that a vast variety of real systems display simultaneously scale-free and small-world structures. In this paper, we address the monomer-dimer problem defined on a scale-free small-world network and obtain the exact formula for the number of all possible monomer-dimer arrangements on the network, based on which we also determine the asymptotic growth constant of the number of monomer-dimer arrangements in the network. We show that the obtained asymptotic growth constant is much less than its counterparts corresponding to two-dimensional lattice and Sierpinski fractal having the same average degree as the studied network, which indicates from another aspect that scale-free networks have a fundamentally distinct architecture as opposed to regular lattices and fractals without power-law behavior.     

Pseudogap effects on the c-axis charge dynamics in copper oxide materials

The c-axis charge dynamics of copper oxide materials in the underdoped and optimally doped regimes has been studied by considering the incoherent interlayer hopping. It is shown that the c-axis charge dynamics for the chain copper oxide materials is mainly governed by the scattering from the in-plane fluctuation, and the c-axis charge dynamics for the no-chain copper oxide materials is dominated by the scattering from the in-plane fluctuation incorporating with the interlayer disorder, which would be suppressed when the holon pseudogap opens at low temperatures and lower doping levels, leading to the crossovers to the semiconducting-like range in the c-axis resistivity and the temperature linear to the nonlinear range in the in-plane resistivity. Received 29 July 1999 and Received in final form 24 January 2000     

Phase behavior of three-component ionic fluids

We study the phase behavior of solutions consisting of positive and negative ions of valence z to which a third ionic species of valence Z>z is added. Using a discretized Debye-Hückel theory, we analyze the phase behavior of such systems for different values of the ratio . We find, for , a three-phase coexistence region and, for , a closed (reentrant) coexistence loop at high temperatures. We characterize the behavior of these ternary ionic mixtures as function of charge asymmetry and temperature, and show the complete phase diagrams for the experimentally relevant cases of and , corresponding to addition of divalent and trivalent ions to monovalent ionic fluids, respectively. Received 6 April 2000 and Received in final form 20 July 2000     

Scribing and cutting a blue LED wafer using a Q-switched. Nd:YAG laser

Chemical doping of single-wall carbon nanohorns (SWNHs) with K and Br was examined by vapor-phase reaction and studied by Raman scattering. Electro-chemical Li-ion doping using an electrolyte of LiAsF₆ in a mixture (1:1 by volume) of ethylene carbonate and diethyl carbonate was also carried out. All these experiments indicate that an anomalously small charge transfer occurs in saturation-doped SWNHs using these reagents, in sharp contrast to the behavior observed for single-wall carbon nanotube bundles and graphite. This rather remarkable result is not understood at present. Received: 13 July 2000 / Accepted: 14 July 2000 / Published online: 5 October 2000