Joint sequence complexity analysis: Application to social networks information flow

In this paper we study joint sequence complexity and its applications for finding similarities between sequences up to the discrimination of sources. The mathematical concept of the complexity of a sequence is defined as the number of distinct subsequences of it. Sequences containing many common parts have a higher joint complexity. The analysis of a sequence in subcomponents is done by suffix trees, which is a simple, fast, and low complexity method to store and recall them from the memory, especially for short sequences. Joint complexity is used for evaluating the similarity between sequences generated by different Markov sources. Markov models well describe the generation of natural text, and their performance can be predicted via linear algebra, combinatorics, and asymptotic analysis. We exploit datasets from different natural languages, for both short and long sequences, with very promising results. The goal is to perform automated online sequence analysis on information streams, e.g., on social networks such as Twitter. ® 2014 Alcatel-Lucent.