156,289 research outputs found

    Landscapes of Helping: Kindliness in Neighbourhoods and Communities

    Get PDF
    Increasing geographical mobility, economic change and the rise of an individualist culture in the UK have contributed to the loosening of close ties in communities. Communities need to evolve, to reconnect, so that people cultivate the ‘background hum’ of sociability that has been associated with neighbourliness. This ‘background hum’ is characterised by people’s awareness of each other, by a respect for each other’s privacy and by a readiness to take action if help is needed. In this research we define kindliness as ‘neighbourliness enacted’ and describe the process of reconnection within communities as the ‘reinvention of sociality’. Hebden Bridge’s relative success in melding traditional and more contemporary forms of sociality helps to identify some broader lessons about fostering kindliness in neighbourhoods and communities

    On Facebook, most ties are weak

    Full text link
    Pervasive socio-technical networks bring new conceptual and technological challenges to developers and users alike. A central research theme is evaluation of the intensity of relations linking users and how they facilitate communication and the spread of information. These aspects of human relationships have been studied extensively in the social sciences under the framework of the "strength of weak ties" theory proposed by Mark Granovetter.13 Some research has considered whether that theory can be extended to online social networks like Facebook, suggesting interaction data can be used to predict the strength of ties. The approaches being used require handling user-generated data that is often not publicly available due to privacy concerns. Here, we propose an alternative definition of weak and strong ties that requires knowledge of only the topology of the social network (such as who is a friend of whom on Facebook), relying on the fact that online social networks, or OSNs, tend to fragment into communities. We thus suggest classifying as weak ties those edges linking individuals belonging to different communities and strong ties as those connecting users in the same community. We tested this definition on a large network representing part of the Facebook social graph and studied how weak and strong ties affect the information-diffusion process. Our findings suggest individuals in OSNs self-organize to create well-connected communities, while weak ties yield cohesion and optimize the coverage of information spread.Comment: Accepted version of the manuscript before ACM editorial work. Check http://cacm.acm.org/magazines/2014/11/179820-on-facebook-most-ties-are-weak/ for the final versio

    Mining for Social Serendipity

    Get PDF
    A common social problem at an event in which people do not personally know all of the other participants is the natural tendency for cliques to form and for discussions to mainly happen between people who already know each other. This limits the possibility for people to make interesting new acquaintances and acts as a retarding force in the creation of new links in the social web. Encouraging users to socialize with people they don't know by revealing to them hidden surprising links could help to improve the diversity of interactions at an event. The goal of this paper is to propose a method for detecting "surprising" relationships between people attending an event. By "surprising" relationship we mean those relationships that are not known a priori, and that imply shared information not directly related with the local context of the event (location, interests, contacts) at which the meeting takes place. To demonstrate and test our concept we used the Flickr community. We focused on a community of users associated with a social event (a computer science conference) and represented in Flickr by means of a photo pool devoted to the event. We use Flickr metadata (tags) to mine for user similarity not related to the context of the event, as represented in the corresponding Flickr group. For example, we look for two group members who have been in the same highly specific place (identified by means of geo-tagged photos), but are not friends of each other and share no other common interests or, social neighborhood

    Community tracking in a cMOOC and nomadic learner behavior identification on a connectivist rhizomatic learning network

    Get PDF
    This article contributes to the literature on connectivism, connectivist MOOCs (cMOOCs) and rhizomatic learning by examining participant interactions, community formation and nomadic learner behavior in a particular cMOOC, #rhizo15, facilitated for 6 weeks by Dave Cormier. It further focuses on what we can learn by observing Twitter interactions particularly. As an explanatory mixed research design, Social Network Analysis and content analysis were employed for the purposes of the research. SNA is used at the macro, meso and micro levels, and content analysis of one week of the MOOC was conducted using the Community of Inquiry framework. The macro level analysis demonstrates that communities in a rhizomatic connectivist networks have chaotic relationships with other communities in different dimensions (clarified by use of hashtags of concurrent, past and future events). A key finding at the meso level was that as #rhizo15 progressed and number of active participants decreased, interaction increased in overall network. The micro level analysis further reveals that, though completely online, the nature of open online ecosystems are very convenient to facilitate the formation of community. The content analysis of week 3 tweets demonstrated that cognitive presence was the most frequently observed, while teaching presence (teaching behaviors of both facilitator and participants) was the lowest. This research recognizes the limitations of looking only at Twitter when #rhizo15 conversations occurred over multiple platforms frequented by overlapping but not identical groups of people. However, it provides a valuable partial perspective at the macro meso and micro levels that contribute to our understanding of community-building in cMOOCs

    Detecting change points in the large-scale structure of evolving networks

    Full text link
    Interactions among people or objects are often dynamic in nature and can be represented as a sequence of networks, each providing a snapshot of the interactions over a brief period of time. An important task in analyzing such evolving networks is change-point detection, in which we both identify the times at which the large-scale pattern of interactions changes fundamentally and quantify how large and what kind of change occurred. Here, we formalize for the first time the network change-point detection problem within an online probabilistic learning framework and introduce a method that can reliably solve it. This method combines a generalized hierarchical random graph model with a Bayesian hypothesis test to quantitatively determine if, when, and precisely how a change point has occurred. We analyze the detectability of our method using synthetic data with known change points of different types and magnitudes, and show that this method is more accurate than several previously used alternatives. Applied to two high-resolution evolving social networks, this method identifies a sequence of change points that align with known external "shocks" to these networks
    • …
    corecore