Asymmetry through time dependency
Given a single network of interactions, asymmetry arises when the links are directed. For example, if protein A upregulates protein B and protein B upregulates protein C, then (in the absence of any further relationships between them) A may affect C but not vice versa. This type of imbalance is reflected in the associated adjacency matrix, which will lack symmetry. A different type of imbalance can arise when interactions appear and disappear over time. If A meets B today and B meets C tomorrow, then (in the absence of any further relationships between them) A may pass a message or disease to C, but not vice versa. Hence, even when each interaction is a two-way exchange, the effect of time ordering can introduce asymmetry. This observation is very closely related to the fact that matrix multiplication is not commutative. In this work, we describe a method that has been designed to reveal asymmetry in static networks and show how it may be combined with a measure that summarizes the potential information flow between nodes in the temporal case. This results in a new method that quantifies the asymmetry arising through time ordering. We show by example that the new tool can be used to visualize and quantify the amount of asymmetry caused by the arrow of time.
KeywordsAdjacency Matrix Directed Edge Dynamic Walk Fiedler Vector Inherent Asymmetry
- 1.M.E.J. Newman, Networks: An Introduction (Oxford University Press, 2010) Google Scholar
- 10.G.H. Golub, C.V. Loan, Matrix Computations, 4th edn. (Johns Hopkins University Press, 2012) Google Scholar
- 11.T.A. Davis, Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2) (Society for Industrial and Applied Mathematics, Philadelphia, 2006) Google Scholar
- 14.F. Chung, Spectral Graph Theory (American Mathematical Society, Providence, 1997) Google Scholar
- 15.G. Strang, Computational Science and Engineering (Wellesley-Cambridge Press, 2008) Google Scholar
- 23.A. Duchon, E.S. Patterson, in Social Computing, Behavioral-Cultural Modeling and Prediction (Springer, 2014), pp. 51–58 Google Scholar
- 24.D. Huffaker, J. Wang, J. Treem, M. Ahmad, L. Fullerton, D. Williams, M. Poole, N. Contractor, IEEE Int. Conf. Comput. Sci. Eng. 4, 326 (2009) Google Scholar
- 26.G.G. Grinstein, C. Plaisant, S.J. Laskowski, T. O’Connell, J. Scholtz, M.A. Whiting, VAST 2008 Challenge: Introducing mini-challenges, in IEEE VAST (2008), pp. 195–196 Google Scholar
- 27.D. Taylor, S.A. Myers, A. Clauset, M.A. Porter, P.J. Mucha, arXiv:1507.01266 (2015)
This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.