Degree distributions of evolving alphabetic bipartite networks and their projections

DOI10.1016/J.TCS.2012.08.007zbMath1258.05119OpenAlexW2020193743MaRDI QIDQ1935772

Niloy Ganguly, Tyll Krueger, Ajitesh Srivastava, Saptarshi Ghosh

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.007

zbMATH Keywords

evolutiondegree distributionPólya urnone-mode projectionalphabetic bipartite networkdiscrete combinatorial system

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Uses Software

• plfit

Cites Work

• Unnamed Item
• Unnamed Item
• Exchangeable urn processes
• Generalizations of Polya's urn problem
• Metric structure of random networks
• Bipartite structure of all complex networks
• The degree of a typical vertex in generalized random intersection graph models
• From the Cover: The structure of scientific collaboration networks
• Emergence of Scaling in Random Networks
• Power-Law Distributions in Empirical Data
• The Structure and Function of Complex Networks
• Random graph models of social networks
• Correlations in bipartite collaboration networks

This page was built for publication: Degree distributions of evolving alphabetic bipartite networks and their projections