
Guilherme Ferraz de Arruda- Ph.D
- Researcher at CENTAI Institute
Guilherme Ferraz de Arruda
- Ph.D
- Researcher at CENTAI Institute
About
64
Publications
17,840
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,743
Citations
Introduction
Current projects: (i) Modeling, analysis and simulation of dynamic and nonlinear stochastic processes on complex networks; (ii) Data mining on Complex Networks: Structure and dynamics.
Current institution
CENTAI Institute
Current position
- Researcher
Additional affiliations
Education
March 2007 - December 2011
Universidade de São Paulo
Field of study
- Electronics
Publications
Publications (64)
We present a continuous formulation of epidemic spreading on multilayer networks using a tensorial representation, extending the models of monoplex networks to this context. We derive analytical expressions for the epidemic threshold of the susceptible-infected-susceptible (SIS) and susceptible-infected-recovered dynamics, as well as upper and lowe...
Complex networks have become the main paradigm for modelling the dynamics of interacting systems. However, networks are intrinsically limited to describing pairwise interactions, whereas real-world systems are often characterized by higher-order interactions involving groups of three or more units. Higher-order structures, such as hypergraphs and s...
In this Chapter, we discuss the effects of higher-order structures on SIS-like processes of social contagion. After a brief motivational introduction where we illustrate the standard SIS process on networks and the difference between simple and complex contagions, we introduce spreading processes on higher-order structures starting from the most ge...
Hypergraphs naturally represent higher-order interactions, which persistently appear in social interactions, neural networks, and other natural systems. Although their importance is well recognized, a theoretical framework to describe general dynamical processes on hypergraphs is not available yet. In this paper, we derive expressions for the stabi...
We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in larger groups. Here, we study the evolutionary dynamics of a public goods game in social systems with higher-order interactions. First, we show that the game on...
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order relationships, which are naturally represented by hypergraphs. Here we study random walks on hypergraphs. Due to...
Metabolic networks are probably among the most challenging and important biological networks. Their study provides insight into how biological pathways work and how robust a specific organism is against an environment or therapy. Here, we propose a directed hypergraph with edge-dependent vertex weight as a novel framework to represent metabolic net...
Oil palm ( Elaeis guinensis ) is a controversial crop. To assess its sustainability, we analysed the contribution of different types of plantations (smallholder, industrial and unproductive) towards meeting six Sustainable Development Goals. Using spatial econometric methods and data from 25,067 villages in Sumatra, Indonesia, we revealed that unpr...
Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order relationships, which are naturally represented by hypergraphs. Here, we study random walks on hypergraphs. Due t...
DOI:https://doi.org/10.1103/PhysRevResearch.5.029003
Although ubiquitous, interactions in groups of individuals are not yet thoroughly studied. Frequently, single groups are modeled as critical-mass dynamics, which is a widespread concept used not only by academics but also by politicians and the media. However, less explored questions are how a collection of groups will behave and how their intersec...
Rumors and information spreading emerge naturally from human-to-human interactions and have a growing impact on our everyday life due to increasing and faster access to information, whether trustworthy or not. A popular mathematical model for spreading rumors, data, or news is the Maki–Thompson model. Mean-field approximations suggested that this m...
Human activities often require simultaneous decision-making of individuals in groups. These processes cannot be coherently addressed by means of networks, as networks only allow for pairwise interactions. Here, we propose a general implementation for collective games in which higher-order interactions are encoded on hypergraphs. We employ it for th...
In this Chapter, we discuss the effects of higher-order structures on SIS-like processes of social contagion. After a brief motivational introduction where we illustrate the standard SIS process on networks and the difference between simple and complex contagions, we introduce spreading processes on higher-order structures starting from the most ge...
Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass dynamics, which is a widespread concept used not only by academics but also by politicians and the media. However, le...
The study of the dynamics of opinion formation and transmission in social networks has attracted lots of attention. Here, we propose a model that simulates communication in an online social network, in which randomly created posts represent external information. We consider users and friendship relations to be encoded as nodes and edges of a networ...
Arxiv Paper Doppelganger
Complex networks have become the main paradigm for modelling the dynamics of interacting systems. However, networks are intrinsically limited to describing pairwise interactions, whereas real-world systems are often characterized by higher-order interactions involving groups of three or more units. Higher-order structures, such as hypergraphs and s...
Rumor and information spreading are natural processes that emerge from human-to-human interaction. Mathematically, this was explored in the popular Maki-Thompson model, where a phase transition was thought to be absent. Here, we show that a second-order phase transition is present in this model which is not captured by first-order mean-field approx...
A pandemia de coronavírus tem criado um ambiente completamente anômalo, evidenciando diversos aspectos da nossa sociedade e gerando debates em diversas dimensões. No presente trabalho, é proposta uma argumentação baseada em conceitos fundamentais para o desenvolvimento de modelos epidemiológicos, onde se procura mostrar o papel de comportamentos co...
Among different aspects of social networks, dynamics have been proposed to simulate how opinions can be transmitted. In this study, we propose a model that simulates the communication in an online social network, in which the posts are created from external information. We considered the nodes and edges of a network as users and their friendship, r...
Universal spectral properties of multiplex networks allow us to assess the nature of the transition between disease-free and endemic phases in the SIS epidemic spreading model. In a multiplex network, depending on a coupling parameter, p , the inverse participation ratio (IPR) of the leading eigenvector of the adjacency matrix can be in two differe...
The modeling of the spreading of communicable diseases has experienced significant advances in the last two decades or so. This has been possible due to the proliferation of data and the development of new methods to gather, mine and analyze it. A key role has also been played by the latest advances in new disciplines like network science. Nonethel...
Hypergraphs naturally represent higher-order interactions, which persistently appear from social interactions to neural networks and other natural systems. Although their importance is well recognized, a theoretical framework to describe general dynamical processes on hypergraphs is not available yet. In this paper, we bridge this gap and derive ex...
Universal spectral properties of multiplex networks allow us to assess the nature of the transition between disease-free and endemic phases in the SIS epidemic spreading model. In a multiplex network, depending on a coupling parameter, $p$, the inverse participation ratio ($IPR$) of the leading eigenvector of the adjacency matrix can be in two diff...
Our understanding of the dynamics of complex networked systems has increased significantly in the last two decades. However, most of our knowledge is built upon assuming pairwise relations among the system's components. This is often an oversimplification, for instance, in social interactions that occur frequently within groups. To overcome this li...
As synchronized activity is associated with basic brain functions and pathological states, spike train synchrony has become an important measure to analyze experimental neuronal data. Many different measures of spike train synchrony have been proposed, but there is no gold standard allowing for comparison of results between different experiments. T...
As synchronized activity is associated with basic brain functions and pathological states, spike train synchrony has become an important measure to analyze experimental neuronal data. Many measures of spike train synchrony have been proposed, but there is no gold standard allowing for comparison of results from different experiments. This work aims...
The modeling of the spreading of communicable diseases has experienced significant advances in the last two decades or so. This has been possible due to the proliferation of data and the development of new methods to gather, mine and analyze it. A key role has also been played by the latest advances in new disciplines like network science. Nonethel...
We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in groups of more than two players. To remedy this, we introduce higher-order interactions, where a link can connect more than two individuals, and study their evo...
We study a general epidemic model with arbitrary recovery rate distributions. This simple deviation from the standard setup is sufficient to prove that heterogeneity in the dynamical parameters can be as important as the more studied structural heterogeneity. Our analytical solution is able to predict the shift in the critical properties induced by...
Our understanding of the dynamics of complex networked systems has increased significantly in the last two decades. However, most of our knowledge is built upon assuming pairwise relations among the system's components. This is often an oversimplification, for instance, in social interactions that occur frequently within groups. To overcome this li...
Network robustness is a central point in network science, both from a theoretical and a practical point of view. In this paper, we show that layer degradation, understood as the continuous or discrete loss of links' weight, triggers a structural transition revealed by an abrupt change in the algebraic connectivity of the graph. Unlike traditional s...
Network robustness is a central point in network science, both from a theoretical and a practical point of view. In this paper, we show that layer degradation, understood as the continuous or discrete loss of links' weight, triggers a structural transition revealed by an abrupt change in the algebraic connectivity of the graph. Unlike traditional s...
We study a general epidemic model with arbitrary recovery rate distributions. This simple deviation from the standard setup is sufficient to prove that heterogeneity in the dynamical parameters can be as important as the more studied structural heterogeneity. Our analytical solution is able to predict the shift in the critical properties induced by...
We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive interesting results based on an interpretation of the traditional eigenvalue problem. Specifically, our formalism is b...
We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive interesting results based on an interpretation of the traditional eigenvalue problem. More specifically, we reduce the...
Complex networks show nontraditional critical properties due to their extreme compactness (small-world property) together with their complex organization [28].
In the previous chapters, we have dealt with the matricial representation for multiplex systems. Here, we focus on the matricial representation and explore the block nature of such representation.
Important information on the topological properties of a graph can be extracted from the eigenvalues of the associated adjacency, Laplacian, or any other type of graph related matrix. Thus, like spectroscopy for condensed matter physics, graph spectra are central in the study of the structural properties of a complex network.
In the previous chapters, we presented and explored the matricial representation of multiplex networks.
In this chapter, we present and define multiplex networks as they will be used in this book.
A structural metric of a network is a measure of some property directly dependent on the system of relations between the components of the network, i.e., by representing the network with a graph, a structural metric is a measure of a property that depends on the edge set.
Spreading processes have been largely studied in the literature, both analytically and by means of large-scale numerical simulations. These processes mainly include the propagation of diseases, rumors and information on top of a given population. In the last two decades, with the advent of modern network science, we have witnessed significant advan...
Spreading processes have been largely studied in the literature, both analytically and by means of large-scale numerical simulations. These processes mainly include the propagation of diseases, rumors and information on top of a given population. In the last two decades, with the advent of modern network science, we have witnessed significant advan...
Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumor spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, cu...
This book provides the basis of a formal language and explores its possibilities in the characterization of multiplex networks. Armed with the formalism developed, the authors define structural metrics for multiplex networks. A methodology to generalize monoplex structural metrics to multiplex networks is also presented so that the reader will be a...
This book provides the basis of a formal language and explores its possibilities in the characterization of multiplex networks. Armed with the formalism developed, the authors define structural metrics for multiplex networks. A methodology to generalize monoplex structural metrics to multiplex networks is also presented so that the reader will be a...
We demonstrate that the normalised localization length $\beta$ of the eigenfunctions of diluted (sparse) banded random matrices follows the scaling law $\beta=x^*/(1+x^*)$. The scaling parameter of the model is defined as $x^*\propto(b_{eff}^2/N)^\delta$, where $b_{eff}$ is the average number of non-zero elements per matrix row, $N$ is the matrix s...
We demonstrate that the normalised localization length $\beta$ of the eigenfunctions of diluted (sparse) banded random matrices follows the scaling law $\beta=x^*/(1+x^*)$. The scaling parameter of the model is defined as $x^*\propto(b_{eff}^2/N)^\delta$, where $b_{eff}$ is the average number of non-zero elements per matrix row, $N$ is the matrix s...
Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them. In this paper, we numerically demonstrate that the normalized localization length $\beta$ of the eigenfunctions...
Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them. In this paper, we numerically demonstrate that the normalized localization length $\beta$ of the eigenfunctions...
Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumor spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, cu...
Multilayer networks represent systems in which there are several topological levels each one representing one kind of interaction or interdependency between the systems’ elements. These networks have attracted a lot of attention recently because their study allows considering different dynamical modes concurrently. Here, we revise the main concepts...
Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders tr...
We propose a generalization of the concept of assortativity based on the
tensorial representation of multilayer networks, covering the definitions given
in terms of Pearson and Spearman coefficients. Our approach can also be applied
to weighted networks and provides information about correlations considering
pairs of layers. By analyzing the multil...
Multilayer networks represent systems in which there are several topological
levels each one representing one kind of interaction or interdependency between
the systems' elements. These networks have attracted a lot of attention
recently because their study allows considering different dynamical modes
concurrently. Here, we revise the main concepts...
The identification of the most influential spreaders in networks is important
to control and understand the spreading capabilities of the system as well as
to ensure an efficient information diffusion such as in rumor-like dynamics.
Recent works have suggested that the identification of influential spreaders is
not independent of the dynamics being...
The influence of the network structure on the emergence of collective dynamical behavior is an important topic of research that has not been fully understood yet. In the current work, it is shown how statistical regression analysis can be considered to address this issue. The regression model proposed suggests that the average shortest path length...
The strength and durability of materials produced from aggregates (e.g., concrete bricks, concrete, and ballast) are critically affected by the weathering of the particles, which is closely related to their mineral composition. It is possible to infer the degree of weathering from visual features derived from the surface of the aggregates. By using...
Objective
Schizophrenia is a neuropsychiatric disorder characterized by cognitive and emotional deficits and associated with various abnormalities in the organization of neural circuits. It is currently unclear how and to which extend the global network organization is changed due to such disorder. In this work, we analyzed cortical networks of hea...
Many methods have been developed for data clustering, such as k-means,
expectation maximization and algorithms based on graph theory. In this latter
case, graphs are generally constructed by taking into account the Euclidian
distance as a similarity measure, and partitioned using spectral methods.
However, these methods are not accurate when the cl...
An entropy-based image segmentation approach is introduced and applied to color images obtained from Google Earth. Segmentation refers to the process of partitioning a digital image in order to locate different objects and regions of interest. The application to satellite images paves the way to automated monitoring of ecological catastrophes, urba...