Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis > publications : papers : 2011 : hidden_variables_bipartite
Hidden variables in bipartite networks
M. Kitsak and D. Krioukov, "Hidden variables in bipartite networks", Physical Review E, vol. 82, no. 026114, Aug 2011.
|   View full paper:    PDF    |  Citation:    BibTeX   |

Hidden variables in bipartite networks

Maksim Kitsak
Dmitri Krioukov

CAIDA, San Diego Supercomputer Center, University of California San Diego

We introduce and study random bipartite networks with hidden variables. Nodes in these networks are characterized by hidden variables that control the appearance of links between node pairs. We derive analytic expressions for the degree distribution, degree correlations, the distribution of the number of common neighbors, and the bipartite clustering coefficient in these networks. We also establish the relationship between degrees of nodes in original bipartite networks and in their unipartite projections. We further demonstrate how hidden variable formalism can be applied to analyze topological properties of networks in certain bipartite network models, and verify our analytical results in numerical simulations.

Keywords: network geometry, routing, topology
  Last Modified: Wed Oct-11-2017 17:03:58 PDT
  Page URL: