Sustaining cooperation on networks: an analytical study based on evolutionary game theory

We analytically study the role played by the network topology in sustaining cooperation in a society of myopic agents in an evolutionary setting. In our model, each agent plays the Prisoner's Dilemma (PD) game with its neighbors, as specified by a network. Cooperation is the incumbent strategy, whereas defectors are the mutants. Starting with a population of cooperators, some agents are switched to defection. The agents then play the PD game with their neighbors and compute their fitness. After this, an evolutionary rule, or imitation dynamic is used to update the agent strategy. A defector switches back to cooperation if it has a cooperator neighbor with higher fitness. The network is said to sustain cooperation if almost all defectors switch to cooperation. Earlier work on the sustenance of cooperation has largely consisted of simulation studies, and we seek to complement this body of work by providing analytical insight for the same. We find that in order to sustain cooperation, a network should satisfy some properties such as small average diameter, densification, and irregularity. Real-world networks have been empirically shown to exhibit these properties, and are thus candidates for the sustenance of cooperation. We also analyze some specific graphs to determine whether or not they sustain cooperation. In particular, we find that scale-free graphs belonging to a certain family sustain cooperation, whereas Erdos-Renyi random graphs do not. To the best of our knowledge, ours is the first analytical attempt to determine which networks sustain cooperation in a population of myopic agents in an evolutionary setting.

Glioblastoma-Specific Protein Interaction Network Identifies PP1A and CSK21 as Connecting Molecules between Cell Cycle-Associated Genes

Glioblastoma (GBM; grade IV astrocytoma) is a very aggressive form of brain cancer with a poor survival and few qualified predictive markers. This study integrates experimentally validated genes that showed specific upregulation in GBM along with their protein-protein interaction information. A system level analysis was used to construct GBM-specific network. Computation of topological parameters of networks showed scale-free pattern and hierarchical organization. From the large network involving 1,447 proteins, we synthesized subnetworks and annotated them with highly enriched biological processes. A careful dissection of the functional modules, important nodes, and their connections identified two novel intermediary molecules CSK21 and protein phosphatase 1 alpha (PP1A) connecting the two subnetworks CDC2-PTEN-TOP2A-CAV1-P53 and CDC2-CAV1-RB-P53-PTEN, respectively. Real-time quantitative reverse transcription-PCR analysis revealed CSK21 to be moderately upregulated and PP1A to be overexpressed by 20-fold in GBM tumor samples. Immunohistochemical staining revealed nuclear expression of PP1A only in GBM samples. Thus, CSK21 and PP1A, whose functions are intimately associated with cell cycle regulation, might play key role in gliomagenesis. Cancer Res; 70(16); 6437-47. (C)2010 AACR.

Percolation on networks with antagonistic and dependent interactions

Drawing inspiration from real world interacting systems, we study a system consisting of two networks that exhibit antagonistic and dependent interactions. By antagonistic and dependent interactions we mean that a proportion of functional nodes in a network cause failure of nodes in the other, while failure of nodes in the other results in failure of links in the first. In contrast to interdependent networks, which can exhibit first-order phase transitions, we find that the phase transitions in such networks are continuous. Our analysis shows that, compared to an isolated network, the system is more robust against random attacks. Surprisingly, we observe a region in the parameter space where the giant connected components of both networks start oscillating. Furthermore, we find that for Erdos-Renyi and scale-free networks the system oscillates only when the dependence and antagonism between the two networks are very high. We believe that this study can further our understanding of real world interacting systems.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Conductivity Scale In Disordered-Systems

A reanalysis of the correction to the Boltzmann conductivity due to maximally crossed graphs for degenerate bands explains why the conductivity scale in many-valley semiconductors is an order of magnitude higher than Mott's "minimum metallic conductivity." With the use of a reasonable assumption for the Boltzmann mean free path, the lowest-order perturbation theory is seen to give a remarkably good, semiquantitative, description of the conductivity variation in both uncompensated doped semiconductors and amorphous alloys.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

On The Topology Of Manifolds With Positive Isotropic Curvature

We show that a closed orientable Riemannian n-manifold, n >= 5, with positive isotropic curvature and free fundamental group is homeomorphic to the connected sum of copies of Sn-1 x S-1.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Highly Luminescent Mn-Doped ZnS Nanocrystals: Gram-Scale Synthesis

Following growth doping technique highly luminescent (quantum yield >50%) Mn-doped ZnS nanocrystals are synthesized via colloidal synthetictechnique. The dopant emission has been optimized with varying reaction parameters and found the ratio of Zn and S as well as the percentage of introduced dopant in the reaction mixture are key factors for controlling the intensity. The method is simple, hassle free, and can be scalable to gram level without hindering the quality of nanocrystals. These nanocrystals retain their emission during various ligand exchange processes and aqueous dispersion.

PIV studies of large scale structures in the near field of small aspect ratio elliptic jets

The near flow field of small aspect ratio elliptic turbulent free jets (issuing from nozzle and orifice) was experimentally studied using a 2D PIV. Two point velocity correlations in these jets revealed the extent and orientation of the large scale structures in the major and minor planes. The spatial filtering of the instantaneous velocity field using Gaussian convolution kernel shows that while a single large vortex ring circumscribing the jet seems to be present at the exit of nozzle, the orifice jet exhibited a number of smaller vortex ring pairs close to jet exit. The smaller length scale observed in the case of the orifice jet is representative of the smaller azimuthal vortex rings that generate axial vortex field as they are convected. This results in the axis-switching in the case of orifice jet and may have a mechanism different from the self induction process as observed in the case of contoured nozzle jet flow.

A singularity-free cosmological model in ECSK theory

In the framework of the ECSK [Einstein-Cartan-Sciama-Kibble] theory of cosmology, a scalar field nonminimally coupled to the gravitational field is considered. For a Robertson-Walker open universe (k=0) in the radiation era, the field equations admit a singularity-free solution for the scale factor. In theory, the torsion is generated through nonminimal coupling of a scalar field to the gravitation field. The nonsingular nature of the cosmological model automatically solves the flatness problem. Further absence of event horizon and particle horizon explains the high degree of isotropy, especially of 2.7-K background radiation.

Time scales for transitions between free-energy minima of a dense hard-sphere system

Time scales associated with activated transitions between glassy metastable states of a free-energy functional appropriate for a dense hard-sphere system are calculated by using a new Monte Carlo method for the local density variables. In particular, we calculate the time the system, initially placed in a shallow glassy minimum of the free-energy, spends in the neighborhood of this minimum before making a transition to the basin of attraction of another free-energy minimum. This time scale is found to increase as the average density is increased. We find a crossover density near which this time scale increases very sharply and becomes longer than the longest times accessible in our simulation. This time scale does not show any evidence of increasing with sample size

Turbulent free convection above a heated plate inclined at a small angle to the horizontal Journal

An investigation has been made of the structure of the motion above a heated plate inclined at a small angle (about 10°) to the horizontal. The turbulence is considered in terms of the similarities to and differences from the motion above an exactly horizontal surface. One effect of inclination is, of course, that there is also a mean motion. Accurate data on the mean temperature field and the intensity of the temperature fluctuations have been obtained with platinum resistance thermometers, the signals being processed electronically. More approximate information on the velocity field has been obtained with quartz fibre anemometers. These results have been supplemented qualitatively by simultaneous observations of the temperature and velocity fluctuations and also by smoke experiments. The principal features of the flow inferred from these observations are as follows. The heat transfer and the mean temperature field are not much altered by the inclination, though small, not very systematic, variations may result from the complexities of the velocity field. This supports the view that the mean temperature field is largely governed by the large-scale motions. The temperature fluctuations show a systematic variation with distance from the lower edge and resemble those above a horizontal plate when this distance is large. The largescale motions of the turbulence start close to the lower edge, but the smaller eddies do not attain full intensity until the air has moved some distance up the plate. The mean velocity receives a sizable contribution from a ‘through-flow’ between the side-walls. Superimposed on this are developments that show that the momentum transfer processes are complex and certainly not capable of representation by any simple theory such as an eddy viscosity. On the lower part of the plate there is surprisingly large acceleration, but further up the mixing action of the small eddies has a decelerating effect.

Cojoined Irregular Topology and Routing Table Generation for Network-on-Chip

Scalable Networks on Chips (NoCs) are needed to match the ever-increasing communication demands of large-scale Multi-Processor Systems-on-chip (MPSoCs) for multi media communication applications. The heterogeneous nature of application specific on-chip cores along with the specific communication requirements among the cores calls for the design of application-specific NoCs for improved performance in terms of communication energy, latency, and throughput. In this work, we propose a methodology for the design of customized irregular networks-on-chip. The proposed method exploits a priori knowledge of the applications communication characteristic to generate an optimized network topology and corresponding routing tables.

Automatic extraction of free-form surface features (FFSFs)

This paper presents a new algorithm for extracting Free-Form Surface Features (FFSFs) from a surface model. The extraction algorithm is based on a modified taxonomy of FFSFs from that proposed in the literature. A new classification scheme has been proposed for FFSFs to enable their representation and extraction. The paper proposes a separating curve as a signature of FFSFs in a surface model. FFSFs are classified based on the characteristics of the separating curve (number and type) and the influence region (the region enclosed by the separating curve). A method to extract these entities is presented. The algorithm has been implemented and tested for various free-form surface features on different types of free-form surfaces (base surfaces) and is found to correctly identify and represent the features irrespective of the type of underlying surface. The representation and extraction algorithm are both based on topology and geometry. The algorithm is data-driven and does not use any pre-defined templates. The definition presented for a feature is unambiguous and application independent. The proposed classification of FFSFs can be used to develop an ontology to determine semantic equivalences for the feature to be exchanged, mapped and used across PLM applications. (C) 2011 Elsevier Ltd. All rights reserved.