of the Dissertation Gossip and the Group: A Self-Categorization Perspective by Dana Turcotte Claremont Graduate University: 2012 Gossip is a little studied topic and even fewer studies have examined gossip from the perspective of social identity and self categorization theories. However, many of the functions of gossip have significant implications for group processes, including bonding, norm t...

This work presents two new construction techniques for q-ary Gossip codes from tdesigns and Traceability schemes. These Gossip codes achieve the shortest code length specified in terms of code parameters and can withstand erasures in digital fingerprinting applications. This work presents the construction of embedded Gossip codes for extending an existing Gossip code into a bigger code. It disc...

Gossip is one of the most widespread human activities with multiple functions such as enhancing human cooperation, establishing social order, information sharing, norm enhancing or stress reduction. Gossip has been analyzed mostly by qualitative or survey methods. In this paper, we describe a quantitative approach to identify gossip in a large corpus containing spontaneous talk with LDA topic m...

The purpose of this study is to get a working definition that matches people’s intuitive notion of gossip and is sufficiently precise for computational implementation. We conducted two experiments investigating what type of conversations people intuitively understand and interpret as gossip, and whether they could identify three proposed constituents of gossip conversations: third person focus,...

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...

This paper studies reliability of probabilistic neighbor-aware gossip algorithms over three wellknown large-scale random topologies, namely Bernoulli (or Erdős-Rényi) graph, the random geometric graph, and the scale-free graph. We propose a new and simple algorithm which ensures higher reliability at lower message complexity than the three families of gossip algorithms over every topology in ou...

Gossip-based protocol has been widely adopted by many large-scale multicast applications. In this paper, we study the impact of node cheating on decentralized gossip-based protocol. We mainly focus on two cheating strategies, one is to increase the subscription request sending times, and the other is to increase the PartialView size. We establish a cheating model of nodes for gossip-based proto...

We investigate how suitable a weighted network is for gossip spreading. The proposed model is based on the gossip spreading model introduced by Lind et.al. on unweighted networks. Weight represents “friendship. Potential spreader prefers not to spread if the victim of gossip is a “close friend”. Gossip spreading is related to the triangles and cascades of triangles. It gives more insight about ...