6 citations · 6 across the 1 of their papers we have counts for
6 papers
Weak percolation on multiplex networks with overlapping edges
G. J. Baxter, R. A. da Costa, S. N. Dorogovtsev +1
We solve the weak percolation problem for multiplex networks with overlapping edges. In weak percolation, a vertex belongs to a connected component if at least one of its neighbors…
Approximating nonbacktracking centrality and localization phenomena in large networks
G. Timár, R. A. da Costa, S. N. Dorogovtsev +1
Message-passing theories have proved to be invaluable tools in studying percolation, non-recurrent epidemics and similar dynamical processes on real-world networks. At the heart of…
Effect of the initial configuration of weights on the training and function of artificial neural networks
R. J. Jesus, M. L. Antunes, R. A. da Costa +3
The function and performance of neural networks is largely determined by the evolution of their weights and biases in the process of training, starting from the initial configurati…
Finding the optimal nets for self-folding Kirigami
N. A. M. Araújo, R. A. da Costa, S. N. Dorogovtsev +1
Three-dimensional shells can be synthesized from the spontaneous self-folding of two-dimensional templates of interconnected panels, called nets. However, some nets are more likely…
Complex network view of evolving manifolds
Diamantino C. da Silva, Ginestra Bianconi, Rui A. da Costa +2
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of…
Nonbacktracking expansion of finite graphs
Gábor Timár, Rui A. da Costa, Sergey N. Dorogovtsev +1
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirecte…