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.

Theoretical and experimental investigation of framed structure-layered soil interaction problems

The plane stress solution for the interaction analysis of a framed structure, with a foundation beam, resting on a layered soil has been studied using both theoretical and photoelastic methods. The theoretical analysis has been done by using a combined analytical and finite element method. In this, the analytical solution has been used for the semi-infinite layered medium and finite element method for the framed structure. The experimental investigation has been carried out using two-dimensional photoelasticity in which modelling of the layered semi-infinite plane and a method to obtain contact pressure distribution have been discussed. The theoretical and experimental results in respect of contact pressure distribution between the foundation beam and layered soil medium, the fibre stresses in the foundation beam and framed structure have been compared. These results have also been compared with theoretical results obtained by idealizing the layered semi-infinite plane as (a) a Winkler model and (b) an equivalent homogeneous semi-infinite medium

A general procedure for modified crack closure integral in 3D problems with cracks

In linear elastic fracture mechanics (LEFM), Irwin's crack closure integral (CCI) is one of the signficant concepts for the estimation of strain energy release rates (SERR) G, in individual as well as mixed-mode configurations. For effective utilization of this concept in conjunction with the finite element method (FEM), Rybicki and Kanninen [Engng Fracture Mech. 9, 931 938 (1977)] have proposed simple and direct estimations of the CCI in terms of nodal forces and displacements in the elements forming the crack tip from a single finite element analysis instead of the conventional two configuration analyses. These modified CCI (MCCI) expressions are basically element dependent. A systematic derivation of these expressions using element stress and displacement distributions is required. In the present work, a general procedure is given for the derivation of MCCI expressions in 3D problems with cracks. Further, a concept of sub-area integration is proposed which facilitates evaluation of SERR at a large number of points along the crack front without refining the finite element mesh. Numerical data are presented for two standard problems, a thick centre-cracked tension specimen and a semi-elliptical surface crack in a thick slab. Estimates for the stress intensity factor based on MCCI expressions corresponding to eight-noded brick elements are obtained and compared with available results in the literature.

Modified Crack Closure Integral (MCCI) For 3-D Problems Using 20-Noded Brick Elements

The Modified Crack Closure Integral (MCCI) technique based on Irwin's crack closure integral concept is very effective for estimation of strain energy release rates G in individual as well as mixed-mode configurations in linear elastic fracture mechanics problems. In a finite element approach, MCCI can be evaluated in the post-processing stage in terms of nodal forces and displacements near the crack tip. The MCCI expressions are however, element dependent and require a systematic derivation using stress and displacement distributions in the crack tip elements. Earlier a general procedure was proposed by the present authors for the derivation of MCCI expressions for 3-dimensional (3-d) crack problems modelled with 8-noded brick elements. A concept of sub-area integration was proposed to estimate strain energy release rates at a large number of points along the crack front. In the present paper a similar procedure is adopted for the derivation of MCCI expressions for 3-d cracks modelled with 20-noded brick elements. Numerical results are presented for centre crack tension and edge crack shear specimens in thick slabs, showing a comparison between present results and those available in the literature.

Contraceptive vaccines: current status and problems in mass application

Progress in the development of contraceptive vaccines for males and females is reviewed. Based on the criteria which need to be met with, none of the proposed candidate antigens meets the requirements for use as a contraceptive vaccine for human application. One of the major problems is the need for periodic injections to maintain required titre and use of an alternate method until effective titres are obtained. Some of the problems associated with active immunization approach can be overcome by the use of preformed, highly specific, potent antibodies. Some progress has been achieved in this direction by the use of humanized single chain monoclonal antibodies to human chorionic gonadotropin.

Modified crack closure integral (MCCI) for 3-d problems using 20 noded brick elememnts

The Modified Crack Closure Integral (MCCI) technique based on Irwin's crack closure integral concept is very effective for estimation of strain energy release rates G in individual as well as mixed-mode configurations in linear elastic fracture mechanics problems. In a finite element approach, MCCI can be evaluated in the post-processing stage in terms of nodal forces and displacements near the crack tip. The MCCI expressions are however, element dependent and require a systematic derivation using stress and displacement distributions in the crack tip elements. Earlier a general procedure was proposed by the present authors for the derivation of MCCI expressions for 3-dimensional (3-d) crack problems modelled with 8-noded brick elements. A concept of sub-area integration was proposed to estimate strain energy release rates at a large number of points along the crack front. In the present paper a similar procedure is adopted for the derivation of MCCI expressions for 3-d cracks modelled with 20-noded brick elements. Numerical results are presented for centre crack tension and edge crack shear specimens in thick slabs, showing a comparison between present results and those available in the literature.

Role of multicritical points in addressing some key problems concerning condensed matter science

We illustrate the potential of using higher order critical points in the deeper understanding of several interesting problems of condensed matter science, e.g. critical adsorption, finite size effects, morphology of critical fluctuations, reversible aggregation of colloids, dynamics of the ordering process, etc.

Clan-based evolutionary approach for solving control problems

This paper presents a dan-based evolutionary approach for solving control problems. Three selected control problems, viz. linear-quadratic, harvest, and push-cart problems, are solved using the proposed approach. Results are compared with those of the evolutionary programming (EP) approach. In most of the cases, the proposed approach is successful in obtaining (near) optimal solutions for these selected problems.

Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs

A claw is an induced subgraph isomorphic to K-1,K-3. The claw-point is the point of degree 3 in a claw. A graph is called p-claw-free when no p-cycle has a claw-point on it. It is proved that for p greater than or equal to 4, p-claw-free graphs containing at least one chordless p-cycle are edge reconstructible. It is also proved that chordal graphs are edge reconstructible. These two results together imply the edge reconstructibility of claw-free graphs. A simple proof of vertex reconstructibility of P-4-reducible graphs is also presented. (C) 1995 John Wiley and Sons, Inc.

Problems and prospects of red mud utilisation

A general survey is presented on the generation and characteristics of Red Muds. The interrelationship between Mud properties, their disposal and utilisation is emphasised. After an outline on the possible applications for Red Muds, the problems related to important (potential) uses have been pointed out. Suggestions have been incorporated on what needs to be done to promote the utilisation of Red Muds particularly in the Indian context.

Achieving sustainable transportation system for Indian cities - problems and issues

This article aims at identifying the research issues and challenges that need to be addressed to achieve sustainable transportation system for Indian cities. The same is achieved by understanding the current system and trends of urbanization, motorization and modal shares in India; and their impact on mobility and safety (the two basic goals of transportation) as well as environment. Further, the article explores the efforts by the central and state governments in India to address the sustainability issues, and the problems and issues over and above the present efforts to achieve sustainability. The article concludes by summarizing the research issues with respect to planning/modelling, non-motorized transport, public transport, driver behaviour and road safety and traffic management. It is expected that these research issues will provide potential directions for carrying out further research aimed at achieving sustainable transport system for Indian cities.

Solving linear programming problems exactly

A linear programming problem in an inequality form having a bounded solution is solved error-free using an algorithm that sorts the inequalities, removes the redundant ones, and uses the p-adic arithmetic. (C) Elsevier Science Inc., 1997

Synthetic aperture radar: A focus on current problems

Synthetic aperture radar (SAR) is a powerful tool for mapping and remote sensing. The theory and operation of SAR have seen a period of intense activity in recent years. This paper attempts to review some of the more advanced topics studied in connection with modern SAR systems based on digital processing. Following a brief review of the principles involved in the operation of SAR, attention is focussed on special topics such as advanced SAR modelling and focussing techniques, in particular clutterlock and autofocus, Doppler centroid (DC) estimation methods involving seismic migration technique, moving target imaging, bistatic radar imaging, effects of system nonlinearities, etc.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.