Ara es mostren els items 1-15 de 15

    • A study of visibility graphs for time series representations 

      Bergillos Varela, Carlos (Universitat Politècnica de Catalunya, 2020-06-22)
      Treball Final de Grau
      Accés obert
      En aquest projecte estudiem i presentem el camp dels grafs de visibilitat (visibility graphs) com una forma de representar i caracteritzar sèries temporals tal com va ser introduït per Lucas Lacasa et al. el 2008. Amb els ...
    • Complex networks in genomics and proteomics 

      Vicente Solé, Ricardo; Pastor Satorras, Romualdo (Wiley-VCH, 2003)
      Capítol de llibre
      Accés restringit per política de l'editorial
      Complex interacting networks are observed in systems from such diverse areas as physics, biology, economics, ecology, and computer science. For example, economic or social interactions often organize themselves in complex ...
    • Exact detection of direct links in networks of interacting dynamical units 

      Rubido, Nicolás; Marti, Arturo; Bianco-Martinez, Ezequiel; Grebogi, Celso; Baptista, Murilo; Masoller Alonso, Cristina (2014-09)
      Article
      Accés obert
      The inference of an underlying network topology from local observations of a complex system composed of interacting units is usually attempted by using statistical similarity measures, such as cross-correlation (CC) and ...
    • Farey graphs as models for complex networks 

      Comellas Padró, Francesc de Paula (2009-08-01)
      Article
      Accés obert
      Farey sequences of irreducible fractions between 0 and 1 can be related to graph constructions known as Farey graphs. These graphs were first introduced by Matula and Kornerup in 1979 and further studied by Colbourn in ...
    • Inferring the connectivity of coupled oscillators from time-series statistical similarity analysis 

      Tirabassi, Giulio; Sevilla Escoboza, Ricardo; Martín Buldú, Javier; Masoller Alonso, Cristina (Macmillan Publishers, 2015-06-04)
      Article
      Accés obert
      A system composed by interacting dynamical elements can be represented by a network, where the nodes represent the elements that constitute the system, and the links account for their interactions, which arise due to a ...
    • Modeling complex networks with self-similar outerplanar unclustered graphs 

      Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia (2009-01-21)
      Article
      Accés obert
      This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low ...
    • Modeling human dynamics of face-to-face interaction networks 

      Starnini, Michele; Baronchelli, Andrea; Pastor Satorras, Romualdo (American Institute of Physics (AIP), 2013-04-15)
      Article
      Accés obert
      Face-to-face interaction networks describe social interactions in human gatherings, and are the substrate for processes such as epidemic spreading and gossip propagation. The bursty nature of human behavior characterizes ...
    • Optimal allocation of node capacity in cascade-robustness networks 

      Chen, Zhen; Zhang, Jun; Du, Wen-Bo; Lordan González, Oriol; Tang, Jiangjun (2015-10-23)
      Article
      Accés obert
      The robustness of large scale critical infrastructures, which can be modeled as complex networks, is of great significance. One of the most important means to enhance robustness is to optimize the allocation of resources. ...
    • Quantifying sudden changes in dynamical systems using symbolic networks 

      Masoller Alonso, Cristina; Hong, Yanhua; Ayad, Sarah; Gustave, Francois; Barland, Stéphane; Pons Rivero, Antonio Javier; Gómez, Sergio; Arenas, Alex (2015-02-24)
      Article
      Accés obert
      We characterize the evolution of a dynamical system by combining two well-known complex systems' tools, namely, symbolic ordinal analysis and networks. From the ordinal representation of a time series we construct a network ...
    • Quantum Google algorithm 

      Paparo, Giuseppe Davide; Muller, Markus; Comellas Padró, Francesc de Paula; Martin Delgado, Miguel Angel (2014-07)
      Article
      Accés obert
      We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773 (2013)) applied to large ...
    • Simplicial degree in complex networks. Applications of topological data analysis to network science 

      Hernández Serrano, Daniel; Hernández Serrano, Juan; Sánchez Gómez, Darío (2020-08)
      Article
      Accés obert
      Network Science provides a universal formalism for modelling and studying complex systems based on pairwise interactions between agents. However, many real networks in the social, biological or computer sciences involve ...
    • Topological complexity of the electricity transmissión network : implications in the sustainability paradigm 

      Rosas Casals, Martí (Universitat Politècnica de Catalunya, 2009-12-18)
      Tesi
      Accés obert
      Aquesta tesi explora i estudia l'estructura, dinàmica i evolució de la xarxa de transmissió d'electricitat des de la perspectiva dels sistemes complexos, essent el seu principal objectiu la definició de nous criteris i ...
    • Towards a framework for the analysis of regulative norm performance in complex networks 

      Oliva Felipe, Luis Javier; Álvarez Napagao, Sergio; Vázquez Salceda, Javier (2012)
      Comunicació de congrés
      Accés obert
      Systemic analysis of dynamics in complex networks has allured interest from different fields. Norms are a mechanism that can be useful to govern or guide the behavior of agents in such scenarios. Such effects of norms can ...
    • Unveiling the complex connectivity of human needs in urban places. Towards a better understanding of the social dimension of sustainability 

      Papachristou, Ioanna Anna; Rosas Casals, Martí (2016-02-05)
      Report de recerca
      Accés obert
      We present a methodology based on complex networks and maximal information methods that, using data from surveys on urban perception at two spatial levels, reveals the connectivity between human needs. Questions, linked ...
    • Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks 

      Comellas Padró, Francesc de Paula; Miralles de la Asunción, Alicia (2009-07)
      Article
      Accés obert
      This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks ...