Mining mechanism of top-k influential nodes based on voting algorithm in mobile social networks

In recent years, evaluating the influence of nodes and finding top-k influential nodes in social networks, has drawn a wide attention and has become a hot-pot research issue. Considering the characteristics of social networks, we present a novel mechanism to mine the top-k influential nodes in mobile social networks. The proposed mechanism is based on the behaviors analysis of SMS/MMS (simple messaging service / multimedia messaging service) communication between mobile users. We introduce the complex network theory to build a social relation graph, which is used to reveal the relationship among people's social contacts and messages sending. Moreover, intimacy degree is also introduced to characterize social frequency among nodes. Election mechanism is hired to find the most influential node, and then a heap sorting algorithm is used to sort the voting results to find the k most influential nodes. The experimental results show that the mechanism can finds out the most influential top-k nodes efficiently and effectively. © 2013 IEEE.

Are the popular users always important for information dissemination in online social networks?

This article verifies the importance of popular users in OSNs. The results are counter-intuitive. First, for dissemination speed, a large amount of users can swiftly distribute information to the masses, but they are not highly-connected users. Second, for dissemination scale, many powerful forwarders in OSNs cannot be identified by the degree measure. Furthermore, to control dissemination, popular users cannot capture most bridges of social communities.

Social network analysis and small group ‘dark’ networks: an analysis of the London bombers and the problem of ‘fuzzy’ boundaries

Social network analysis (SNA) is believed to be capable of revealing significant insights into crime and terror groups, including identifying important individuals and unique approaches to disruption. However, SNA has a number of theoretical and practical limitations, particularly when applied to ‘dark’ networks. While most analysts certainly acknowledge at least some of these limitations, we need to know more about their potential impact in a crime intelligence context. This article aims to go some way towards that end by placing greater scrutiny on the problem of ‘fuzzy boundaries’ when applied to small group networks. SNA is applied to the groups responsible for the 7 July 2005 London bombings and the 21 July 2005 attempted London bombings. The article concludes that while SNA is a valuable tool for understanding crime and terror groups, the age-old problem of fuzzy boundaries can have a profound impact on the analysis of small dynamic networks.

Urban social insurance and worker satisfaction in China: Implications for India

This paper draws on a unique survey of urban employees in Jiangsu that was designed to assist analysis of workers' satisfaction with the urban social insurance scheme in China, and sheds light on whether workers in the urban non-state sector are satisfied with the level of social insurance coverage and whether their perceptions compare favourably with workers in the state-owned sector. It also discusses the globalisation and social protection debate in India and draws implications for the Indian experience from both our perception research and China's experience with urban social insurance reform more generally.

A sword with two edges: propagation studies on both positive and negative information in online social networks

Online social networks (OSN) have become one of the major platforms for people to exchange information. Both positive information (e.g., ideas, news and opinions) and negative information (e.g., rumors and gossips) spreading in social media can greatly influence our lives. Previously, researchers have proposed models to understand their propagation dynamics. However, those were merely simulations in nature and only focused on the spread of one type of information. Due to the human-related factors involved, simultaneous spread of negative and positive information cannot be thought of the superposition of two independent propagations. In order to fix these deficiencies, we propose an analytical model which is built stochastically from a node level up. It can present the temporal dynamics of spread such as the time people check newly arrived messages or forward them. Moreover, it is capable of capturing people's behavioral differences in preferring what to believe or disbelieve. We studied the social parameters impact on propagation using this model. We found that some factors such as people's preference and the injection time of the opposing information are critical to the propagation but some others such as the hearsay forwarding intention have little impact on it. The extensive simulations conducted on the real topologies confirm the high accuracy of our model.

The relative importance of spatial proximity, kin selection and potential ‘greenbeard’ signals on provisioning behaviour among helpers in a cooperative bird

© 2015 Springer-Verlag Berlin Heidelberg Many hypotheses have been proposed to account for cooperative behaviour, with those favouring kin selection receiving the greatest support to date. However, the importance of relatedness becomes less clear in complex societies where interactions can involve both kin and non-kin. To help clarify this, we examined the relative effect of indirect versus key direct benefit hypotheses in shaping cooperative decisions. We assessed the relative importance of likely reciprocal aid (as measured by spatial proximity between participants), kin selection (using molecular-based relatedness indices) and putative signals of relatedness (vocal similarity) on helper/helper cooperative provisioning dynamics in bell miners (Manorina melanophrys), a species living in large, complex societies. Using network analysis, we quantified the extent of shared provisioning (helping at the same nests) among individual helpers (excluding breeding pairs) over three seasons and 4290 provisioning visits, and compared these with the location of individuals within a colony and networks built using either genetic molecular relatedness or call similarity indices. Significant levels of clustering were observed in networks; individuals within a cluster were more closely related to each other than other colony members, and cluster membership was stable across years. The probability of a miner helping at another’s nest was not simply a product of spatial proximity and thus the potential for reciprocal aid. Networks constructed using helping data were significantly correlated to those built using molecular data in 5 of 10 comparisons, compared to 8 of 10 comparisons for networks constructed using call similarity. This suggests an important role of kinship in shaping helping dynamics in a complex cooperative society, apparently determined via an acoustic ‘greenbeard’ signal in this system.

Social networks in changing environments

Social network analysis (SNA) has become a widespread tool for the study of animal social organisation. However despite this broad applicability, SNA is currently limited by both an overly strong focus on pattern analysis as well as a lack of dynamic interaction models. Here, we use a dynamic modelling approach that can capture the responses of social networks to changing environments. Using the guppy, Poecilia reticulata, we identified the general properties of the social dynamics underlying fish social networks and found that they are highly robust to differences in population density and habitat changes. Movement simulations showed that this robustness could buffer changes in transmission processes over a surprisingly large density range. These simulation results suggest that the ability of social systems to self-stabilise could have important implications for the spread of infectious diseases and information. In contrast to habitat manipulations, social manipulations (e.g. change of sex ratios) produced strong, but short-lived, changes in network dynamics. Lastly, we discuss how the evolution of the observed social dynamics might be linked to predator attack strategies. We argue that guppy social networks are an emergent property of social dynamics resulting from predator–prey co-evolution. Our study highlights the need to develop dynamic models of social networks in connection with an evolutionary framework.

Informal social networks within and between organisations: on the properties of interpersonal ties and trust

Purpose

– The purpose of this paper is to explore the underlying relational properties of security networks by focusing specifically on the relationship between formal and informal ties, and interpersonal and inter-organisational trust.

Design/methodology/approach

– The research is based on 20 qualitative interviews with senior members of police and security agencies across the field of counter-terrorism in Australia.

Findings

– The findings suggest that the underlying relational properties of security networks are highly complex, making it difficult to distinguish between formal and informal ties, interpersonal and inter-organisational trust. The findings also address the importance of informal ties and interpersonal trust for the functioning of organisational security networks.

Research limitations/implications

– The research is exploratory in nature and extends to a number of organisational security networks in the field of counter-terrorism in Australia. While it is anticipated that the findings will be relevant in a variety of contexts, further research is required to advance our knowledge of the implications and properties of informal social networks within defined network boundaries.

Practical implications

– The findings suggest that the functioning of security networks is likely to be highly dependent on the underlying social relationships between network members. This has practical implications for those responsible for designing and managing security networks.

Originality/value

– The paper calls attention to a very understudied topic by focusing on the dynamics of informal ties and interpersonal trust within organisational security networks.

A QoE centric distributed caching approach for vehicular video streaming in cellular networks

Distributed caching-empowered wireless networks can greatly improve the efficiency of data storage and transmission and thereby the users' quality of experience (QoE). However, how this technology can alleviate the network access pressure while ensuring the consistency of content delivery is still an open question, especially in the case where the users are in fast motion. Therefore, in this paper, we investigate the caching issue emerging from a forthcoming scenario where vehicular video streaming is performed under cellular networks. Specifically, a QoE centric distributed caching approach is proposed to fulfill as many users' requests as possible, considering the limited caching space of base stations and basic user experience guarantee. Firstly, a QoE evaluation model is established using verified empirical data. Also, the mathematic relationship between the streaming bit rate and actual storage space is developed. Then, the distributed caching management for vehicular video streaming is formulated as a constrained optimization problem and solved with the generalized-reduced gradient method. Simulation results indicate that our approach can improve the users' satisfaction ratio by up to 40%.

First-priority relation graph-based malicious users detection in mobile social networks

Mobile social networks (MSNs) consist of many mobile users (individuals) with social characteristics, that provide a variety of data delivery services involving the social relationship among mobile individuals. Because mobile users move around based on their common interests and contact with each other more frequently if they have more social features in common in MSNs. In this paper, we first propose the first-priority relation graph, say FPRG, of MSNs. However, some users in MSNs may be malicious. Malicious users can break the data delivery through terminating the data delivery or tampering with the data. Therefore, malicious users will be detected in the process of looking for the data delivery routing to obtain efficient and reliable data delivery routing along the first-priority relation graph. Secondly, we propose one hamiltonian cycle decomposition of FPRG-based adaptive detection algorithm based on in MSNs under the PMC detection model (the system-level detection model).

Cooperative data scheduling in hybrid vehicular ad hoc networks: VANET as a software defined network

This paper presents the first study on scheduling for cooperative data dissemination in a hybrid infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communication environment. We formulate the novel problem of cooperative data scheduling (CDS). Each vehicle informs the road-side unit (RSU) the list of its current neighboring vehicles and the identifiers of the retrieved and newly requested data. The RSU then selects sender and receiver vehicles and corresponding data for V2V communication, while it simultaneously broadcasts a data item to vehicles that are instructed to tune into the I2V channel. The goal is to maximize the number of vehicles that retrieve their requested data. We prove that CDS is NP-hard by constructing a polynomial-time reduction from the Maximum Weighted Independent Set (MWIS) problem. Scheduling decisions are made by transforming CDS to MWIS and using a greedy method to approximately solve MWIS. We build a simulation model based on realistic traffic and communication characteristics and demonstrate the superiority and scalability of the proposed solution. The proposed model and solution, which are based on the centralized scheduler at the RSU, represent the first known vehicular ad hoc network (VANET) implementation of software defined network (SDN) concept.

Dynamic social networks in guppies (Poecilia reticulata)

One of the main challenges in the study of social networks in vertebrates is to close the gap between group patterns and dynamics. Usually scan samples or transect data are recorded to provide information about social patterns of animals, but these techniques themselves do not shed much light on the underlying dynamics of such groups. Here we show an approach which captures the fission-fusion dynamics of a fish population in the wild and demonstrates how the gap between pattern and dynamics may be closed. Our analysis revealed that guppies have complex association patterns that are characterised by close strong connections between individuals of similar behavioural type. Intriguingly, the preference for particular social partners is not expressed in the length of associations but in their frequency. Finally, we show that the observed association preferences could have important consequences for transmission processes in animal social networks, thus moving the emphasis of network research from descriptive mechanistic studies to functional and predictive ones.

Social network analysis resolves temporal dynamics of male dominance relationships

Social organization is often studied through point estimates of individual association or interaction patterns, which does not account for temporal changes in the course of familiarization processes and the establishment of social dominance. Here, we present new insights on short-term temporal dynamics in social organization of mixed-sex groups that have the potential to affect sexual selection patterns. Using the live-bearing Atlantic molly (Poecilia mexicana), a species with pronounced male size polymorphism, we investigated social network dynamics of mixed sex experimental groups consisting of eight females and three different-sized males over a period of 5 days. Analyzing association-based social networks as well as direct measures of spatial proximity, we found that large males tended to monopolize most females, while excluding small- and medium-bodied males from access to females. This effect, however, emerged only gradually over time, and different-sized males had equal access to females on day 1 as well as day 2, though to a lesser extent. In this highly aggressive species with strong social dominance stratifications, the observed temporal dynamics in male-female association patterns may balance the presumed reproductive skew among differentially competitive male phenotypes when social structures are unstable (i.e., when individual turnover rates are moderate to high). Ultimately, our results point toward context-dependent sexual selection arising from temporal shifts in social organization.

Trustworthiness-hypercube-based reliable communication in mobile social networks

In mobile social networks (MSNs), the routing packet is forwarded from any user of in a group to any user of the other group until it reaches the destination group - the group where the destination is located. However, it is inevitable that malicious groups could compromise the quality and reliability of data. To alleviate such effect, analyzing the trustworthiness of a group has a positive influence on the confidence with which a group conducts transactions with that group. In our previous work, the feature-based first-priority relation graph (FPRG) of MSNs is proposed, in which two vertices (groups) are connected iff they have a first-priority relationship. In this paper, the trustworthiness computation of a group is firstly presented in the algorithm TC (Trustworthiness Computing) based on the FPRG. The trustworthiness of a group is evaluated based on the trustworthiness of neighbors and the number of malicious users in the group. We then establish the Trustworthiness-Hypercube-based Reliable Communication (THRC) algorithm in MSNs. The algorithm THRC can provide an effective and reliable data delivery routing. Finally, we also give two scenario simulations to elaborate the processes of the trustworthiness computation and reliable communication.