Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Entropy and complexity unveil the landscape of memes evolution


On the Internet, information circulates fast and widely, and the form of content adapts to comply with users’ cognitive abilities. Memes are an emerging aspect of the internet system of signification, and their visual schemes evolve by adapting to a heterogeneous context. A fundamental question is whether they present culturally and temporally transcendent characteristics in their organizing principles. In this work, we study the evolution of 2 million visual memes published on Reddit over ten years, from 2011 to 2020, in terms of their statistical complexity and entropy. A combination of a deep neural network and a clustering algorithm is used to group memes according to the underlying templates. The grouping of memes is the cornerstone to trace the growth curve of these objects. We observe an exponential growth of the number of new created templates with a doubling time of approximately 6 months, and find that long-lasting templates are associated with strong early adoption. Notably, the creation of new memes is accompanied with an increased visual complexity of memes content, in a continuous effort to represent social trends and attitudes, that parallels a trend observed also in painting art.


Social media radically changed the way we consume information and interact online1,2,3. Online interactions, indeed, influence social dynamics by favoring the formation of homophilic groups around shared narratives and attitudes and thus bursting group polarization4,5,6. In this scenario, multimedia content such as videos, photos, and pictures represents an essential portion of online communication, especially within social media platforms. Online communication can be read through the lenses of Dawkins’ cultural memes7, whose definition applies to almost all online information vehicles. Cultural memes represent a unit of cultural information transmitted and replicated; writing posts, sharing personal videos, expressing “likes” are examples of this concept. While Dawkins’ model of cultural evolution is nowadays considered insufficient to comprehend the complex cultural phenomena of information transmission8,9,10,11, its evolutionary pattern still represents a valid basis for describing fundamental features of memes diffusion. In this work, we investigate the role and evolution of a particular kind of cultural meme, namely template images that undergo modifications or get some text overlapped, conventionally referred to just as memes. In the following, we adopt this convention. According to Dawkins’ hypothesis, cultural memes12 are characterized by the three essential elements of evolutionary theory: replication, variation, and selection. In the case of visual memes, the replication mechanism is self-evident. It consists of modifying an image, e.g., with some text, to represent a given situation. Moreover, replication of memes is facilitated by their consistency with other cultural memes present in the online environment, such as short videos, pictures, or short texts. Variation is an intrinsic feature of visual memes. Indeed, new memes are continuously created to target funny situations or jokes about political or societal events and compete for users’ attention flowing across online communities. Finally, selection occurs when a meme cannot attract human attention nor adapt to transmit new contents and disappears adapting to the fast online environment. Among the online cultural memes that underwent relatively strong selection, we find, for example, blogs and discussion forums that have been replaced mainly by online social media; similarly, the emoji’s introduction strongly reduced the use of ascii art symbols.

So far, a large body of research quantitatively investigated the features of different online cultural memes, not limited to images. Textual memes were analyzed by Leskovec et al.13 as a proxy for the cycle of online news consumption. Ienco et al.14 studied the problem of ranking memes, i.e., selecting those memes to be displayed to users to maximize the network activity on the platform. Romero et al.15 studied online memes propagation in the form of Twitter hashtags. Bauckhage16 investigated the epidemic dynamics of 150 famous memes, applying models from mathematical epidemiology to account for the growth and decline of visual memes. Ratkiewicz and coworkers17 developed a framework for analyzing the diffusion of politics-related tweets. Weng et al.18 studied meme virality through an agent-based approach, accounting for the limited attention each user can spend in online environments. The mechanisms of competition and collaboration among memes, that determine the successful passage of a meme from a generation to another one has been investigated by Coscia19, together with the rules underlying memes popularity20,21. These studies show that the dynamics behind memes (both visual and textual) virality are not linearly dependent upon the adherence to the template of new meme instances. The popularity of memes is investigated also with the underlying network community structure22. Ferrara et al.23 employed clustering techniques to identify text-based memes, leveraging the content, metadata, and network structure of social data. Dang et al.24 used tri-grams to cluster posts from Reddit and track the spreading of memes. Linguistic features25 have been also investigated as predictors for textual memes popularity. Adamic et al.26 explored a large corpus of textual data from Facebook modeling the propagation of information as a Yule process. Scientific memes27 in the form of words were investigated exploring inheritance patterns in the scientific literature. Dubey et al.28 employed a Deep Learning architecture to process memes, extract the underlying template and explore its variations. An extensive analysis of visual memes is performed by Zannettou and coworkers29 exploiting perceptual hashing to cluster visual memes together and explore the connections between the meme content and the communities in which it circulates. In30 a deep-learning classifier for memes is proposed to explore the role of memes instead of non-meme images during elections. These investigations developed relevant insights and tools for handling and researching the world of internet memes. Nevertheless, little attention is given to the fundamental aspects of the evolution of memes in terms of visual features and conveyed information. Eventually, no evidence is reported for the hypothesis of internet memes constituting a metalanguage of the internet10,11.

In this work, we investigate the general evolution pattern of memes as an online communication artifact. To this aim, we leverage the evolutionist approach to define and measure the evolution rate, i.e., the number of new templates that appear online per time unit, the variation rate, i.e., the number of new instances of the same template that are produced in time; this quantity is particularly relevant concerning memes’ popularity. As artistic expressions have been effectively investigated exploiting network science and physics concepts31, we compute the trajectory of memes in the entropy-complexity plane. Specifically, these measures, grounded on the physics of complex systems, have been employed to investigate painting arts32, revealing a temporal pattern towards higher complexity.

The basis of this investigation is a massive dataset of 2 million Reddit memes over ten years. Each image has been classified and ascribed to a template through a Machine Learning pipeline composed by an unsupervised Deep-learning based classifier followed by a density-based clustering algorithm (see Methods). Our investigation shows that the memes ecosystem size is exponentially increasing, with a doubling time of approximately six months, indicating that replication is currently the leading process. Concerning selection, we observe that memes’ persistence is dominated by rapid early adoption. The variation pattern is captured by the trajectory in the entropy–complexity plane. Similarly to what happens in painting arts, we observe a tendency towards structures with increasing visual complexity; early memes were made up of simple foreground images (e.g., animals or explicit human expressions) on plain backgrounds, while later ones involve more articulated scenes (e.g., modified movie frames).

As cultural signs, memes are strictly connected to the broader cultural system in which they are embedded. While their ultimate theoretical definition is still elusive and debated in terms of methodological frames, our results indicate that memes appear as one of the most productive and adaptable areas of digital communication, functioning as a metalanguage of cultural dynamics and evolving in progressive forms of textual complexity.


Our study starts from Dawkins’ hypothesis of the meme as the basic unit of cultural evolution, in connection with the post-memetics analyses of memes as cultural signs. We studied the evolution of Internet visual memes, i.e. images with (typically) overlapped text strings over a time span of 10 years. The dataset comprises around 2 million images, that were grouped together exploiting an unsupervised Machine Learning routine (see Methods). Such an extended dataset enables us to investigate some properties of this particular cultural meme. The clusters retrieved by our procedure correspond to the templates of the various memes. In the following, we refer to “meme” as for the template, while each image belonging to a given template is an “instance” of the meme.

To quantify the growth of memes adoption we computed their evolution rate. For each cluster, we store the creation time of its first instance. Next, per each week of sampling, we compute the number of new templates. The result is reported in Fig. 1, in which the growth rate is estimated by an exponential fit, giving a doubling time for the number of templates \(T\sim 6\,\text {months}\). The sudden drop in the plot is a finite size effect of the dataset. Namely, for subreddits r/memes and r/dankmemes it has not been possible to download the data over 2019, due to the exponential trend in the number of memes (see Fig. 4). The fit was performed considering the data until January 2019.

Figure 1

Evolution rate of internet memes. The number of new templates per each month is reported as a function of time. The growth rate is estimated through an exponential fit, with a doubling time of \(T\sim 6\) months.

Another relevant quantity in terms of cultural evolution is the mutation rate. The mutation rate can be approximated by looking at the instances of each meme. For each template we computed the distribution of the differences (\(\Delta t\)) between the creation times of an instance and the following one. This distribution reveals the nature of growth of each cluster: a distribution skewed towards low values of \(\Delta t\) corresponds to a very fast and bursty growth dynamic. Conversely, larger values of \(\Delta t\) may reveal a more persistent template, whose instances occur more spaced in time. In Fig. 2 the distribution of the “inter-instance” times (blue histograms, left column) is reported together with the clusters lifetime distribution (orange histograms, right column) i.e. the time interval between the first and the last instance of a given meme. These distributions are computed for different typical cluster sizes (indicated as CS).

Figure 2

Mutation rate of memes. Left column: distribution of instances’ inter-arrival times (\(\Delta t\)); central column: lifetime distribution of memes; right column: exemplary growth curve of meme adoption. Each row correspond to a typical size of meme cluster. Interestingly, the larger the cluster size the longer the lifetime. However, long lasting memes template shows skewed distributions for the inter-arrival times (\(\Delta t\)). This highlights the tendency of long lasting memes to undergo strong early adoption.

Overall, lifetime results positively correlated with cluster size. Small clusters show a heterogeneous distribution of instances’ inter-arrival times, comprising both small-bursty clusters and small-slowly paced ones. The lifetime is peaked towards low values. This behaviour is also shown by very recent clusters whose actual size cannot be estimated within our dataset, as their evolution is ongoing. As the cluster size grows, we observe a shift of the inter-times distribution towards low values, unveiling faster dynamics, while the lifetime distribution is concentrated around larger values. By looking the corresponding growth curves we observe an ensemble of trajectories that tend to display a fast initial build up of popularity, followed by a slower diffusion that determines the longer lifetime values. Conversely there are also examples of memes that takes more time to reach a wide popularity. This aspect may be due to non-trivial popularity dynamics, calling for further research.

Following Sigaki et al.32, we investigated the evolution of memes in the entropy-complexity plane. For each meme instance we computed the values of H(P) and C(P) and then averaged the obtained values by year. The results are reported, for each subreddit, in Fig. 3. We observe that each community moves towards higher complexity values, except for r/AdviceAnimals, whose posting rules limit the natural evolution of produced memes; this effect could be also linked to the overall decrease in memes production observed for this community. Interestingly, also paintings followed a similar trajectory in the entropy-complexity plane: quite localized along the entropy axis, but shifting towards higher complexity in time.

Figure 3

Trajectories in entropy-complexity plane for the four Reddit communities. All, except r/AdviceAnimals present an evolution towards higher values of complexity that resembles that of painting arts32. Each dot is the average value of entropy and complexity for each year. Visually complex templates could be linked to the tendency of using memes to continuously represent social trends and attitudes, supporting the hypothesis that memes are part of the emerging internet meta-language.

The tendency of memes to evolve towards more complex structures can be explained considering this object as part of the emerging internet meta-language. In fact, memes are used to quickly vehicle context-specific content, which in turn evolves towards more and more specific templates. This may lead to a segregation effect, with a specific dialect depending on the community in which a meme is shared. In fact a meme created for a specific community, e.g. gaming community, does not have to be universally comprehensible across the web. This aspect leads to the use of more complex and specific patterns.


The Internet provides an environment in which information quickly spreads and adapts to comply with users’ cognitive abilities. A foundational question about memes is whether they present culturally and temporally transcendent characteristics in their organizing principles and how they evolve. Such a significant increase and spread of visual memes can be read under the light of post-memetics theories. Visual memes are favored by the rapid, fluid, continuously changing internet environment because of their simplicity, ease of handling and broad applicability in terms of subjects and situations. We find support for the hypothesis that memes are part of an emerging form of internet metalanguage: on one side, we observe an exponential growth with a doubling time around 6 months; on the other side, the complexity of memes contents increases, allowing to timely represent social trends and attitudes. Our analysis shows that memes are relational entities functioning as flexible elements of a metalanguage that de-codifies and re-codifies the cultural system. They appear as fundamental components of an organic process that affects and conditions the digital environment and produces evolving forms of visual and textual complexity.


Data breakdown

Reddit is an online social media platform that aggregates users in communities of interest. In the last years, it has been widely employed to perform academic research on online communities, and the number of active users on this platform is constantly increasing33.

The visual memes used as dataset for this study were downloaded through the Pushshift Reddit Dataset34, selecting four communities (subreddits) explicitly devoted to share and discuss about memes, namely: r/AdviceAnimals, r/memes, r/CemeteryComedy and r/dankmemes. Data were collected considering a ten years window, from 2011 to 2020. In Fig. 4 the number of downloaded posts per each community is reported, as function of time. Not all the communities started their activity simultaneously. A list of all images urls employed in this study is available online35.

Figure 4

Dataset used in this work. Each curve shows the number of posts per month that were downloaded from Reddit. Each posts correspond to an image. The total amount of downloaded memes is about 2 million.


One of the main features of visual memes is their recurrent nature: starting from an initial template, memes are produced through text or image modifications resulting each time in a new instance that stems from the original template. To measure the evolution and variation rate of visual memes, it is crucial to cluster them according to the underlying template. As the collected number of memes is about two million, such a large amount of images calls for automatic classification methods.

Our unsupervised clustering procedure is divided into two steps: first, we apply, to our knowledge, the state of the art Deep Learning implementation for unsupervised image clustering, that is called SCAN36 (Semantic Clustering by Adopting Nearest neighbors), followed by a further clustering procedure through the HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) algorithm37.

Specifically, the SCAN algorithm works in two steps. In the first one, self-supervised learning is used to train a neural network with parameters \(\vartheta \) that maps images (\(x_i, i=1\dots N\)) into feature representations \(\phi _\vartheta (x_i)\in {\mathbb {R}}^d \). Therefore, each image is represented by a vector of dimension d, with d being the dimension of the embedding space carrying semantically meaningful information about its content. The parameters \(\vartheta \) are determined by minimizing the loss function given by the distance \(\delta \) between the representation of the image and the representation of their augmentations:

$$\begin{aligned} \min _\vartheta \delta (\phi _\vartheta (x_i),\phi _\vartheta (T[x_i]))\,. \end{aligned}$$

The augmentation of an image may be a rotation, an affine or perspective transformation, etc.

In the second step, a neural network with parameters \(\eta \) is used to classify an image \(x_i\) and its nearest neighbors sampled exploiting its corresponding representation \(\phi _\vartheta (x_i)\). As the second task is a classification, the output is a probability distribution over the considered classes for the given image: \(\phi _\eta (x)\in [0,1]^C\), where C is the number of clusters considered.

The loss function, in this case, is made of two terms

$$\begin{aligned} \begin{aligned} \Lambda&= -\frac{1}{|{\mathscr {D}}|} \sum _{x\in {\mathscr {D}}}\sum _{k\in {\mathscr {N}}_x}\langle \phi _\eta (x),\phi _\eta (k)\rangle + \lambda \sum _{x\in {\mathscr {C}}} \phi '^c_\eta \log (\phi '^{c}_\eta )\,, \\&\quad \text {with} \qquad \phi '^{c}_\eta = -\frac{1}{|{\mathscr {D}}|} \sum _{x\in {\mathscr {D}}} \phi _\eta ^c(x)\,, \end{aligned} \end{aligned}$$

where \({\mathscr {D}}\) is the dataset comprising all images, \({\mathscr {N}}_x\) is the set of nearest neighbors of image x, \({\mathscr {C}}\) is the set of clusters, and \(\langle \cdot \rangle \) is the dot product. The first term aims to maximize the probability that the image and its nearest neighbors are classified in the same class. The second term avoids the formation of a single cluster containing all the images and forces the spread of the predictions uniformly across the clusters. Eventually, for each processed image, we get a representation vector of size \(d=2048\) and a set to which it belongs.

The SCAN algorithm provides us with an informative and compact representation for each image in our dataset together with a first, high-level clustering. SCAN divides the corpus into four clusters that group the visual memes into three broad and general categories: animals (two sets), humans, and others. The two clusters with animal images have been merged together. In other words, memes containing humans represent the 50% of the corpus, followed by 25% of animals and 25% of other kind of contents.

To obtain a template-based clustering, we exploited HDBSCAN37,38. For each high-level cluster obtained from SCAN, the entire corpus of memes can be represented by a matrix whose rows are the representations \( \phi _\vartheta (x_i)\). To make the problem computationally more tractable, Principal Component Analysis was used to reduce the features’ dimension from 2048 to 20. This allowed us to better fit our computational resources and did not cause any reduction in the quality of the clustering. By applying HDBSCAN to such a matrix, we were able to get a label for each image of our corpus and to separate the memes by their template. Notably, HDBSCAN can separate clusters from noisy points. Part of the corpus does not belong to any template, and therefore is marked as noise and grouped in a large “cluster of noise”. Despite this suitable property of the algorithm, some clusters may result made up of images whose template is not the same for all. A purity measurement is therefore required to exclude from the analysis too heterogeneous clusters, i.e. clusters below a given purity threshold.

In a completely unsupervised framework, the quality of clustering is in general not easy to evaluate39. A quantity that is usually employed as an objective function for clustering is the average-pairwise distance \({\overline{S}}_k\), which evaluates the intra-cluster homogeneity40, i.e. how much each element of the cluster is, on average, similar to all the others. Its definition is given by

$$\begin{aligned} {\overline{S}}_k = \frac{1}{N_k^2}\sum _{x_i,x_j \in {\mathscr {C}}_k}^{N_k} ||\phi _\vartheta (x_i)-\phi _\vartheta (x_j) ||^2\,. \end{aligned}$$

In our case, we employed the latter quantity to measure the purity of the clusters identified by HDBSCAN, together with the cluster size. In Fig. 5(a) for each cluster is reported \({{\overline{S}}}_k\) and the cluster size. The red dots are the clusters that are not considered for the following analysis. Four of them correspond to the “noisy clusters” retrieved by HDBSCAN. All of them result in outliers with respect to the joint size and \({{\overline{S}}}_k\) distribution, whose marginals distributions are reported in panels (b) and (c) respectively. HDBSCAN performances depends upon several parameters. We used mainly default values, setting min_cluster_size and min_samples to 20 and 3, respectively.

Figure 5

Panel (a): joint distribution of average-pairwise distance \({{\overline{S}}}\) and cluster size. Each dot corresponds to a cluster, i.e. a template for memes. Red dots represent “noisy clusters” identified by HDBSCAN that are outliers with respect to the cluster size and \({\overline{S}}_k\) distributions, shown respectively in panels (b) and (c). Noisy clusters are removed from the analysis.

Entropy and complexity

Permutation entropy H and statistical complexity C are two quantities that can be used to synthesize general properties of images, based on the value and relative disposition of their pixels. In the following, we give a minimal description of both quantities, and we refer the reader to original articles for more formal details41,42,43,44,45. Permutational entropy measures the degree of disorder in the pixel arrangement. High values indicate high pixel randomness, while low values correspond to more regular patterns. Statistical complexity instead measures the amount of “structural” complexity. Non-trivial spatial patterns give rise to positive values, while extremely ordered or disordered patterns correspond to low values.

To compute H and C all colored images were converted to grayscale. Thus, each image consists of two-dimensional matrix. Next, for all the \(2\times 2\) submatrices comprised in the image the relative ordering of the pixel is computed32. For a collection of four elements, a number of \(4!=24\) possible permutations can be obtained. By counting the relative occurrence of each permutation, a probability mass function

$$\begin{aligned} P = \{p_1\dots p_N\}\qquad \text {with}\qquad \sum _{i=1}^N p_i=1\,, \end{aligned}$$

can be built. Shannon’s entropy is then computed over this probability distribution to obtain the permutation entropy

$$\begin{aligned} H(P) =\frac{S(P)}{\log (N)} = \frac{1}{\log (N)}\sum _{i=1}^N p_i\log \left( \frac{1}{p_i}\right) \,. \end{aligned}$$

Given the probability mass function P, its discrepancy with respect to a uniform distribution U

$$\begin{aligned} U = \{u_1\dots u_N\}\qquad \text {with}\qquad \sum _{i=1}^N u_i=1\,, \end{aligned}$$

is obtained by computing the Jensen-Shannon divergence

$$\begin{aligned} D(P,U)= S\left( \frac{P+U}{2}\right) -\frac{S(P)}{2}-\frac{S(U)}{2}\,. \end{aligned}$$

Combining this quantity with H(P), the statistical complexity can be computed as

$$\begin{aligned} C(P)=\frac{D(P,U)\, H(P)}{D^*}\,, \end{aligned}$$

with the normalizing factor

$$\begin{aligned} D^* = \max _P D(P,U) = -\frac{1}{2}\left[ \frac{N+1}{N}\log (N+1)+\log (N)-2\log (2N) \right] \,. \end{aligned}$$

The evolution of visual patterns can be studied as a trajectory in the above defined entropy-complexity plane42,43, following the same approach used for paintings32.

Data availability

The list of all the images used in this study is available online35. Software used for computations are all properly referenced in the main text.


  1. 1.

    Vicario, M. D. et al. The spreading of misinformation online. Proc. Natl. Acad. Sci. 113, 554–559 (2016).

    ADS  Article  CAS  Google Scholar 

  2. 2.

    Schmidt, A. L., Zollo, F., Scala, A., Betsch, C. & Quattrociocchi, W. Polarization of the vaccination debate on facebook. Vaccine 36, 3606–3612 (2018).

    Article  Google Scholar 

  3. 3.

    Sunstein, C. R. # republic (Princeton University Press, New York, 2017).

    Book  Google Scholar 

  4. 4.

    Del Vicario, M. et al. Echo chambers: Emotional contagion and group polarization on facebook. Sci. Rep. 6, 1–12 (2016).

    Article  CAS  Google Scholar 

  5. 5.

    Cinelli, M., Morales, G. D. F., Galeazzi, A., Quattrociocchi, W. & Starnini, M. The echo chamber effect on social media. Proc. Natl. Acad. Sci. 118, e2023301118 (2021).

    Article  CAS  Google Scholar 

  6. 6.

    Bail, C. A. et al. Exposure to opposing views on social media can increase political polarization. Proc. Natl. Acad. Sci. 115, 9216–9221 (2018).

    Article  CAS  Google Scholar 

  7. 7.

    Dawkins, R. 28. The Selfish Gene 140–142 (Princeton University Press, New York, 2014).

    Google Scholar 

  8. 8.

    Deacon, T. W. Editorial: Memes as signs: The trouble with memes (and what to do about it). Semiot. Rev. Books 10, 1–3 (1999).

    Google Scholar 

  9. 9.

    Sebeok, T. A. & Danesi, M. The Forms of Meaning (De Gruyter, Cambridge, 2000).

    Book  Google Scholar 

  10. 10.

    Cannizzaro, S. Internet memes as internet signs: a semiotic view of digital culture. Sign Syst. Stud. 44, 562–586 (2016).

    Article  Google Scholar 

  11. 11.

    Fomin, I. Memes, genes, and signs: Semiotics in the conceptual interface of evolutionary biology and memetics. Semiotica 2019, 327–340 (2019).

    Article  Google Scholar 

  12. 12.

    Distin, K. The Selfish Meme (Cambridge University Press, Cambridge, 2004).

    Book  Google Scholar 

  13. 13.

    Leskovec, J., Backstrom, L. & Kleinberg, J. Meme-tracking and the dynamics of the news cycle. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD ’09, 497–506 (ACM Press, 2009).

  14. 14.

    Ienco, D., Bonchi, F. & Castillo, C. The meme ranking problem: Maximizing microblogging virality. In 2010 IEEE International Conference on Data Mining Workshops, 328–335 (IEEE, 2010).

  15. 15.

    Romero, D. M., Meeder, B. & Kleinberg, J. Differences in the mechanics of information diffusion across topics. In Proceedings of the 20th international conference on World wide web - WWW ’11, 695–704 (ACM Press, 2011).

  16. 16.

    Bauckhage, C. Insights into internet memes. In Proceedings of the International AAAI Conference on Web and Social Media Vol. 5 42–49 (2011).

  17. 17.

    Ratkiewicz, J. et al. Truthy: mapping the spread of astroturf in microblog streams. In Proceedings of the 20th international conference companion on World wide web - WWW ’11, 249–252 (ACM Press, 2011).

  18. 18.

    Weng, L., Flammini, A., Vespignani, A. & Menczer, F. Competition among memes in a world with limited attention. Sci. Rep. 2, 335 (2012).

    ADS  Article  CAS  Google Scholar 

  19. 19.

    Coscia, M. Competition and success in the meme pool: a case study on (2013).

  20. 20.

    Coscia, M. Average is boring: How similarity kills a meme’s success. Sci. Rep. 4, 6477 (2014).

  21. 21.

    Coscia, M. Popularity spikes hurt future chances for viral propagation of protomemes. Commun. ACM 61, 70–77 (2017).

    ADS  Article  Google Scholar 

  22. 22.

    Weng, L., Menczer, F. & Ahn, Y.-Y. Predicting successful memes using network and community structure. In Proceedings of the International AAAI Conference on Web and Social Media Vol. 8 535–544 (2014).

  23. 23.

    Ferrara, E. et al. Clustering memes in social media. In 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), 548–555 (2013).

  24. 24.

    Dang, A., Moh’d, A., Gruzd, A., Milios, E. & Minghim, R. A visual framework for clustering memes in social media. In 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 713–720 (2015).

  25. 25.

    Tsur, O. & Rappoport, A. Don’t let me be# misunderstood: Linguistically motivated algorithm for predicting the popularity of textual memes. In Proceedings of the International AAAI Conference on Web and Social Media Vol. 9 426–435 (2015).

  26. 26.

    Adamic, L. A., Lento, T. M., Adar, E. & Ng, P. C. Information evolution in social networks. In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, WSDM ’16, 473–482 (Association for Computing Machinery, New York, NY, USA, 2016).

  27. 27.

    Kuhn, T., Perc, M. & Helbing, D. Inheritance patterns in citation networks reveal scientific memes. Phys. Rev. X 4, 041036 (2014).

  28. 28.

    Dubey, A., Moro, E., Cebrian, M. & Rahwan, I. Memesequencer: Sparse matching for embedding image macros. In Proceedings of the 2018 World Wide Web Conference, WWW ’18, 1225–1235 (International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, 2018).

  29. 29.

    Zannettou, S. et al. On the origins of memes by means of fringe web communities. In Proceedings of the Internet Measurement Conference 2018, IMC ’18, 188–202 (Association for Computing Machinery, New York, NY, USA, 2018).

  30. 30.

    Beskow, D. M., Kumar, S. & Carley, K. M. The evolution of political memes: Detecting and characterizing internet memes with multi-modal deep learning. Inf. Process. Manag. 57, 102170 (2020).

    Article  Google Scholar 

  31. 31.

    Perc, M. Beauty in artistic expressions through the eyes of networks and physics. J. R. Soc. Interface 17, 20190686 (2020).

    Article  Google Scholar 

  32. 32.

    Sigaki, H. Y. D., Perc, M. & Ribeiro, H. V. History of art paintings through the lens of entropy and complexity. Proc. Natl. Acad. Sci. 115, E8585–E8594 (2018).

    ADS  Article  CAS  Google Scholar 

  33. 33.

    Medvedev, A. N., Lambiotte, R. & Delvenne, J.-C. The anatomy of reddit: An overview of academic research. In Dynamics On and Of Complex Networks III, 183–204 (Springer International Publishing, 2019).

  34. 34.

    Baumgartner, J., Zannettou, S., Keegan, B., Squire, M. & Blackburn, J. The pushshift reddit dataset. Proc. Int. AAAI Conf. Web Social Media 14, 830–839 (2020).

    Google Scholar 

  35. 35.

    Valensise, C. M. Cdcs repository.

  36. 36.

    Van Gansbeke, W., Vandenhende, S., Georgoulis, S., Proesmans, M. & Van Gool, L. Scan: Learning to classify images without labels. In Proceedings of the European Conference on Computer Vision, 123550273 (2020).

  37. 37.

    Campello, R. J. G. B., Moulavi, D. & Sander, J. Density-based clustering based on hierarchical density estimates. In Advances in Knowledge Discovery and Data Mining, 160–172 (Springer Berlin Heidelberg, 2013).

  38. 38.

    McInnes, L., Healy, J. & Astels, S. hdbscan: Hierarchical density based clustering. J. Open Sour. Softw. 2, 205 (2017).

    ADS  Article  Google Scholar 

  39. 39.

    Mehta, P. et al. A high-bias, low-variance introduction to machine learning for physicists. Phys. Rep. 810, 1–124 (2019).

    ADS  MathSciNet  Article  Google Scholar 

  40. 40.

    Rokach, L. & Maimon, O. Clustering methods. In Data Mining and Knowledge Discovery Handbook, 321–352 (Springer-Verlag).

  41. 41.

    Bandt, C. & Pompe, B. Permutation entropy: A natural complexity measure for time series. Phys. Rev. Lett. 88, 174102 (2002).

    ADS  Article  CAS  Google Scholar 

  42. 42.

    López-Ruiz, R., Mancini, H. & Calbet, X. A statistical measure of complexity. Phys. Lett. A 209, 321–326 (1995).

    ADS  Article  Google Scholar 

  43. 43.

    Ribeiro, H. V., Zunino, L., Lenzi, E. K., Santoro, P. A. & Mendes, R. S. Complexity-entropy causality plane as a complexity measure for two-dimensional patterns. PLoS ONE 7, e40689 (2012).

    ADS  Article  CAS  Google Scholar 

  44. 44.

    Zunino, L. & Ribeiro, H. V. Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane. Chaos, Solitons & Fractals 91, 679–688 (2016).

    ADS  MathSciNet  Article  Google Scholar 

  45. 45.

    Rosso, O. A., Larrondo, H. A., Martin, M. T., Plastino, A. & Fuentes, M. A. Distinguishing noise from chaos. Phys. Rev. Lett. 99, 154102 (2007).

    ADS  Article  CAS  Google Scholar 

Download references

Author information




C.M.V. performed research; C.M.V., A.S., M.C. and W.Q. designed research; all authors participated to internal revision and wrote the paper.

Corresponding author

Correspondence to Carlo M. Valensise.

Ethics declarations

Competing interest

The authors declare no competing interests.

Additional information

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Valensise, C.M., Serra, A., Galeazzi, A. et al. Entropy and complexity unveil the landscape of memes evolution. Sci Rep 11, 20022 (2021).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.


Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing