We develop a modification of the connections model by Jackson and Wolinsky (1996) that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general...

We develop a modification of the connections model by Jackson and Wolinsky (1996) that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general...

We develop a modification of the connections model by Jackson and Wolinsky (1996) that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general...

We present an application of relation algebra to measure players strength in a social network with influence between players. In particular, we deal with power, success, and influence of a player as measured by the Hoede-Bakker index, its generalization and modifications, and by the influence...

We study a stochastic model of influence where agents have yes-no inclinations on some issue, and opinions may change due to mutual influence among the agents. Each agent independently aggregates the opinions of the other agents and possibly herself. We study influence processes modelled by...

We develop a modification of the connections model by Jackson and Wolinsky (1996) that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general...

A well-known model in sociology and marketing is that of opinion leadership. Opinion leaders are actors who are able to affect the behavior of their followers. Hence, opinion leaders have some power over their followers, and they can exercise this power by influencing their followers choice of...

One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...

In this paper, we connect the social network theory on centrality measures to the economic theory of preferences and utility. Using the fact that networks form a special class of cooperative TU-games, we provide a foundation for the degree measure as a von Neumann-Morgenstern expected utility...

This paper aims to connect the social network literature on centrality measures with the economic literature on von Neumann-Morgenstern expected utility functions using cooperative game theory. The social network literature studies various concepts of network centrality, such as degree,...