The role of sustainable agriculture and renewable-resource management in reducing greenhouse-gas emissions and increasing sinks in China and India

This paper contains an analysis of the technical options in agriculture for reducing greenhouse-gas emissions and increasing sinks, arising from three distinct mechanisms: (i) increasing carbon sinks in soil organic matter and above-ground biomass; (ii) avoiding carbon emissions from farms by reducing direct and indirect energy use; and (iii) increasing renewable-energy production from biomass that either substitutes for consumption of fossil fuels or replaces inefficient burning of fuelwood or crop residues, and so avoids carbon emissions, together with use of biogas digesters and improved cookstoves. We then review best-practice sustainable agriculture and renewable-resource-management projects and initiatives in China and India, and analyse the annual net sinks being created by these projects, and the potential market value of the carbon sequestered. We conclude with a summary of the policy and institutional conditions and reforms required for adoption of best sustainability practice in the agricultural sector to achieve the desired reductions in emissions and increases in sinks. A review of 40 sustainable agriculture and renewable-resource-management projects in China and India under the three mechanisms estimated a carbon mitigation potential of 64.8 MtC yr(-1) from 5.5 Mha. The potential income for carbon mitigation is $324 million at $5 per tonne of carbon. The potential exists to increase this by orders of magnitude, and so contribute significantly to greenhouse-gas abatement. Most agricultural mitigation options also provide several ancillary benefits. However, there are many technical, financial, policy, legal and institutional barriers to overcome.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.