Large dicliques in a directed inhomogeneous random graph

DOI10.1080/00207160.2012.735663zbMath1273.05167OpenAlexW1996887603MaRDI QIDQ2852103

Yilun Shang

Publication date: 8 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.735663

zbMATH Keywords

greedy algorithmcommunityinhomogeneous random graphdiclique

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Sombor index and degree-related properties of simplicial networks ⋮ Inhomogeneous long-range percolation on the hierarchical lattice ⋮ Non-Hyperbolicity of Random Graphs with Given Expected Degrees ⋮ A note on the warmth of random graphs with given expected degrees

Cites Work

• Unnamed Item
• Multi-Type Directed Scale-Free Percolation
• The critical behavior of random digraphs
• Large Cliques in a Power-Law Random Graph
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• The phase transition in inhomogeneous random graphs
• Random Dot Product Graph Models for Social Networks
• On a conditionally Poissonian graph process

This page was built for publication: Large dicliques in a directed inhomogeneous random graph