Iker Barriales-Valbuena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Iker Barriales-Valbuena has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Pedro José Zufiria Zatarain
Universidad Politécnica de Madrid
3 shared publications
Latest Publications
- Open Access
Analysis of Basic Features in Dynamic Network Models
Time evolving Random Network Models are presented as a mathematical framework for modelling and analyzing the evolution of complex networks. This framework allows the analysis over time of several network characterizing features such as link density, clustering coefficient, degree distribution, as well as entropy-based complexity measures, providing new insight on the evolution of random networks. First, some simple dynamic network models, based only on edge density, are analyzed to serve as a baseline reference for assessing more complex models. Then, a model that depends on network structure with the aim of reflecting some characteristics of real networks is also analyzed. Such model shows a more sophisticated behavior with two different regimes, one of them leading to the generation of high clustering coefficient/link density ratio values when compared with the baseline values, as it happens in many real networks. Simulation examples are discussed to illustrate the behavior of the proposed models.
Open AccessAnalysis of Basic Features in Dynamic Network Models
Time evolving Random Network Models are presented as a mathematical framework for modelling and analyzing the evolution of complex networks. This framework allows the analysis over time of several network characterizing features such as link density, clustering coefficient, degree distribution, as well as entropy-based complexity measures, providing new insight on the evolution of random networks. First, some simple dynamic network models, based only on edge density, are analyzed to serve as a baseline reference for assessing more complex models. Then, a model that depends on network structure with the aim of reflecting some characteristics of real networks is also analyzed. Such model shows a more sophisticated behavior with two different regimes, one of them leading to the generation of high clustering coefficient/link density ratio values when compared with the baseline values, as it happens in many real networks. Simulation examples are discussed to illustrate the behavior of the proposed models.
- Open Access
- 21 November 2017
- Published by MDPI AG in Proceedings
- Vol. 2 (4) , 164
Characterization of Some Dynamic Network Models
Dynamic random network models are presented as a mathematical framework for modelling and analyzing the time evolution of complex networks. Such framework allows the time analysis of several network characterizing features such as link density, clustering coefficient, degree distribution, as well as entropy-based complexity measures, providing new insight on the evolution of random networks. Some simple dynamic models are analyzed with the aim to provide several basic reference evolution behaviors. Simulation examples are discussed to illustrate the applicability of the proposed framework.
- 21 November 2017
- Published by MDPI AG in Proceedings
- Vol. 2 (4) , 164
Open AccessCharacterization of Some Dynamic Network Models
Dynamic random network models are presented as a mathematical framework for modelling and analyzing the time evolution of complex networks. Such framework allows the time analysis of several network characterizing features such as link density, clustering coefficient, degree distribution, as well as entropy-based complexity measures, providing new insight on the evolution of random networks. Some simple dynamic models are analyzed with the aim to provide several basic reference evolution behaviors. Simulation examples are discussed to illustrate the applicability of the proposed framework.
- Open Access
Entropy Characterization of Random Network Models
This paper elaborates on the Random Network Model (RNM) as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc.) and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.
Open AccessEntropy Characterization of Random Network Models
This paper elaborates on the Random Network Model (RNM) as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc.) and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.