Pablo Aragón is a research scientist of the Big Data & Data Science unit at Eurecat, Centre Tecnològic de Catalunya. His research focuses on understanding social and political phenomena through the analysis of data from the Internet. He is particularly interested in characterizing online participation in civic technologies, the online network structures of grassroots movements and political parties, and the technopolitical dimension of networked democracy. These interests have led him to participate in EU funded research projects like DECODE, focusing on free open-source infrastructures to increase data sovereignty of European citizens, or D-CENT, aimed at transforming everyday democratic decision making through free open-source digital technologies. The results of his research have been published in top-tier journals and conferences in computational social science, where he also serves as reviewer (e.g. PLOS ONE, EPJ Data Science) and member of the program committee (e.g., TheWebConf, ICWSM, IC2S2). He has also given numerous talks and tutorials to academic and industrial audiences at international conferences, universities and research institutions.
Pablo was a doctoral researcher of the Artificial Intelligence and Machine Learning research group at Universitat Pompeu Fabra (2015-2019), where he works as an adjunct professor for the Discrete Mathematics course and the Participatory Platforms and Social Network Analysis course. He was also visiting scholar at the Oxford Internet Institute – University of Oxford (2018) and actively collaborates with local institutions for projects related to data, technology and democracy:
- Barcelona City Council (Area of Citizen Rights, Participation and Transparency) for Decidim, the free open source platform for participatory democracy. As part of this project, Pablo is a co-chair of the Metadecidim Lab research seminars and he has co-founded and served as the first coordinator of the Democratic Innovation Lab of Barcelona, an open space to address citizen challenges in an intelligent, participatory and democratic manner.
- Madrid City Council (Medialab Prado) for the Collective Intelligence for Participatory Democracy Lab – Participa Lab. In particular, Pablo coordinated the Data Analysis for Citizen Participation project and contributed to the Collective Intelligence for Democracy hackatons (mentorship in 2016, and research in 2017).
Pablo is also a a co-founder member of DatAnalysis15M (book here, free content here). Prior to his academic career, he worked for two years as a data engineer designing backend systems for social media monitoring processes in a startup company.
Pablo holds a PhD, with mention Cum Laude, in Information and Communication Technologies from Universitat Pompeu Fabra (2019). He obtained a MSc in Artificial Intelligence at Universidad Nacional de Educación a Distancia – UNED in 2016, and a BSc+MSc in Computer Science & Engineering at Universidad de Zaragoza in 2010, which included a full year as an exchange student at Luleå Tekniska Universitet. Pablo also attended the 1st Summer School on Methods for Computational Social Science and the 1st Summer School of the Network of Excellence in Internet Science.
Erdős number = 4
|4||Pablo Aragón||García-Gavilanes, Ruth; Kaltenbrunner, Andreas; Sáez-Trumper, Diego; Baeza-Yates, Ricardo; Aragón, Pablo; Laniado, David. Who are my Audiences? A Study of the Evolution of Target Audiences in Microblogs. 6th International Conference on Social Informatics (2014).|
|3||Ricardo A. Baeza-Yates||Szwarcfiter, Jayme L.; Navarro, Gonzalo; Baeza-Yates, Ricardo; Oliveira, Joísa de S.; Cunto, Walter; Ziviani, Nívio Optimal binary search trees with costs depending on the access paths. Theoret. Comput. Sci. 290 (2003), no. 3, 1799–1814.|
|2||Jayme Luiz Szwarcfiter||de Figueiredo, Celina M. H.; Gimbel, John; Mello, Célia P.; Szwarcfiter, Jayme L. Sources and sinks in comparability graphs. Order 14 (1997), no. 1, 75–83.|
|1||John Gordon Gimbel||Erdős, Paul; Gimbel, John; Straight, H. Joseph Chromatic number versus cochromatic number in graphs with bounded clique number. European J. Combin. 11 (1990), no. 3, 235–240.|