104,365 research outputs found

    Civil society in the South Caucasus: kinship networks as obstacles to civil participation

    Get PDF
    The research to date on informal networks of the post-communist South Caucasus has tended to focus either on the informal institutions’ role in providing social safety nets for the population or on the networks’ economic functions. This article examines the impact of informal kinship networks on participation in organized civil society in the present-day Armenia, Azerbaijan and Georgia. In order to explore how kinship institutions affect membership in civil society organizations across the South Caucasus, this research builds on a variety of primary and secondary sources. The findings of this study reveal that kinship-based networks serve as a significant source of social capital in the South Caucasus: they offer social support to their members and encourage intra-network bonding, making participation in civil society unattractive. However, the prevalence of kinship networks does not significantly affect popular attitudes towards organized civil society and the reliance on kinship structures is not seen as substitute for membership in formal civil society

    Multirelational Organization of Large-scale Social Networks in an Online World

    Full text link
    The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a non-linear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multi-dimensional nature of these interactions has largely been ignored in empirical studies, mostly because of lack of data. Here, for the first time, we analyze a complete, multi-relational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering and fatter-tail degree distribution. We then proceed to explore how the inter-dependence of different network types determines the organization of the social system. In particular we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations.Comment: 7 pages, 5 figures, accepted for publication in PNA

    Community structure and ethnic preferences in school friendship networks

    Get PDF
    Recently developed concepts and techniques of analyzing complex systems provide new insight into the structure of social networks. Uncovering recurrent preferences and organizational principles in such networks is a key issue to characterize them. We investigate school friendship networks from the Add Health database. Applying threshold analysis, we find that the friendship networks do not form a single connected component through mutual strong nominations within a school, while under weaker conditions such interconnectedness is present. We extract the networks of overlapping communities at the schools (c-networks) and find that they are scale free and disassortative in contrast to the direct friendship networks, which have an exponential degree distribution and are assortative. Based on the network analysis we study the ethnic preferences in friendship selection. The clique percolation method we use reveals that when in minority, the students tend to build more densely interconnected groups of friends. We also find an asymmetry in the behavior of black minorities in a white majority as compared to that of white minorities in a black majority.Comment: submitted to Physica

    Diffusion on Complex Networks : A way to probe their large scale topological structures

    Full text link
    A diffusion process on complex networks is introduced in order to uncover their large scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to real-world networks like a friendship network of known modular structure, and an Internet routing network. For the friendship network, its known structure is well reproduced. In case of the Internet, where the structure is far less well-known, one indeed finds a modular structure, and modules can roughly be associated with individual countries. Quantitatively the modular structure of the Internet manifests itself in an approximately 10 times larger participation ratio of its slowest decaying modes as compared to the null model -- a random scale-free network. The extreme edges of the Internet are found to correspond to Russian and US military sites.Comment: Latex, 13 pages, 4 figures (To appear Physica A

    Preserving Link Privacy in Social Network Based Systems

    Full text link
    A growing body of research leverages social network based trust relationships to improve the functionality of the system. However, these systems expose users' trust relationships, which is considered sensitive information in today's society, to an adversary. In this work, we make the following contributions. First, we propose an algorithm that perturbs the structure of a social graph in order to provide link privacy, at the cost of slight reduction in the utility of the social graph. Second we define general metrics for characterizing the utility and privacy of perturbed graphs. Third, we evaluate the utility and privacy of our proposed algorithm using real world social graphs. Finally, we demonstrate the applicability of our perturbation algorithm on a broad range of secure systems, including Sybil defenses and secure routing.Comment: 16 pages, 15 figure
    • …
    corecore