Advanced search
Start date

Machine learning of social dynamics in complex networks

Grant number: 21/13843-2
Support Opportunities:Scholarships abroad - Research Internship - Doctorate
Effective date (Start): June 15, 2022
Effective date (End): June 14, 2023
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Computer Systems
Principal Investigator:Francisco Aparecido Rodrigues
Grantee:Aruane Mello Pineda
Supervisor: Colm Connaughton
Host Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil
Research place: University of Warwick, England  
Associated to the scholarship:19/22277-0 - Modeling interacting social dynamics in complex networks, BP.DR


The interest in learning how rumors spreads in society has led researches to develop theoretical computational models to investigate the underlying mechanisms behind the spread of fake news in our society. Currently, literature on the topic provides a variety of epidemiological and cultural models. While each type of modeling adopts a different approach, all of them aim to resemble some aspects of the collective behavior. These models can be studied in different complex network topologies, and have been widely used to interpret the result of a given dynamic process. Social networks have become an important mean of exchanging information in contemporary society, increasing and diversifying the volume of data. Thus, data mining and machine learning techniques have become viable and advantageous means for the study of the spread of rumors. In this context, this project proposes the development of an approach based on machine learning algorithms to predict the outcome of a given dynamic process as a function of the structural characteristics of complex social networks. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Please report errors in scientific publications list using this form.