Brand effect versus competitiveness in hypernetworks

@article{Guo2014BrandEV,
  title={Brand effect versus competitiveness in hypernetworks},
  author={Jinli Guo and Qi Suo},
  journal={Chaos},
  year={2014},
  volume={25 2},
  pages={
          023102
        }
}
A few of evolving models in hypernetworks have been proposed based on uniform growth. In order to better depict the growth mechanism and competitive aspect of real hypernetworks, we propose a model in term of the non-uniform growth. Besides hyperdegrees, the other two important factors are introduced to underlie preferential attachment. One dimension is the brand effect and the other is the competitiveness. Our model can accurately describe the evolution of real hypernetworks. The paper… 

Figures from this paper

Evolving hypernetwork model based on WeChat user relations

An evolving hypernetwork model with the competitiveness and the age of nodes with Poisson process theory and a continuous technique is proposed and the stationary average hyperdegree distribution of the hypernetwork is obtained by the characteristic equation.

The research on scale-free characteristics of hypernetworks

This paper systematically studied the scale-free hypernetwork formation mechanism on the basis of the hypergraph theory and finds that the scale of free hypernetwork has something to with hyperedge growth and hyperdegree preferential attachment.

Hypernetwork models based on random hypergraphs

This research presents a novel and scalable approach called “Smart Cassandra” that automates the very labor-intensive and therefore time-heavy and expensive process of establishing and maintaining hypernetworks in real-world systems.

Information dissemination in dynamic hypernetwork

Some characteristics of supernetworks based on unified hybrid network theory framework

Three kinds of supernetwork models with three layers based on the unified hybrid network theory framework (UHNTF) are proposed, and preferential and random linking are introduced, respectively, between the upper and lower layers.

Dynamical evolution behavior of scientific collaboration hypernetwork

A non-uniform dynamic collaborative evolution model that provides a reference for the research of the evolution process of scientific collaboration hypernetworks and theoretically proved that the hyperdegree distribution of nodes follows the power law distribution.

References

SHOWING 1-10 OF 48 REFERENCES

Evolving hypernetwork model

It is found that the proposed hypernetwork model shares similar qualitative features with the majority of complex networks that have been previously studied, such as the scale-free property of the degree distribution and a high degree of clustering, as well as the small-world property.

An evolving hypernetwork model and its properties

A new evolving hypernetwork model is constructed that possesses similar qualitative features with the majority of complex networks that have been previously studied, especially the scale-free property of the hyperdegrees distri-bution.

A Method for Measuring Node Importance in Hypernetwork Model

A new multi-criteria measuring method with adjustable parameters is proposed, which takes the node degree, star degree and betweenness into considerations and shows good performance on discrimination and precision to evaluate the importance of nodes as compared with several existing measuring methods for nodes in traditional network.

Popularity versus similarity in growing networks

It is shown that popularity is just one dimension of attractiveness; another dimension is similarity, and a framework in which new connections optimize certain trade-offs between popularity and similarity is developed, instead of simply preferring popular nodes.

Structure of growing networks with preferential linking.

The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal.

Competition and multiscaling in evolving networks

This work finds that competition for links translates into multiscaling, i.e. a fitness- dependent dynamic exponent, allowing fitter nodes to overcome the more connected but less fit ones.

Random hypergraphs and their applications

A mathematical model of a tripartite structure of users, resources, and tags-labels collaboratively applied by the users to the resources in order to impart meaningful structure on an otherwise undifferentiated database is proposed.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.