Exploració per autor "Comellas Padró, Francesc de Paula"Més informacióMés informació

Ara es mostren els items 26-45 de 45

    • Planar unclustered graphs to model technological and biological networks 

      Miralles de la Asunción, Alicia; Chen, Lichao; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2009-02-25)
      Article
      Accés obert
      Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in ...

    • Planar unclustered scale-free graphs as models for technological and biological networks 

      Miralles de la Asunción, Alicia; Comellas Padró, Francesc de Paula; Chen, Lichao; Zhang, Zhongzhi (2010-03-01)
      Article
      Accés restringit per política de l'editorial
      Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, ...

    • Preface special issue: Graph Spectra in Computer Science 

      Comellas Padró, Francesc de Paula (2014-10-30)
      Article
      Accés obert
      Preface to the special issue of Discrete Applied Mathematics with title

    • Proinsulin protects against age-related cognitive loss through anti-inflammatory convergent pathways 

      Corpas, Ruben; Hernández Pinto, Alberto M.; Porquet, David; Hernández Sánchez, Catalina; Bosch, Fatima; Ortega Aznar, Arantxa; Comellas Padró, Francesc de Paula; de la Rosa, Enrique J.; Sanfeliu Pujol, Coral (2017-09-01)
      Article
      Accés obert
      Brain inflammaging is increasingly considered as contributing to age-related cognitive loss and neurodegeneration. Despite intensive research in multiple models, no clinically effective pharmacological treatment has been ...

    • 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 ...

    • Quantum Google in a complex network 

      Paparo, Giuseppe Davide; Muller, Markus; Comellas Padró, Francesc de Paula; Martin Delgado, Miguel Angel (MACMILLAN PUBLISHERS LIMITED, 2013-10-04)
      Article
      Accés obert
      We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify ...

    • Reconstruction of networks from their betweenness centrality 

      Comellas Padró, Francesc de Paula; Paz-Sánchez, Juan (2008-01-07)
      Article
      Accés obert
      In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider ...

    • Self-similar non-clustered planar graphs as models for complex networks 

      Comellas Padró, Francesc de Paula; Zhang, Zhongzhi; Chen, Lichao (2008-10-10)
      Article
      Accés obert
      In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated with complex ...

    • Simulación: un curso innovador en los estudios de Aeronáutica 

      Comellas Padró, Francesc de Paula; González Cinca, Ricardo; Santamaria Barnadas, Eduard (2009-12-01)
      Article
      Accés obert
      Presentamos aquí una nueva metodología en la impartición de un curso de ciencias de la computación con énfasis particular en aspectos de dinámica de fluidos computacional (DFC) y las experiencias que se derivan de esta ...

    • Spectral reconstruction of networks using combinatorial optimization algorithms 

      Comellas Padró, Francesc de Paula; Díaz López, Jordi (2007-05-24)
      Article
      Accés obert
      In this paper we study the reconstruction of a network topology from the eigenvalues of its Laplacian matrix. We introduce a new simple cost function and consider three combinatorial optimization methods - simulated ...

    • The hierarchical product of graphs 

      Barrière Figueroa, Eulalia; Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007)
      Article
      Accés obert
      A new operation on graphs is introduced and some of its properties are studied. We call it hierarchical product, because of the strong (connectedness) hierarchy of the vertices in the resulting graphs. In fact, the ...

    • The Manhattan product of digraphs 

      Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007-10-03)
      Article
      Accés obert
      We give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that when all the factors of the above product are (directed) cycles, then ...

    • The Manhattan product of digraphs 

      Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2013)
      Article
      Accés obert
      We study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can be used to built other ...

    • The multidimensional Manhattan networks 

      Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007)
      Article
      Accés obert
      The $n$-dimensional Manhattan network $M_n$---a special case of $n$-regular digraph---is formally defined and some of its structural properties are studied. In particular, it is shown that $M_n$ is a Cayley digraph, ...

    • The normalized Laplacian spectrum of subdivisions of a graph 

      Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula (2016-08-05)
      Article
      Accés obert
      Determining and analyzing the spectra of graphs is an important and exciting research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information ...

    • The number and degree distribution of spanning trees in the Tower of Hanoi graph 

      Zhang, Zhongzhi; Wu, Shunqi; Li, Mingyun; Comellas Padró, Francesc de Paula (2016-01-04)
      Article
      Accés obert
      The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical ...

    • The number of spanning trees in Apollonian networks 

      Zhang, Zhongzhi; Wu, Bin; Comellas Padró, Francesc de Paula (2014-05-31)
      Article
      Accés obert
      In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including ...

    • The spectra of Manhattan street networks 

      Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2007-10)
      Article
      Accés obert
      The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing, Hamiltonicity, and modular ...

    • Vertex labeling and routing in expanded Apollonian networks 

      Zhang, Zhongzhi; Comellas Padró, Francesc de Paula; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng (2007-07)
      Article
      Accés obert
      We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a ...

    • 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 ...