Diclique clustering in a directed random graph

DOI10.1007/978-3-319-49787-7_3zbMath1398.68388arXiv1607.02278OpenAlexW2488502502MaRDI QIDQ1989494

Lasse Leskelä, Mindaugas Bloznelis

Publication date: 26 October 2018

Full work available at URL: https://arxiv.org/abs/1607.02278

zbMATH Keywords

digraphintersection graphcomplex networkaffiliation networkdicliquetwo-mode networkbi-fan

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities

This page was built for publication: Diclique clustering in a directed random graph