Related papers: Popularity versus Similarity in Growing Networks

The connectivity of a network contains information about the relationships between nodes, which can denote interactions, associations, or dependencies. We show that this information can be analyzed by measuring the uncertainty (and…

We present an analytically tractable model of Internet evolution at the level of Autonomous Systems (ASs). We call our model the multiclass preferential attachment (MPA) model. As its name suggests, it is based on preferential attachment.…

The spread of information has become faster and wider than ever with the advent of social network platforms. The question raised in this study is whether information dissemination in social networks is random or follows a discernible…

Affinity propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each datapoint with one exemplar. We extend affinity propagation in a principled way to solve the…

In a social network, the number of links of a node, or node degree, is often assumed as a proxy for the node's importance or prominence within the network. It is known that social networks exhibit the (first-order) assortative mixing, i.e.…

Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks manifesting as a higher tendency of links occurring between people with…

Many networks exhibit scale free behavior where their degree distribution obeys a power law for large vertex degrees. Models constructed to explain this phenomena have relied on preferential attachment where the networks grow by the…

Inequalities in social networks arise from linking mechanisms, such as preferential attachment (connecting to popular nodes), homophily (connecting to similar others), and triadic closure (connecting through mutual contacts). While…

The rate at which nodes in a network increase their connectivity depends on their fitness to compete for links. For example, in social networks some individuals acquire more social links than others, or on the www some webpages attract…

In this paper, we propose a growing random complex network model, which we call context dependent preferential attachment model (CDPAM), when the preference of a new node to get attached to old nodes is determined by the local and global…

Acceptance of an innovation can occur through mutliple exposures to individuals who have already accepted it. Presented here is a model to trace the evolution of an innovation in a social network with a preference $\lambda$, amidst…

Individual nodes in evolving real-world networks typically experience growth and decay --- that is, the popularity and influence of individuals peaks and then fades. In this paper, we study this phenomenon via an intrinsic nodal fitness…

We discuss a model for evolutionary game dynamics in a growing, network-structured population. In our model, new players can either make connections to random preexisting players or preferentially attach to those that have been successful…

We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…

We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…

We study properties of some standard network models when the population is split into two types and the connection pattern between the types is varied. The studied models are generalizations of the Erd\H{o}s-R\'{e}nyi graph, the…

We propose a simple model of social network formation that parameterizes the tendency to establish acquaintances by the relative distance in a representative social space. By means of analytical calculations and numerical simulations, we…

Inspired by empirical data on real world complex networks, the last few years have seen an explosion in proposed generative models to understand and explain observed properties of real world networks, including power law degree distribution…

Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs…

Video popularity is an essential reference for optimizing resource allocation and video recommendation in online video services. However, there is still no convincing model that can accurately depict a video's popularity evolution. In this…