A scale-free graph model based on bipartite graphs

DOI10.1016/j.dam.2008.06.052zbMath1182.92032OpenAlexW2150517229MaRDI QIDQ1026182

Etienne Birmelé

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.052

zbMATH Keywords

bipartite graphrandom graphcomplex networkscale-free

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Systems biology, networks (92C42)

Related Items

EFFECTS OF THE HIGH-ORDER CORRELATION ON INFORMATION FILTERING

Cites Work

• Unnamed Item
• Connected components in random graphs with given expected degree sequences
• Bipartite structure of all complex networks
• Emergence of Scaling in Random Networks
• A random graph model for massive graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• Paths in graphs
• Collective dynamics of ‘small-world’ networks
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• The diameter of sparse random graphs