Motifs in Networks

Karsten Weihe ()
Additional contact information
Karsten Weihe: Technische Universität Darmstadt, Fachbereich Informatik

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 59-68 from Springer

Abstract: Abstract Motifs are a useful approach to network analysis. Small, local structures are counted and interpreted. This chapter is a short tour round selected domains in which motif analysis has been successfully applied so far, with a focus on work in which the author’s research group has been involved.

Keywords: Null Model; Motif Signature; Directed Network; Motif Analysis; Real Text (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-24971-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().