O. Andrei, M. Fernández, G. Héì-ene-kirchner, O. Melançon, B. Namet et al., PORGY: Strategy-Driven Interactive Transformation of Graphs, th Int. Workshop on Computing with Terms and Graphs, pp.54-68, 2011.
DOI : 10.4204/EPTCS.48.7

URL : https://hal.archives-ouvertes.fr/inria-00563249

O. Andrei-andhéì-ene and . Kirchner, A Rewriting Calculus for Multigraphs with Ports, Proc. of RULE'07, pp.67-82, 2008.
DOI : 10.1016/j.entcs.2008.10.035

O. Andrei-andhéì-ene and . Kirchner, A Higher-Order Graph Calculus for Autonomic Computing, Graph Theory, Computational Intelligence and Thought. Golumbic Festschrift, pp.15-26, 2009.
DOI : 10.1007/978-3-540-73449-9_5

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom: Piggybacking Rewriting on Java, LNCS, vol.4533, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5

URL : https://hal.archives-ouvertes.fr/inria-00142045

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

H. P. Barendregt, M. C. Van-eekelen, J. R. Glauert, J. R. Kennaway, M. J. Plasmeijer et al., Term graph rewriting, Proc. of PARLE, Parallel Architectures and Languages Europe, number 259-II in LNCS, pp.141-158, 1987.
DOI : 10.1007/3-540-17945-3_8

K. Barthelmann, How to construct a hyperedge replacement system for a context-free set of hypergraphs, 1996.

V. Batagelj and U. Brandes, Efficient generation of large random networks, Physical Review E, vol.71, issue.3, p.36113, 2005.
DOI : 10.1103/PhysRevE.71.036113

E. Bertuzzo, R. Casagrandi, M. Gatto, I. Rodriguez-iturbe, and A. Rinaldo, On spatially explicit models of cholera epidemics, Journal of The Royal Society Interface, vol.38, issue.9, pp.321-333, 2010.
DOI : 10.1126/science.1134695

P. Borovansk´yborovansk´y, C. Kirchner, P. Héì-ene-kirchner, C. Moreau, and . Ringeissen, An Overview of ELAN, Electronic Notes in Theoretical Computer Science, vol.15, pp.55-70, 1998.
DOI : 10.1016/S1571-0661(05)82552-6

U. Brandes and D. Wagner, Analysis and Visualization of Social Networks, Graph Drawing Software, Mathematics and Visualization, pp.321-340, 2004.
DOI : 10.1007/978-3-642-18638-7_15

P. J. Carrington, J. Scott, and S. Wasserman, Models and Methods in Social Network Analysis. Structural Analysis in the Social Sciences, 2005.

D. Cartwright and F. Harary, Structural balance: a generalization of Heider's theory., Psychological Review, vol.63, issue.5, pp.277-293, 1956.
DOI : 10.1037/h0046049

W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu et al., Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate, Proc. of the 11 th SIAM Int. Conf. on Data Mining, SDM 2011, pp.379-390, 2011.
DOI : 10.1137/1.9781611972818.33

W. Chen, C. Wang, and Y. Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.1029-1038, 2010.
DOI : 10.1145/1835804.1835934

A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel et al., ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION ??? PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH, Handbook of Graph Grammars and Computing by Graph Transformations, pp.163-246, 1997.
DOI : 10.1142/9789812384720_0003

P. S. Dodds and D. J. Watts, A generalized model of social and biological contagion, Journal of Theoretical Biology, vol.232, issue.4, pp.587-604, 2005.
DOI : 10.1016/j.jtbi.2004.09.006

P. Erd?, O. , and A. Rényi, On the evolution of random graphs, Publication of the Mathematical Institute, pp.17-61, 1960.

M. Fernández, B. Hé-`-hé-`-iène-kirchner, and . Pinaud, Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework, Electronic Proceedings in Theoretical Computer Science, vol.159, 2016.
DOI : 10.4204/EPTCS.159.3

M. Fernández, O. Héì-ene-kirchner, and . Namet, A strategy language for graph rewriting Logic-Based Program Synthesis and Transformation, LNCS, vol.7225, pp.173-188, 2012.

M. Fernández, B. Héì-ene-kirchner, and . Pinaud, Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework, Proc. 3rd Workshop on GRAPH Inspection and Traversal Engineering, pp.15-29, 2014.
DOI : 10.4204/EPTCS.159.3

A. Goyal, F. Bonchi, and L. V. Lakshmanan, Learning influence probabilities in social networks, Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, pp.241-250, 2010.
DOI : 10.1145/1718487.1718518

M. Granovetter, Threshold Models of Collective Behavior, American Journal of Sociology, vol.83, issue.6, p.1420, 1978.
DOI : 10.1086/226707

A. Habel, J. Müller, and D. Plump, Double-pushout graph transformation revisited, Mathematical Structures in Computer Science, vol.11, issue.05, pp.637-688, 2001.
DOI : 10.1017/S0960129501003425

N. Kej?ar, Z. Nikoloski, and V. Batagelj, Probabilistic Inductive Classes of Graphs, The Journal of Mathematical Sociology, vol.32, issue.2, pp.85-109, 2008.
DOI : 10.1103/PhysRevLett.86.3200

D. Kempe and J. Kleinberg, Influential Nodes in a Diffusion Model for Social Networks, Automata, Languages and Programming, pp.1127-1138, 2005.
DOI : 10.1007/11523468_91

M. Kivelä, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno et al., Multilayer networks, Journal of Complex Networks, vol.2, issue.3, pp.203-271, 2014.
DOI : 10.1093/comnet/cnu016

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

J. Leskovec, D. Huttenlocher, and J. Kleinberg, Signed networks in social media, Proceedings of the 28th international conference on Human factors in computing systems, CHI '10, pp.1361-1370, 2010.
DOI : 10.1145/1753326.1753532

S. Milgram, The small world problem, Psychology Today, vol.2, pp.60-67, 1967.
DOI : 10.1037/e400002009-005

M. Newman, A. Barabási, and D. J. Watts, The structure and dynamics of networks. Princeton Studies in Complexity, 2006.

C. Bobo-nick, P. Lee, U. Cunningham, and . Brandes, Simmelian backbones: Amplifying hidden homophily in facebook networks, Advances in Social Networks Analysis and Mining (ASONAM), pp.525-532, 2013.

B. Pinaud, G. Melançon, and J. Dubois, PORGY: A Visual Graph Rewriting Environment for Complex Systems, Computer Graphics Forum, vol.16, issue.6, pp.1265-1274, 2012.
DOI : 10.1111/j.1467-8659.2012.03119.x

URL : https://hal.archives-ouvertes.fr/hal-00682550

G. Detlef-plump-ehrig, H. Engels, G. Kreowski, and . Rozenberg, Term graph rewriting, Handbook of Graph Grammars and Computing by Graph Transformations: Applications, Languages, and Tools, pp.3-61, 1998.

D. Plump, The Graph Programming Language GP, LNCS, vol.5725, pp.99-122, 2009.
DOI : 10.1007/978-3-642-03564-7_6

J. Scott and P. J. Carrington, The SAGE Handbook of Social Network Analysis, SAGE, 2011.
DOI : 10.4135/9781446294413

J. Vallet, B. Héì-ene-kirchner, G. Pinaud, and . Melançon, A Visual Analytics Approach to Compare Propagation Models in Social Networks, Proc. Graphs as Models, GaM 2015, pp.65-79, 2015.
DOI : 10.4204/EPTCS.181.5

URL : https://hal.archives-ouvertes.fr/hal-01150667

E. Visser, Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5, Proc. of RTA'01, pp.357-361, 2001.
DOI : 10.1007/3-540-45127-7_27

L. Wang, F. Du, H. P. Dai, and Y. X. Sun, Random pseudofractal scale-free networks with small-world effect, The European Physical Journal B, vol.85, issue.3, pp.361-366, 2006.
DOI : 10.1140/epjb/e2006-00389-0

D. J. Watts, A simple model of global cascades on random networks, Proc. of the National Academy of Sciences, pp.5766-5771, 2002.
DOI : 10.1073/pnas.082090499

J. Duncan, S. H. Watts, and . Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, pp.440-442, 1998.

L. Wonyeol, K. Jinha, and Y. Hwanjo, CT-IC: Continuously activated and time-restricted independent cascade model for viral marketing, Data Mining (ICDM), 2012 IEEE 12 th Int. Conf. on, pp.960-965, 2012.