Degree distributions of evolving alphabetic bipartite networks and their projections
From MaRDI portal
Publication:1935772
DOI10.1016/j.tcs.2012.08.007zbMath1258.05119MaRDI 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
evolution; degree distribution; Pólya urn; one-mode projection; alphabetic bipartite network; discrete combinatorial system
05C90: Applications of graph theory
05C82: Small world graphs, complex networks (graph-theoretic aspects)
Uses Software
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