Diclique clustering in a directed random intersection graph

Mindaugas Bloznelis, Lasse Leskelä

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)

Abstract

We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicliques or bi-fans, have been found to be key structural components in various real-world networks. We introduce a two-mode statistical network model consisting of actors and auxiliary attributes, where an actor i decides to follow an actor j whenever i demands an attribute supplied by j. We show that the digraph admits nontrivial clustering properties of the aforementioned type, as well as power-law indegree and outdegree distributions.
Original languageEnglish
Title of host publicationAlgorithms and Models for the Web Graph
PublisherSpringer International
Pages22-33
Number of pages12
ISBN (Electronic)978-3-319-49787-7
ISBN (Print)978-3-319-49786-0
DOIs
Publication statusPublished - 11 Nov 2016
MoE publication typeA4 Article in a conference publication
EventWorkshop on Algorithms and Models for the Web Graph - Centre de recherches mathématiques (CRM), Montreal, Canada
Duration: 14 Dec 201615 Dec 2016
Conference number: 13
http://www.math.ryerson.ca/waw2016/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume 10088
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

WorkshopWorkshop on Algorithms and Models for the Web Graph
Abbreviated titleWAW
CountryCanada
CityMontreal
Period14/12/201615/12/2016
Internet address

Keywords

  • interection graph, two-mode network, affliation network, digraph, diclique, bi-fan, complex netwo

Fingerprint

Dive into the research topics of 'Diclique clustering in a directed random intersection graph'. Together they form a unique fingerprint.

Cite this