Locating the source of diffusion in large-scale networks
How can we localize the source of diffusion in a complex network? Because of the
tremendous size of many real networks—such as the internet or the human social graph—it …
tremendous size of many real networks—such as the internet or the human social graph—it …
How to calculate the fractal dimension of a complex network: the box covering algorithm
Covering a network with the minimum possible number of boxes can reveal interesting
features for the network structure, especially in terms of self-similar or fractal characteristics …
features for the network structure, especially in terms of self-similar or fractal characteristics …
Scaling and universality in proportional elections
S Fortunato, C Castellano - Physical review letters, 2007 - APS
A most debated topic of the last years is whether simple statistical physics models can
explain collective features of social dynamics. A necessary step in this line of endeavor is to …
explain collective features of social dynamics. A necessary step in this line of endeavor is to …
[HTML][HTML] Identification and analysis of natural building blocks for evolution-guided fragment-based protein design
Natural evolution has generated an impressively diverse protein universe via duplication
and recombination from a set of protein fragments that served as building blocks. The …
and recombination from a set of protein fragments that served as building blocks. The …
Exploiting relational information in social networks using geometric deep learning on hypergraphs
Online social networks are constituted by a diverse set of entities including users, images
and posts which makes the task of predicting interdependencies between entities …
and posts which makes the task of predicting interdependencies between entities …
Box-covering algorithm for fractal dimension of complex networks
CM Schneider, TA Kesselring, JS Andrade Jr… - Physical Review E …, 2012 - APS
The self-similarity of complex networks is typically investigated through computational
algorithms, the primary task of which is to cover the structure with a minimal number of …
algorithms, the primary task of which is to cover the structure with a minimal number of …
Unravelling the size distribution of social groups with information theory in complex networks
A Hernando, D Villuendas, C Vesperinas… - The European Physical …, 2010 - Springer
The minimization of Fisher's information (MFI) approach of Frieden et al.[Phys. Rev. E 60, 48
(1999)] is applied to the study of size distributions in social groups on the basis of a recently …
(1999)] is applied to the study of size distributions in social groups on the basis of a recently …
[HTML][HTML] Traffic gridlock on complex networks
Here we study how a traffic jam spreads on complex networks when driven by an increasing
flux between certain initial and final points. For that purpose, we developed two new traffic …
flux between certain initial and final points. For that purpose, we developed two new traffic …
Collaboration networks from a large CV database: dynamics, topology and bonus impact
Understanding the dynamics of research production and collaboration may reveal better
strategies for scientific careers, academic institutions, and funding agencies. Here we …
strategies for scientific careers, academic institutions, and funding agencies. Here we …
Free-electron gas in the Apollonian network: Multifractal energy spectrum and its thermodynamic fingerprints
We study the free-electron gas in an Apollonian network within the tight-binding framework.
The scale-free and small-world character of the underlying lattice is known to result in a …
The scale-free and small-world character of the underlying lattice is known to result in a …