## Abstract

Networks are a powerful abstraction with applicability to a variety of scientific fields. Models explaining their morphology and growth processes permit a wide range of phenomena to be more systematically analysed and understood. At the same time, creating such models is often challenging and requires insights that may be counter-intuitive. Yet there currently exists no general method to arrive at better models. We have developed an approach to automatically detect realistic decentralised network growth models from empirical data, employing a machine learning technique inspired by natural selection and defining a unified formalism to describe such models as computer programs. As the proposed method is completely general and does not assume any pre-existing models, it can be applied “out of the box” to any given network. To validate our approach empirically, we systematically rediscover pre-defined growth laws underlying several canonical network generation models and credible laws for diverse real-world networks. We were able to find programs that are simple enough to lead to an actual understanding of the mechanisms proposed, namely for a simple brain and a social network.

## Introduction

Increasingly many scientific domains rely on the concept of networks to represent an observable state of a system, where networks are usually seen as the outcome of a generative process. For systems without centralised control, these generative processes consist of local interactions between entities, be they proteins, neurons, organisms, people or organisations.

While current technological advances have been making it increasingly easy to collect datasets for large networks, it is difficult to extract models from this data. This difficulty can be attributed both to the sheer size of the datasets and to the non-linear dynamics of many of these decentralised systems, which resist reductionist methodologies. Another difficulty is posed by the mapping between generative models and observable networks since there is a many-to-many correspondence between generative models and observable networks. A network may be explained by different models and a model – provided it is stochastic in nature – may be capable of generating different classes of networks due to the amplification of initial random fluctuations.

Following conventional scientific methodology, researchers devise models that can account for a network and then test the quality of the model against a number of metrics. Much-cited examples include preferential attachment^{1}, competition between nodes^{2,3}, team assembly mechanisms^{4}, random networks with constraints^{5,6,7}, *inter alia*. Models are typically based on intuition or prior evidence that such and such process appears to be particularly important in the formation of interactions. A problem here is that of human bias in looking for good models. There is always the possibility that high-quality models are counter-intuitive, and thus unlikely to be proposed by researchers.

The work we report in this paper work is aligned with the idea of creating *artificial scientists*. Parts of the scientific method are automated, namely the generation and refinement of hypothesis, as well as their testing against observables. For example, in a work with some parallels to the ideas presented in this paper, scientific laws are extracted from experimental data using genetic programming^{8}.

There have been some preliminary attempts at using genetic programming to search for network models^{21,22,23}, and to structural analysis and community detection^{24}. However, to the best of our knowledge, we provide the first proof-of-concept application of symbolic regression to discover and select plausible morphogenetic processes for real-world networks. The method we propose can be applied to both synthetic networks and on real-world networks. In the case of synthetic networks, it makes it possible to discover the exact generative rule used to construct the particular type of network in question, while in the case of real-world networks, it proposes a generative rule that robustly reproduces the original topological features. Furthermore, in contrast with previous works, our approach relies only on local information and uses a parameter-free fitness function without any *ad-hoc* assumptions. It eventually provides a straightforward mapping to mathematical expressions. A more detailed comparison to^{22,23} is provided in the supplemental materials.

## Results

### Generator search

Machine learning techniques can be used to help researchers generate alternative models that are capable of reproducing networks with certain topological features. The approach we propose employes *genetic programming*^{13,14}, a form of *evolutionary computation*. Genetic programming is a type of search inspired by natural selection where evolutionary pressure is created to guide a population of solutions to increasingly higher quality. In this case the individuals in the population are network generative models, and the quality measure is how much a synthetic network generated by a model approximates the real observable network.

Two fundamental issues have to be addressed in implementing this technique. Firstly, the models need to have a representation that is uniform and permits recombination. Secondly, an appropriate measure of similarity needs to be defined so that synthetic and real-world networks can be compared.

The first issue touches on a shortcoming in the current literature on “network science”: there is no unified and elegant way of formally representing network generative processes. To address this we introduce the concept of *network generator as a computer program* which, for the purposes of this article, we refer to simply as *generators*. We define a network generative process as a sequence of discrete steps where a new arc is created at each step. The process can be straightforwardly applied to both directed and undirected networks. At any given moment, there is a set of possible arcs that could be created. A generator becomes fully defined if it provides a way to prefer some arc over the others. Instead of attempting to define a deterministic selection process we create a stochastic one — recognising that many of the generative processes that produce networks have some degree of intrinsic randomness.

The generator is thus a function *w*(*i*, *j*) that assigns a weight *w _{i j}* to all arcs (

*i*,

*j*) from a random sample

*S*(see Methods). At each network construction step, a new arc is then stochastically selected with a probability

*P*proportional to

_{i j}*w*such that: where if

_{i j}*w*> 0, 0 otherwise. If all the weights for a sample are zero, they are all set to 1 to avoid division by zero in the above probability expression.

_{i j}The core of our approach then consists in designing a process able to automatically discover weight computation functions *w* which produce realistic networks. Generators are represented as *tree-based computer programs*, which are equivalent to mathematical expressions. Tree leaves are variables and constants, and its other nodes are operators. These are the building blocks of our generators (see figure 1). The set of available operators includes simple arithmetic operators: {+, −, *, /}, general-purpose mathematical functions: {*x ^{y}*,

*e*, log, abs, min, max}, conditional expressions: {>, <, = , = 0} and an affinity function (ψ). Variables contain information specific to the two vertices participating in the arc: in- and out-degrees (k and k′), undirected, directed and reverse distances between the two vertices (d, d

^{x}_{D}and d

_{R}) and their sequential identifiers (

*i*and

*j*). In the case of undirected networks only k, d,

*i*and

*j*are used. Sequential identifiers and the related affinity function will be discussed later on.

We rely on a random walk-based heuristic distance: not only would the explicit computation of all exact pairwise distances during the generative process be too computationally expensive, but perhaps more importantly, new connections are also likely to be accurately construed as a hop-by-hop navigation mechanism instead of a selection process based on an omniscient distance value (see Supp. Info.).

This simple arrangement configures a uniform language to describe generators capable of expressing entity-level behaviours that produce non-linear, non-centralised network growth processes.

The second issue of measuring network similarity is addressed by comparing a set of conventional features of both networks. We combine distributions that describe simple aspects of the network, such as in- and out- degree, direct and reverse PageRank^{9} centralities (considering actual and, respectively, inverted arcs), with distributions describing finer and more mesolevel aspects of the structure, such as directed/undirected distances and triadic profiles^{10}.

These features are reduced to metrics by computing dissimilarities between the respective distributions. We rely on two notions of distribution dissimilarities. For degree and PageRank centralities we apply the *Earth mover's distance (EMD)*^{11}, for the more sophisticated distance distributions and triadic profiles we rely on a simpler ratio-based dissimilarity metrics (see Supp. Material for a longer discussion). These dissimilarity metrics allow us to determine whether we are converging towards the original distributions at a small computational cost (other dissimilarity metrics may well be used, but we found these to work well in our case).

We are interested in minimising all of the dissimilarity measures to get as close as possible to the target (real) network. This configures a multi-objective optimisation problem with possible trade-offs since some dissimilarities might need to be minimised at the expense of others. Our objective is to find a balanced solution and employ the following simple strategy: we decide to place all metrics on the same scale and configure their meaning as the improvement with respect to a random network. In practice, each dissimilarity between the target network and a candidate network is divided by the mean dissimilarity between the target network and 30 Erdős-Rényi (ER) random networks with the same number of vertices and arcs as the target. For a given metric, this means that if the dissimilarity between the target network and the ER average is, say, 5 and the distance from the target network to the candidate network is 3, the ratio is 3/5. A ratio of 1 thus corresponds to no improvement. The evolutionary algorithm then tries to improve models by minimising the highest of these ratios, which thereby defines a fitness function.

While ER is assuredly a basic null model, opting for a more sophisticated model may induce undesired bias: for instance, using the configuration model would precisely incorporate the degree distributions of the target network, making it impossible to directly approximate it using the fitness function.

A further feature of our framework is to not assume homogeneity between nodes, irrespective of their structural position. A heterogeneous model is one that starts with the assumption that not all entities in the system behave the same. For example, in a social network, some agents might be intrinsically more likely to form ties. Or they might be more likely to interact within a specific class of agents. We introduce heterogeneity by way of the sequential identifier input variable *i* ∈ {1, … *n*}. These indices, considered as *identifiers*, can then be passed by variable to the generator programs, and used to introduce *a priori* distinctions in behaviours. Let us consider a simple example: This equation describes a generator where the probability of an arc is completely determined by the identifier of the origin vertex. It describes a situation where nodes have different *a priori* propensities to originate connections. Furthermore, it tells us that these propensities are distributed following a hyperbolic curve. Even though integer identifiers may appear to be a highly simplistic means of introducing heterogeneity, we need to remember that they can be combined with the other building blocks in an infinity of ways. In the below results from real-world networks we can see that some of the generators that were found make use of the indices in various ways.

Indeed, the simplicity of building blocks can be leveraged and used to facilitate the definition of generators where certain vertices have natural affinity for each other. This is the *affinity* function *ψ*, which uses the modulo operation (remainder of the division of one number by another) to divide the sequence identifier space into a number of *g* groups, returns *a* if target and origin nodes *i* and *j* belong to the same group (i.e. in case of “affinity”), and *b* otherwise: From now on, we will consider *i* and *j* to be implicit parameters and write the function simply as: ψ(*g*, *a*, *b*).

We now have a methodological framework that we can use to generate plausible models for network generators. Several runs on the same target network may generate different models — although we will show experimental evidence that they tend to converge on the same behaviors. It is now up to the researcher to select amongst them, possibly using his domain knowledge. A more objective consideration is the trade-off between simplicity and precision. Our representation of generators allows for a very straight-forward measure of model complexity: the *program length*. Trivially, the program length is an upper bound on the *Kolmogorov complexity*^{15} of the model. This allows us to apply a quantified version of *Occam's Razor*: all other things being equal, choose the model with the lowest program length. In practice, depending on the variations in precision, the researcher might wish to sacrifice some parsimony for some precision, or vice-versa.

## Application to real and synthetic networks

To assess our method we start by testing if we can discover generators for networks that were produced by generators we defined ourselves. According to our generator semantics, two classical network types can be defined in a very succinct fashion.

For an ER random network, where *c* is any constant value; for a generator based on Preferential Attachment (PA) as in the Barabási-Albert model, We used these two generators to produce networks of five different sizes, from 100 vertices and 1000 arcs to 500 vertices and 5000 arcs. We generated 30 networks for each size/generator combination and performed an evolutionary search runs on each one of them. We found a correct results rate of 97.3% for preferential attachment and 94% for random. In the preferential attachment case, the precise solution with no bloat (*w* = *w*_{PA}) was found 92.7% of the time. In the random network case, the precise solution with no bloat (*w* = *w*_{ER}) was found 76.7% of the time. Interestingly, this result on a series of stochastic realisations of the ER and PA models is a strong indication that a real network which does not lead to the discovery of *w*_{ER} or *w*_{PA} obeys a more sophisticated morphogenesis process (see Supp. Info. for detailed results).

We then proceeded to experiment with seven datasets from a diverse selection of real-world contexts: the neural network of a C. Elegans roundworm^{16,17}, a network of political blogs^{18}, a software collaboration network (http://cpan-explorer.org/category/authors/, date of access: 10/03/2014), the power grid of the Western States of the USA^{17}, a social network extracted from the neighbourhood of a single Facebook user^{19}, a network of protein interactions in Homo Sapiens^{20} and a word adjacencies network^{27}. The first three are directed while the latter four are undirected.

Figure 2 shows an overview of the results we obtained, featuring the expression of the best program found after the 30 evolutionary runs, as well as a comparison between the corresponding synthetic network and original (target) network. Figure 3 focuses on C. Elegans and shows a comparison of the various distributions we use in our fitness function for the real network, a sample of 30 random networks with the same number of nodes and arcs, and a sample of 30 synthetic networks produced by the best generator we found for that network. Given the stochastic nature of the generative process, multiple runs of the same generator can produce different results. The figure shows that, in practice, variance is very small. Similar approximations were obtained for the other networks.

We provide an interpretation of each one of these generators in the Supplemental Materials.

While these are high quality solutions according to the set of metrics we defined, another question is whether high-quality solutions generated by our method are similar to each other or represent completely different models. To investigate this issue we defined a process to quantify the similarity between two generators – let us call them generators *w* and *w*′. We produce a network using generator *w* and, at each arc creation step, for each sample of candidate arcs, we also compute the probability of each candidate using generator *w*′. We then compute the mean distance between the probabilities assigned by generators *w* and *w*′ to all the candidate arcs during the entire generative process. We thus get a dissimilarity measure between generators which we denote *d _{ww}*

_{′}. Conversely, we produce a network with generator

*w*′ and compare the probabilities with the ones assigned by generator

*w*, obtaining

*d*

_{w}_{′w}. Finally, we consider the (generator) dissimilarity between

*w*and

*w*′ to be

*d*= (

*d*

_{ww}_{′}+

*d*

_{w}_{′w})/2.

In the left panel of figure 4 we compare the (generator) dissimilarity between the optimal generator we found (p27) and all other generators obtained for C. Elegans with the fitness of these generators, i.e. max (network) dissimilarity on all metrics. The Pearson correlation indicates a strong relationship between fitness and similarity to the optimal generator. Furthermore, there is a significant probability that such a correlation exists (*p* < 0.005). On the right panel we also compare the distance with the mean dissimilarity in order to observe generators over all metrics, obtaining the same conclusions. The results we obtain provide compelling evidence that the closer the generators are to the best program in terms of fitness (at the network level), the closer they are in terms of the qualitative behaviour defined by their programs (at the link level), implying that this correlation further strengthens the plausibility of this generator.

Another point to note is that as program distance to the best solution increases, there is an increase in fitness variance. This is not surprising given that an increase in program distance corresponds to a decrease on the constraints on the space of possible programs. All the runs are subject to the same evolutionary pressure to decrease fitness, so it is likely that some become stuck in *local minima* – a common phenomena in heuristic search strategies. In fact, it is not possible to ever be sure that some result is not a *local minima*, but this is also a limitation of the scientific method in general. However, we show that independent runs of our algorithm form a cluster of high quality results with respect to generator similarity. There is a degree of convergence on a consensus that facilitates the task of choosing between competing theories.

## Discussion

We proposed a methodology to describe network generators and automatically manipulate them in order to assist in the discovery of plausible morphogenetic processes. We presented a number of reasons to be optimistic about this approach. The generator semantics proved to be expressive enough to represent growth processes that lead to structurally diverse networks and the evolutionary algorithm was able to find plausible generators for these different cases. The plausibility of the solutions is based on a comprehensive set of conventional metrics that reflect different aspects of a network's structure. The generators found are sufficiently succinct to have high explanatory power. Multiple runs of evolutionary search on the same network were shown to converge on similar solutions. Similarly, runs on stochastic realisations of canonical ER- and PA-based generators essentially led to the discovery of the correct original laws. More broadly, we believe our approach has a wide range of application domains where it could fruitfully guide scientists towards credible processes underlying the formation of the empirical networks they are trying to model.

There are many possible avenues to improve upon the method we propose. The vast array of techniques from the evolutionary computation and genetic programming bibliography could be employed. Larger populations and recombination operators may lead to higher quality results at the expense of computational tractability. Pareto optimisation may be used to explicitly select trade-offs between precision and solution complexity. Variables and operators for specific domains (e.g. spacial restrictions) can be introduced. In this work we strived for simplicity and generality, and to provide the scientific community with a tool that can be immediately useful but also serve as a baseline for further refinements.

## Methods

The evolutionary algorithm maintains one or two generators at each time: *w*_{o} is the generator that produced the networks with the lowest dissimilarity to the target network so far. *w*_{s} is the generator with the shortest program that produced a network with a dissimilarity not more than 10% worse than *w*_{o}. We refer to this dissimilarity ratio as *anti-bloat tolerance*. At any moment, it is possible that *w*_{o} = *w*_{s}. This procedure is meant to fight bloat — the accumulation of needless complexity in generator programs^{12}. The algorithm is initialised with a randomly created generator *w*_{r} (see Supp. Info. for details). In the initial state *w*_{r} = *w*_{o} = *w*_{s}. For every evolutionary search generation, a parent generator is randomly selected from {*w*_{o}, *w*_{s}}. This parent generator is then cloned and mutated to produce the child generator *w*_{c}. Mutation consists of randomly selecting a sub-tree, removing it and replacing it with another randomly selected sub-tree extracted from another randomly created tree. *w*_{c} is used to produce a synthetic network and the dissimilarity of this network to the target is computed. The dissimilarity and program length of *w*_{c} is compared against *w*_{o} and *w*_{s}, and *w*_{c} will replace one or both if appropriate. The search will terminate once *w*_{o} and *w*_{s} remain unchanged for a certain number of generations, we choose this number to be 1000. *w*_{s} will be taken as the final result.

Given the significant computational effort needed to generate a network, we propose a strategy that limits the amount of such generation steps. While it is common in evolutionary algorithms to use large populations to prevent *local minima*, this is not the only possible strategy^{25}, nor is it guaranteed to work^{26}.

There are two parameters that introduce trade-offs in the search process: sample ratio and anti-bloat tolerance.

Sample ratio is a trade-off between generator accuracy (lower samples leading to more randomness against the linking preference defined by the generator) and computational effort (higher samples require more generator evaluations per link generation step).

Being *V* the set of vertices, *s _{r}* a predefined sampling ratio,

*A*the set of all possible arcs (|

*A*| = |

*V*|

^{2}) and

*A*′ the set of all arcs that do not currently exist in the network (

*A*′ = {

*a*∈

*A*|

*w*= 0},

_{a}*w*being the weight of arc

_{a}*a*), we define a sample

*S*with |

*S*| =

*n*=

*s*· |

_{r}*A*| such that

*S*= {

*s*

_{1}, …,

*s*} with

_{n}*s*∈

_{i}*A*′.

In the experiments presented in this article, we do not allow duplicate or self-links. These restrictions could trivially be lifted if appropriate.

The value we propose was set sufficiently high to work with the smaller networks in our data set – at some point, the sample becomes too small and the generators operate too randomly to lead to evolutionary improvement. Conversely, the sample size could be made smaller to reduce the computational effort for very large networks.

Anti-bloat tolerance is a trade-off between result quality and conciseness. Here we adjusted once and for all the value against our initial experiment, C. Elegans, and found 15% to stall evolution and 5% to lead to hard to interpret, bloated solutions. Without any further parameters adjustment, we then tested the algorithm against real and synthetic datasets, having found that this leads to perfect solution on the synthetic cases and robust results on the other 6 real-world networks. It is possible that these parameters can be further optimised for specific cases or if more computational effort can be tolerated. However, in this work we strived to demonstrate the general applicability of the method.

The stop condition (1000 stable generations) and random tree generation parameters (detailed in Supp. Info.) are conventional genetic programming parameters and were set within ranges that are very common in the literature. Given the heuristic nature of genetic programming, it is impossible to avoid such parameters. Quoting “A Field Guide to Genetic Programming”^{14}:

“It is impossible to make general recommendations for setting optimal parameter values, as these depend too much on the details of the application. However, genetic programming is in practice robust, and it is likely that many different parameter values will work.”

The quality and meaning of the results presented are not contingent on these parameters, as these only affect the search process itself. Further efforts on parametrisation may lead to higher quality results being found. We avoided such efforts to prevent a bias for our dataset. We propose that this increases credence on the general applicability of the method.

Ultimately, while we believe to have demonstrated the effectiveness of a heuristic search algorithm, this, of course, does not preclude refinements by further research.

## References

- 1.
Barabási, A. L. & Albert, R. Emergence of scaling in random networks.

*Science***286**, 509–512 (1999). - 2.
Fabrikant, A., Koutsoupias, E. & Papadimitriou, C. [Heuristically optimized trade-offs: A new paradigm for power laws in the internet.].

*Automata, Languages and Programming*[Widmayer P.,*et al.*(ed.)] [110–122] (Springer-Verlag, London, 2002). - 3.
Colizza, V., Banavar, J. R., Maritan, A. & Rinaldo, A. Network structures from selection principles.

*Phys. Rev. Lett.***92**, 198701 (2004). - 4.
Guimera, R., Uzzi, B., Spiro, J. & Amaral, L. A. N. Team assembly mechanisms determine collaboration network structure and team performance.

*Science***308**, 697–702 (2005). - 5.
Newman, M. E. J., Strogatz, S. & Watts, D. Random graphs with arbitrary degree distributions and their applications.

*Phys. Rev. E***64**, 026118 (2001). - 6.
Robins, G., Pattison, P., Kalish, Y. & Lusher, D. An introduction to exponential random graph (p*) models for social networks.

*Social Networks***29**, 173–191 (2007). - 7.
Karrer, B. & Newman, M. E. J. Random graphs containing arbitrary distributions of subgraphs.

*Phys. Rev. E***82**(2010). - 8.
Schmidt, M. & Lipson, H. Distilling free-form natural laws from experimental data.

*Science***324**, 81–85 (2009). - 9.
Brin, S. & Page, L. The anatomy of a large-scale hypertextual web search engine.

*Computer Networks and {ISDN} Systems***30**, 107–117 (1998). - 10.
Milo, R.

*et al.*Superfamilies of evolved and designed networks.*Science***303**, 1538–1542 (2004). - 11.
Ling, H. & Okada, K. An efficient Earth Mover's Distance algorithm for robust histogram comparison.

*IEEE Trans. Pattern Anal. Mach. Intell.***29**, 840–853 (2007). - 12.
Banzhaf, W. & Langdon, W. Some considerations on the reason for bloat.

*Genetic Programming and Evolvable Machines***3**, 81–91 (2002). - 13.
Koza, J. R.

*Genetic programming: on the programming of computers by means of natural selection*. (MIT Press, Cambridge, MA, USA, 1992). - 14.
Poli, R., Langdon, W. B. & McPhee, N. F.

*A Field Guide to Genetic Programming*. (Lulu.com, 2008). Date of access:10/03/2014. - 15.
Li, M. & Vitanyi, P.

*An Introduction to Kolmogorov Complexity and its Applications*(Springer, 1997). - 16.
White, J. G., Southgate, E., Thompson, J. N. & Brenner, S. The structure of the nervous system of the nematode C. Elegans.

*Phil. Trans. R. Soc. Lond. B***314**, 1–340 (1986). - 17.
Watts, D. J. & Strogatz, S. H. Collective dynamics of “small-world” networks.

*Nature***393**, 440–442 (1998). - 18.
Adamic, L. A. & Glance, N. [The political blogosphere and the 2004 U.S. election: divided they blog].

*Proc. 3rd international workshop on link discovery LinkKDD '05*[36–43] (ACM, New York, 2005). - 19.
Leskovec, J. & McAuley, J. J. [Learning to discover social circles in ego networks].

*Advances in Neural Information Processing Systems*[Bartlett P., Pereira F., Burges C., Bottou L., & Weinberger K. (ed.)] [539–547] (2012). - 20.
Xenarios, I.

*et al.*DIP: the database of interacting proteins.*Nucleic Acids Res.***28**, 289–291 (2000). - 21.
Menezes, T. [Evolutionary modeling of a blog network].

*Proc. 2011 IEEE Congress on Evolutionary Computation*[909–916] (IEEE, 2011). - 22.
Bailey, A., Ventresca, M. & Ombuki-Berman, B. [Automatic generation of graph models for complex networks by genetic programming].

*Proc. 14th international conference on Genetic and evolutionary computation conference (GECCO '12)*[711–718] (ACM, New York, 2012). - 23.
Bailey, A., Ventresca, M. & Ombuki-Berman, B. Genetic Programming for the Automatic Inference of Graph Models for Complex Networks.

*IEEE Tran. Evo. Comp.***18**, 405–419 (2013). - 24.
Reid, F. & Hurley, N. [Analysing structure in complex networks using quality functions evolved by genetic programming].

*Proc. 13th annual conference on Genetic and evolutionary computation (GECCO '11)*(ACM, New York, 2011). - 25.
Beyer, H.-G. & Schwefel, H.-P. Evolution strategies – A comprehensive introduction.

*Natural Computing***1**, 3–52 (2002). - 26.
Wolpert, D. H. & Macready, W. G. No Free Lunch Theorems for Optimization.

*IEEE Tran. Evo. Comp.***1**, 67–82 (1997). - 27.
Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices.

*Phys. Rev. E***74**, 036104 (2006).

## Acknowledgements

This work has been partially supported by the French National Agency of Research (ANR) through grants “SIMPA” ANR-09-SYSC-013-02 and “Algopol” ANR-12-CORD-0018. The authors are grateful to Chih-Chun Chen for proofreading the manuscript and to Jean-Philippe Cointet, John K. Clark, Jorge Tavares, Kim Jones, Marc Barthelemy, Russell K. Standish and Taras Kowaliw for reviewing the work and providing feedback.

## Author information

## Affiliations

### Centre Marc Bloch Berlin (An-Institut der Humboldt Universität, UMIFRE CNRS-MAE) Friedrichstr. 191, 10117 Berlin, Germany

- Telmo Menezes
- & Camille Roth

### Centre d'Analyse et de Mathématique Sociales (UMR 8557 CNRS-EHESS) 190 av. de France, 75013 Paris, France

- Telmo Menezes

## Authors

### Search for Telmo Menezes in:

### Search for Camille Roth in:

### Contributions

T.M. and C.R. contributed equally to this work.

### Competing interests

The authors declare no competing financial interests.

## Corresponding author

Correspondence to Telmo Menezes.

## Supplementary information

## PDF files

- 1.
### Supplementary Information

Supplementary Information

## Rights and permissions

This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder in order to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

## About this article

## Comments

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.