RAMON XULVI

“ ASSORTATIVE RANDOM NETWORKS ”

Conferencista: Ramon Xulvi
(Profesor,Departamento de Física, EPN)

RESUMEN 

To analyze the role of assortativity in complex networks, an algorithm is introduced to produce assortative mixing to a desired degree. The algorithm works in such a way that the degree-degree correlations generated are random to any respect other than the assortativity itself. The degree of assortativity is governed by one only parameter p. Changing this parameter, the algorithm allows to construct networks ranging from fully uncorrelated networks (p=0) to maximally assortative (p=1). We apply the algorithm to a Barabási-Albert scale-free network and show that the degree of assortativity is a very important parameter when characterizing the topology of networks."

ACERCA DE

FILIACIÓN:

  • Profesor del Departamento de Física de la Escuela Politécnica Nacional

Anterior:

  • Assistant Research Scientist, Universidad de California, en Santa Barbara USA.
  • Postdoctoral position in Complex Systems, The New England Complex Systems Institute (NECSI). Cambridge EN USA.
  • Postdoctoral fellow in Systems Biology (Origins of Life). FAS, Center for Systems Biology en Harvard University. Cambridge
  • Investigador Prometeo del Departamento de Física de la Escuela Politécnica Nacional

FORMACIÓN

  • Ph.D. in Theoretical Physics: Statistical Physics and Stochasti Processes. Humboldt University of Berlin. Dissertation Title: Structural Properties of Scale-Free Networks (Germany).
  • Ph.D. courses in Theoretical Physics. High Energy Physics and Mathematical Physics. University of Valencia (Spain).
  • Master’s degree in Theoretical Physics and Fundamental Physics. University of Valencia (Spain).

PRODUCCIÓN CIENTÍFICA

  • 14 artículos científicos en revistas internacionales

ÁREAS DE INVESTIGACIÓN

  • Física de Fenómenos Complejos , Modelos Biológicos ,Bioestadística