Search Results for author: Ernesto Estrada

Found 6 papers, 0 papers with code

Signed graphs in data sciences via communicability geometry

no code implementations12 Mar 2024 Fernando Diaz-Diaz, Ernesto Estrada

Signed graphs are an emergent way of representing data in a variety of contexts were conflicting interactions exist.

Dimensionality Reduction

Hubs-biased resistance distances on graphs and networks

no code implementations18 Jan 2021 Ernesto Estrada, Delio Mugnolo

We define the analogous of the Kirchhoff indices of the graph based of these resistance distances.

Spectral Theory 05C50, 05C82, 15A18, 47N50

Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model

no code implementations4 Jan 2021 Paolo Bartesaghi, Ernesto Estrada

Using this approach we propose a strategy to remove edges in a network that significantly delays the propagation of a disease across the network with minimal disruption of its capacity to deliver goods/items/passengers.

Physics and Society Dynamical Systems 92D39, 05C82, 37N25

Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease

no code implementations23 Apr 2020 Luciano Abadias, Gissell Estrada-Rodriguez, Ernesto Estrada

We find an upper bound to the analytical solution of this model which represents the worse-case scenario on the propagation of perturbations across a protein residue network.

Risk-dependent centrality in economic and financial networks

no code implementations18 Jul 2019 Paolo Bartesaghi, Michele Benzi, Gian Paolo Clemente, Rosanna Grassi, Ernesto Estrada

Node centrality is one of the most important and widely used concepts in the study of complex networks.

Random Multi-Hopper Model. Super-Fast Random Walks on Graphs

no code implementations24 Dec 2016 Ernesto Estrada, Jean-Charles Delvenne, Naomichi Hatano, José L. Mateos, Ralf Metzler, Alejandro P. Riascos, Michael T. Schaub

Stated differently, for small parameter values the multi-hopper explores a general graph as fast as possible when compared to a random walker on a full graph.

Physics and Society Statistical Mechanics Social and Information Networks Mathematical Physics Mathematical Physics Probability

Cannot find the paper you are looking for? You can Submit a new open access paper.