TY - GEN
T1 - The role of motifs in understanding behavior in social and engineered networks
AU - Braines, Dave
AU - Felmlee, Diane
AU - Towsley, Don
AU - Tu, Kun
AU - Whitaker, Roger M.
AU - Turner, Liam D.
N1 - Publisher Copyright:
© 2018 SPIE. Downloading of the abstract is permitted for personal use only.
PY - 2018
Y1 - 2018
N2 - Within networks one can identify motifs that are significant recurring patterns of interaction between nodes. Here motifs are sub-graphs that occur more frequently than would be explained by random connections. Graphs can be used to model internal network structures of human groups, or links between groups, with group dynamics being governed by these structures. Graphs can also model behavior in engineered systems, and internal network structures can significantly affect dynamic behavior. A graph may only be partially visible (such as in hostile or coalition environments), however detectable network motifs may in some cases be reflective of the entire graph. We outline a research plan and describe basic network motifs and their properties, along with current analytic techniques for static and dynamic settings. We offer suggestions as to how network motif techniques can be applied to intra- or inter- group behavior, for example to detect whether multiple groups behave as a co-operative alliance, or whether coalition networks inter-operate in positive ways. As an example, we examine a complex time-series graph dataset relevant to coalition focused aspects of the class of networks under study, specifically related to the social network resulting from the authorship of academic papers within a coalition. We provide details of the basic analysis of this network over time and outline how this can be used as one of the datasets for our planned network motif research activities, especially with regards to the temporal and evolutionary aspects.
AB - Within networks one can identify motifs that are significant recurring patterns of interaction between nodes. Here motifs are sub-graphs that occur more frequently than would be explained by random connections. Graphs can be used to model internal network structures of human groups, or links between groups, with group dynamics being governed by these structures. Graphs can also model behavior in engineered systems, and internal network structures can significantly affect dynamic behavior. A graph may only be partially visible (such as in hostile or coalition environments), however detectable network motifs may in some cases be reflective of the entire graph. We outline a research plan and describe basic network motifs and their properties, along with current analytic techniques for static and dynamic settings. We offer suggestions as to how network motif techniques can be applied to intra- or inter- group behavior, for example to detect whether multiple groups behave as a co-operative alliance, or whether coalition networks inter-operate in positive ways. As an example, we examine a complex time-series graph dataset relevant to coalition focused aspects of the class of networks under study, specifically related to the social network resulting from the authorship of academic papers within a coalition. We provide details of the basic analysis of this network over time and outline how this can be used as one of the datasets for our planned network motif research activities, especially with regards to the temporal and evolutionary aspects.
UR - http://www.scopus.com/inward/record.url?scp=85049690404&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049690404&partnerID=8YFLogxK
U2 - 10.1117/12.2309471
DO - 10.1117/12.2309471
M3 - Conference contribution
AN - SCOPUS:85049690404
T3 - Proceedings of SPIE - The International Society for Optical Engineering
BT - Next-Generation Analyst VI
A2 - Llinas, James
A2 - Hanratty, Timothy P.
PB - SPIE
T2 - Next-Generation Analyst VI 2018
Y2 - 16 April 2018 through 17 April 2018
ER -