Related papers: Trust transitivity in social networks
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regular graphs, and demonstrate that the protocol exhibits better…
In modern internet-scale computing, interaction between a large number of parties that are not known a-priori is predominant, with each party functioning both as a provider and consumer of services and information. In such an environment,…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
Spreading phenomena on networks are essential for the collective dynamics of various natural and technological systems, from information spreading in gene regulatory networks to neural circuits or from epidemics to supply networks…
Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of…
Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals' affected neighbors, such a spreading process becomes a "complex…
The collective behaviour of people adopting an innovation, product or online service is commonly interpreted as a spreading phenomenon throughout the fabric of society. This process is arguably driven by social influence, social learning…
It is well known that tree-based theories can describe the properties of undirected clustered networks with extremely accurate results [S. Melnik, \textit{et al}. Phys. Rev. E 83, 036112 (2011)]. It is reasonable to suggest that a motif…
With the growing importance of corporate viral marketing campaigns on online social networks, the interest in studies of influence propagation through networks is higher than ever. In a viral marketing campaign, a firm initially targets a…
Understanding how complex behaviors, opinions, and innovations spread in online social networks remains a central challenge in computational social science. Existing models of complex contagion typically rely on stylized threshold…
With the increasing scale, complexity, and heterogeneity of the next generation networked systems, seamless control, management, and security of such systems becomes increasingly challenging. Many diverse applications have driven interest…
We derive mean-field equations that describe the dynamics of a general model of rumor spreading on complex networks, and use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model…
In this paper, we propose a general model for collaboration networks. Depending on a single free parameter "{\bf preferential exponent}", this model interpolates between networks with a scale-free and an exponential degree distribution. The…
The last years have seen a growing interest in collaborative systems like electronic marketplaces and P2P file sharing systems where people are intended to interact with other people. Those systems, however, are subject to security and…
Recent technological advancements have resulted in a surge in online trading, raising severe concerns about theft and fraud, especially on platforms like Bitcoin OTC (over-the-counter), where users' identities remain anonymous. To mitigate…
We describe and develop three recent novelties in network research which are particularly useful for studying social systems. The first one concerns the discovery of some basic dynamical laws that enable the emergence of the fundamental…
Establishing trust between developers working at distant sites facilitates team collaboration in distributed software development. While previous research has focused on how to build and spread trust in absence of direct, face-to-face…
Recently, it is shown that shuffling can amplify the central differential privacy guarantees of data randomized with local differential privacy. Within this setup, a centralized, trusted shuffler is responsible for shuffling by keeping the…
Recent empirical observations suggest that network transitivity is highly correlated with community structure in many real-world networks. In this paper, we theoretically investigate this relationship by deriving the limits of the global…
Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can…