• DocumentCode
    2399255
  • Title

    Decomposing Social Networks

  • Author

    Richards, Whitman ; Macindoe, Owen

  • Author_Institution
    CSAIL, Mass. Inst. of Technol., Cambridge, MA, USA
  • fYear
    2010
  • fDate
    20-22 Aug. 2010
  • Firstpage
    114
  • Lastpage
    119
  • Abstract
    Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various subcomponents completely obscure. We illustrate a method for decomposing a network into aggregates of subgraphs whose topologies are represented as colors in RGB space.
  • Keywords
    graph theory; social networking (online); social networks decomposition; subgraphs; topologies; Aggregates; Bonding; Color; Image color analysis; Network topology; Social network services; Topology; Representing social networks; motifs; network scale; visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Social Computing (SocialCom), 2010 IEEE Second International Conference on
  • Conference_Location
    Minneapolis, MN
  • Print_ISBN
    978-1-4244-8439-3
  • Electronic_ISBN
    978-0-7695-4211-9
  • Type

    conf

  • DOI
    10.1109/SocialCom.2010.25
  • Filename
    5590790