{'fraction_non_alphanumeric': 0.024054982817869417, 'fraction_numerical': 0.001145475372279496, 'mean_word_length': 5.37956204379562, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Synchronization and convergence of linear dynamics in random directed networks

Recently, methods in stochastic control are used to study the synchronization properties of a nonautonomous discrete-time linear system x(k+1)=G(k)x(k) where the matrices G(k) are derived from a random graph process. The purpose of this note is to extend this analysis to directed graphs and more general random graph processes. Rather than using Lyapunov type methods, we use results from the theory of inhomogeneous Markov chains in our analysis. These results have been used successfully in deterministic consensus problems and we show that they are useful for these problems as well. Sufficient conditions are derived that depend on the types of graphs that have nonvanishing probabilities. For instance, if a scrambling graph occurs with nonzero probability, then the system synchronizes.