Filters








8,472 Hits in 5.0 sec

Gossip [chapter]

Márk Jelasity
2011 Natural Computing Series  
Gossip plays a very significant role in human society.  ...  In this chapter, we focus on two main manifestations of gossip: information spreading (also known as multicast) where a piece of news is being spread, and information aggregation (or distributed data mining  ...  We have seen that in some protocols it is useful to keep track of the age of the update; that is, to know how long ago a given update was inserted.  ... 
doi:10.1007/978-3-642-17348-6_7 fatcat:b3qrn5rpx5b4jebffbbpfkyl4m

Gossip as a resource: How and why power relationships shape gossip behavior

Elena Martinescu, Onne Janssen, Bernard A. Nijstad
2019 Organizational Behavior and Human Decision Processes  
From a social exchange perspective, we examined how hierarchical power relationships shape individuals' gossip motives and behavior.  ...  These results confirm our notion that gossip is functional behavior that enables individuals in hierarchical power relationships to strategically exchange different social resources (i.e., information,  ...  Laetitia Mulder for their help in developing this paper.  ... 
doi:10.1016/j.obhdp.2019.05.006 fatcat:535ueewwdfglxf6kqshwb4ypfi

Self-* properties through gossiping

O. Babaoglu, M. Jelasity
2008 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
The approach is inspired by the biological mechanism of cell sorting via differential adhesion, as well as by our earlier work in self-organizing peer-to-peer overlay networks.  ...  In this paper we overview techniques to implement self- * properties in large-scale, decentralized networks through bio-inspired techniques in general, and gossip-based algorithms in particular.  ...  It can be shown that as a result, new updates spread in logarithmic time over the network, much like gossiping in social networks.  ... 
doi:10.1098/rsta.2008.0122 pmid:18672459 fatcat:aso7stdrufdmreorwdia5it6ze

A framework for semantic gossiping

Karl Aberer, Philippe Cudré-Mauroux, Manfred Hauswirth
2002 SIGMOD record  
Such a system can readily be used to study semantic interoperability as a global scale phenomenon taking place in a social network of information sharing peers.  ...  Today the problem of semantic interoperability in information search on the Internet is solved mostly by means of centralization, both at a system and at a logical level.  ...  in networked interactions), or multiple schemas connected by gateways could co-exist, or whether, for example, the network would partition into completely disconnected sub-networks.  ... 
doi:10.1145/637411.637419 fatcat:64vubdzup5eipjaq7ir2vh7aeq

Evil Acts and Malicious Gossip

Eliot R. Smith
2014 Personality and Social Psychology Review  
Funding The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was facilitated by a grant (BCS-094911) from the National  ...  to other observers in gossip, spreading the information through the social network beyond the reach of compensation by future, more positive actions.  ...  , 2012) and because the complete path of information across many links in the social network is difficult to determine.  ... 
doi:10.1177/1088868314530515 pmid:24727973 fatcat:tm24kapukvfijmxtic7rlxf66i

Geology: Modular Georecommendation in Gossip-Based Social Networks

Jesus Carretero, Florin Isaila, Anne-Marie Kermarrec, Francois Taiani, Juan M. Tirado
2012 2012 IEEE 32nd International Conference on Distributed Computing Systems  
Geolocated social networks, combining traditional social networking features with geolocation information, have grown tremendously over the last few years.  ...  , a leading geolocated social network.  ...  ACKNOWLEDGMENT Part of this work was supported by ERC Starting Grant GOSSPLE number 204742, the Spanish Ministry of Education under FPU program AP2007-03530 (Juan M.  ... 
doi:10.1109/icdcs.2012.36 dblp:conf/icdcs/CarreteroIKTT12 fatcat:tqgylkvjnng6viucba3ksokcly

Simple, Fast and Deterministic Gossip and Rumor Spreading [chapter]

Bernhard Haeupler
2013 Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms  
This has been done via lower bounds for restricted models and by designing gossip algorithms with a reduced need for randomness.  ...  We study gossip algorithms for the rumor spreading problem which asks each node to deliver a rumor to all nodes in an unknown network.  ...  of Θ(n) in the worst-case, this is optimal up to a small polylogarithmic factor considering that in dense graphs the total amount of information learned by nodes during a 1-neighborhood exchange is of  ... 
doi:10.1137/1.9781611973105.51 dblp:conf/soda/Haeupler13 fatcat:d5oiik4bl5crrfiapsl4alldnu

The effect of gossip on social networks

Allison K. Shaw, Milena Tsvetkova, Roozbeh Daneshvar
2010 Complexity  
In this article, we develop a simple model for the effect of gossip spread on social network structure.  ...  We define gossip as information passed between two individuals A and B about a third individual C which affects the strengths of all three relationships: it strengthens A-B and weakens both B-C and A-C  ...  ACKNOWLEDGMENTS This article started as a collaborative project at the 2009 Complex Systems Summer School at the Santa Fe Institute (SFI), with David Brooks, and Chang Yu.  ... 
doi:10.1002/cplx.20334 fatcat:oxycik3qwfhnzh6kg6h6xiht44

GossipKit: A Unified ComponentFramework for Gossip

Francois Taiani, Shen Lin, Gordon S. Blair
2014 IEEE Transactions on Software Engineering  
In this paper, we consider how component frameworks, which have been widely applied to implement middleware solutions, can facilitate the development of gossip-based systems in a way that is both generic  ...  This problem is compounded by the lack of a unified programming framework for gossip, which means developers cannot easily reuse, compose, or adapt existing solutions to fit their needs, and have limited  ...  ACKNOWLEDGMENTS This work has been supported by the ESF MiNEMA program (Ref. 1954) and partially by the EU FP7 ReSIST Network of Excellence (n. 026764).  ... 
doi:10.1109/tse.2013.50 fatcat:ay57qy24afal7aagt7pkw5i52a

Rethinking Audience Clustering in Sports Market using Gossip Protocol

Asif Ali Banka, Roohie Naaz
2018 International Journal of Computer Networks And Applications  
The authors propose a graph theoretic model in context of sports analytics that presents preliminary study of using gossip protocol for sharing information among members of sports oriented social network  ...  The authors realize that sports industry is a close, strongly connected group that is very similar in its behavior to a social network.  ...  Excited about information diffusion in a social network and how this can be treated as a tool to enhance sales, vary business models and marketing strategies, authors treats sports groups as gossiping  ... 
doi:10.22247/ijcna/2018/49551 fatcat:qeque33dbzd5vdr5bnxc3hfoeu

Simple, Fast and Deterministic Gossip and Rumor Spreading

Bernhard Haeupler
2015 Journal of the ACM  
This has been done via lower bounds for restricted models and by designing gossip algorithms with a reduced need for randomness, e.g., by using pseudorandom generators with short random seeds.  ...  A long series of papers analyzed the performance of uniform random gossip in which nodes repeatedly call a random neighbor to exchange all rumors with.  ...  of Θ(n) in the worst-case, this is optimal up to a small polylogarithmic factor considering that in dense graphs the total amount of information learned by nodes during a 1-neighborhood exchange is of  ... 
doi:10.1145/2767126 fatcat:uoqn6d5ccrgppotxdlxoqitgfq

Introduction [chapter]

2021 Anecdote, Network, Gossip, Performance  
I mean that the anecdotes of the Shishuo collectively imagine a network through which social talk (as gossip, evaluation, and wit) circulates and gives voice to the values of this social network.  ...  In chapter 2, I turn to the concept of the social network, which I argue provides a useful model for understanding how the various anecdotes and figures relate to one another across the entire collection  ... 
doi:10.1163/9780674251175_002 fatcat:zwdgd4nwkbgjvc6twuym5snz2a

When Are Two Gossips the Same? Types of Communication in Epistemic Gossip Protocols [article]

Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek
2018 arXiv   pre-print
Pairs of agents communicate by means of calls in order to spread information---so-called secrets---within the group.  ...  We provide an in-depth study of the knowledge-theoretic aspects of communication in so-called gossip protocols.  ...  The first author was partially supported by the NCN grant nr 2014/13/B/ST6/01807.  ... 
arXiv:1807.05283v3 fatcat:babqga3ecbb4rjjbopwzplo52a

Deterrence and transmission as mechanisms ensuring reliability of gossip

Francesca Giardini
2011 Cognitive Processing  
In this work, we propose a theoretical model in which reliability of gossip depends on the joint functioning of two distinct mechanisms.  ...  Thanks to gossip, individuals can acquire the information about their peers without sustaining the burden of costly interactions with cheaters, but they can also create and revise social bonds.  ...  ''A cognitive model of gossip'' introduces a cognitive model of gossip, in which the importance of the source is clearly underlined and an important distinction between information with known and unknown  ... 
doi:10.1007/s10339-011-0421-0 pmid:21984345 fatcat:eu2n4g6qrfffjkqk43jqlx627u

The co-evolution of gossip and friendship in workplace social networks

Lea Ellwardt, Christian Steglich, Rafael Wittek
2012 Social Networks  
SIENA models are more principled.  ...  It tests whether the creation of a tie in network A is facilitated by mutual ties in network B.  ... 
doi:10.1016/j.socnet.2012.07.002 fatcat:2j6cavkl2rgsxmcjvpwlxqjt64
« Previous Showing results 1 — 15 out of 8,472 results