1. Acar, E, Dunlavy DM, Kolda TG (2009) Link prediction on evolving data using matrix and tensors factorizations In: ICDMW’09: Proceedings of the 2009 IEEE International Conference on Data Mining Workshop, 262–269. doi:
10.1109/ICDMW.2009.54
.
2. Achlioptas, D, Karnin ZS, Liberty E (2013) Near-optimal entrywise sampling for data matrices. In: Burges CJC, Bottou L, Welling M, Ghahramani Z, Weinberger KQ (eds)Advances in Neural Information Processing Systems, 1565–1573.. Curran Associates, Inc., Red Hook, NY,.
3. Arora, S, Hazan E, Kale S (2006) A fast random sampling algorithm for sparsifying matrices In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 272–279.. Springer-Verlag, Berlin.
4. Arrigo, F, Higham DJ (2017) Preserving Sparsity in Dynamic Network Computations. In: Cherifi H, Gaito S, Sala A (eds), 147–157.. Springer, Cham. doi:
10.1007/978-3-319-50901-3_2
.
5. Chen, I, Benzi M, Chang HH, Hertzberg VS (2016) Dynamic communicability and epidemic spread: a case of study on the empirical dynamic contact network. J Complex Netw. doi:
10.1093/comnet/cnw17
.