Emergence of a non-scaling degree distribution in bipartite networks: a numerical and analytical study

Abstract

We study the growth of bipartite networks in which the number of nodes in one of the partitions is kept fixed while the other partition is allowed to grow. We study random and preferential attachment as well as combination of both. We derive the exact analytical expression for the degree-distribution of all these different types of attachments while assuming that edges are incorporated sequentially, i.e., a single edge is added to the growing network in a time step. We also provide an approximate expression for the case when more than one edge are added in a time step. We show that depending on the relative weight between random and preferential attachment, the degree-distribution of this type of network falls into one of four possible regimes which range from a binomial distribution for pure random attachment to an u-shaped distribution for dominant preferential attachment.

References in corpus (13)

• Emergence of scaling in random networks
• Classes of behavior of small-world networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Evolution of the social network of scientific collaborations
• Topology of evolving networks: local events and universality
• Small-world properties of the Indian Railway network
• Self-organization of collaboration networks
• Cycles and clustering in bipartite networks
• Stations, trains and small-world networks
• Bipartite Producer-Consumer Networks and the Size Distribution of Firms
• Correlations in Bipartite Collaboration Networks
• N-body decomposition of bipartite networks
• A simple model for self organization of bipartite networks

Cited by in corpus (8)

• Measuring and Modeling Bipartite Graphs with Community Structure
• Degree distributions of bipartite networks and their projections
• Scaling of nestedness in complex networks
• An Evolving model of online bipartite networks
• Percolation on bipartite scale-free networks
• Conflicting attachment and the growth of bipartite networks
• Understanding how both the partitions of a bipartite network affect its one-mode projection
• Modeling Discrete Combinatorial Systems as Alphabetic Bipartite Networks: Theory and Applications