相关论文: Selfish Creation of Social Networks

Dynamic networks are graphs in which edges are available only at specific time instants, modeling connections that change over time. The dynamic network creation game studies this setting as a strategic interaction where each vertex…

The Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google's PageRank algorithm. In this paper we study a network formation game where each player…

Closeness is a global measure of centrality in networks, and a proxy for how influential actors are in social networks. In most network models, and many empirical networks, closeness is strongly correlated with degree. However, in social…

Constituents of complex systems interact with each other and self-organize to form complex networks. Empirical results show that the link formation process of many real networks follows either the global principle of popularity or the local…

In Peer-to-Peer (P2P) network systems, content (object) delivery between nodes is often required. One way to study such a distributed system is by defining games, which involve selfish nodes that make strategic choices on replicating…

We study network games in which players choose both the partners with whom they associate and an action level (e.g., effort) that creates spillovers for those partners. We introduce a framework and two solution concepts, extending standard…

We study selfish routing games where users can choose between regular and priority service for each network edge on their chosen path. Priority users pay an additional fee, but in turn they may travel the edge prior to non-priority users,…

As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…

Online social networks have emerged as useful tools to communicate or share information and news on a daily basis. One of the most popular networks is Twitter, where users connect to each other via directed follower relationships.…

Hierarchical networks are prevalent in nature and society, corresponding to groups of actors - animals, humans or even robots - organised according to a pyramidal structure with decision makers at the top and followers at the bottom. While…

The small-world phenomenon is found in many self-organising systems. Systems configured in small-world networks spread information more easily than in random or regular lattice-type networks. Whilst it is a known fact that small-world…

One of the best-known models in network science is preferential attachment. In this model, the probability of attaching to a node depends on the degree of all nodes in the population, and thus depends on global information. In many…

We deal with the problem of automatically generating social networks by analyzing and assessing smartphone usage and interaction data. We start by assigning weights to the different types of interactions such as messaging, email, phone…

Much of applied network analysis concerns with studying the existing relationships between a set of agents; however, little focus has been given to the considerations of how to represent observed phenomena as a network object. In the case…

Social marketing is becoming increasingly important in contemporary business. Central to social marketing is quantifying how consumers choose between alternatives and how they influence each other. This work considers a new but simple…

In this paper we investigate phenomena of spontaneous emergence or purposeful formation of highly organized structures in networks of related agents. We show that the formation of large organized structures requires exponentially large, in…

We study Nash equilibria and the price of anarchy in the classical model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price $\alpha>0$ in order to get connected to the…

Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by…

We develop a new class of random graph models for the statistical estimation of network formation -- subgraph generated models (SUGMs). Various subgraphs -- e.g., links, triangles, cliques, stars -- are generated and their union results in…

Global supply networks in agriculture, manufacturing, and services are a defining feature of the modern world. The efficiency and the distribution of surpluses across different parts of these networks depend on choices of intermediaries.…