Static search games played over graphs and general metric spaces

We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a metric space. Each player simultaneously chooses to deploy at a point in the space; the searching player receiving a payoff of 1 if his opponent lies within a predetermined radius r of his position, the concealing player receiving a payoff of 1 otherwise. The concepts of dominance and equivalence of strategies are examined in the context of this game, before focusing on the more specific case of the game played over a graph. Methods are presented to simplify the analysis of such games, both by means of the iterated elimination of dominated strategies and through consideration of automorphisms of the graph. Lower and upper bounds on the value of the game are presented and optimal mixed strategies are calculated for games played over a particular family of graphs.     

Transition from fractal to non-fractal scalings in growing scale-free networks

Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter q. We obtain the topological properties of the network including the degree distribution, average path length, diameter, fractal dimensions, and betweenness centrality distribution, which are controlled by parameter q. Interestingly, we show that by adjusting q, the networks undergo a transition from fractal to non-fractal scalings, and exhibit a crossover from ‘large’ to small worlds at the same time. Our research may shed some light on understanding the evolution and relationships of fractal and non-fractal networks.     

Topologies and Laplacian spectra of a deterministic uniform recursive tree

The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characteristics of the deterministic tree. The obtained vigorous results show that the network has an exponential degree distribution, small average path length, power-law distribution of node betweenness, and positive degree-degree correlations. Then we determine the complete Laplacian spectra (eigenvalues) and their corresponding eigenvectors of the considered graph. Interestingly, all the Laplacian eigenvalues are distinct.     

Clusters in weighted macroeconomic networks: the EU case. Introducing the overlapping index of GDP/capita fluctuation correlations

GDP/capita correlations are investigated in various time windows (TW), for the time interval 1990–2005. The target group of countries is the set of 25 EU members, 15 till 2004 plus the 10 countries which joined EU later on. The TW-means of the statistical correlation coefficients are taken as the weights (links) of a fully connected network having the countries as nodes. Thereafter we define and introduce the overlapping index of weighted network nodes. A cluster structure of EU countries is derived from the statistically relevant eigenvalues and eigenvectors of the adjacency matrix. This may be considered to yield some information about the structure, stability and evolution of the EU country clusters in a macroeconomic sense.     

Random Sierpinski network with scale-free small-world and modular structure

In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our network representation method could be applied to study the complexity of some real systems in biological and information fields.     

Failure Impact,Availability and Cost Analysis of PONs Based on a Network Geometric Model

Passive Optical Networks(PONs)are considered as the preferred solution for broadband fibre-based access networks.This is because PONs present low cost deployment,low energy consumption and also meet high bandwidth demands from end users.In addition,end users expect a high availability for access networks,while operators are more concerned about reducing the failure impact(number of clients affected by failures).Moreover,operators are also interested in reducing the cost of the access network.This paper provides a deep insight into the consequences that the physical topology and design decisions cause on the availability,the failure impact and the cost of a PON.In order to do that,the physical layout of the PON deployment area is approximated by a network geometric model.A PON deployed according to the geometric model is then assessed in terms of failure impact,availability and cost.This way,the effects of different design decisions and the physical layout on these three parameters are evaluated.In addition,the tradeoffs between availability,failure impact and cost caused by planning decisions and the physical topology are identified and pinpointed.     

Information spreading in Delay Tolerant Networks based on nodes’ behaviors

Information spreading in DTNs (Delay Tolerant Networks) adopts a store–carry–forward method, and nodes receive the message from others directly. However, it is hard to judge whether the information is safe in this communication mode. In this case, a node may observe other nodes’ behaviors. At present, there is no theoretical model to describe the varying rule of the nodes’ trusting level. In addition, due to the uncertainty of the connectivity in DTN, a node is hard to get the global state of the network. Therefore, a rational model about the node’s trusting level should be a function of the node’s own observing result. For example, if a node finds k nodes carrying a message, it may trust the information with probability p(k). This paper does not explore the real distribution of p(k), but instead presents a unifying theoretical framework to evaluate the performance of the information spreading in above case. This framework is an extension of the traditional SI (susceptible-infected) model, and is useful when p(k) conforms to any distribution. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Finally, we explore the impact of the nodes’ behaviors based on certain special distributions through numerical results.     

Hydrogen Bond Networks Stabilized High-Capacity Organic Cathode for Lithium-Ion Batteries

High-capacity small organic materials are plagued by their high solubility. Here we proposed constructing hydrogen bond networks (HBN) via intermolecular hydrogen bonds to suppress the solubility of active material. The illustrated 2, 7- diamino-4, 5, 9, 10-tetraone (PTO-NH₂) molecule with intermolecular hydrogen (H) bond between O in −C=O and H in −NH₂, which make PTO-NH₂ presents transverse two-dimensional extension and longitudinal π–π stacking structure. In situ Fourier transform infrared spectroscopy (FTIR) has tracked the reversible evolution of H-bonds, further confirming the existence of HBN structure can stabilize the intermediate 2-electron reaction state. Therefore, PTO-NH₂ with HBN structure has higher active site utilization (95 %), better cycle stability and rate performance. This study uncovers the H-bond effect and evolution during the electrochemical process and provides a strategy for materials design.     

Oxidation and Reduction Pathways in the Knowles Hydroamination via a Photoredox-Catalyzed Radical Reaction**

Systematic reaction path exploration revealed the entire mechanism of Knowles's light-promoted catalytic intramolecular hydroamination. Bond formation/cleavage competes with single electron transfer (SET) between the catalyst and substrate. These processes are described by adiabatic processes through transition states in an electronic state and non-radiative transitions through the seam of crossings (SX) between different electronic states. This study determined the energetically favorable SET path by introducing a practical computational model representing SET as non-adiabatic transitions via SXs between substrate's potential energy surfaces for different charge states adjusted based on the catalyst's redox potential. Calculations showed that the reduction and proton shuttle process proceeded concertedly. Also, the relative importance of SET paths (giving the product and leading back to the reactant) varies depending on the catalyst's redox potential, affecting the yield.