Large dicliques in a directed inhomogeneous random graph

DOI10.1080/00207160.2012.735663MaRDI QIDQ2852103zbMATH OpenOpenAlexFDO

Authors 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial probability (60C05)

Recommendations

• Large cliques in a power-law random graph
• Diclique clustering in a directed random graph
• Connectivity of a general class of inhomogeneous random digraphs
• Asymptotics for cliques in scale-free random graphs
• Parameterized clique on inhomogeneous random graphs

Cites work

• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Community structure in social and biological networks
• Large cliques in a power-law random graph
• Multi-type directed scale-free percolation
• On a conditionally Poissonian graph process
• Random Dot Product Graph Models for Social Networks
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• The critical behavior of random digraphs
• The phase transition in inhomogeneous random graphs

Cited in

(5)

• Diclique clustering in a directed random graph
• A note on the warmth of random graphs with given expected degrees
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852103)