L'activitat investigadora del grup COMPTHE s'emmarca en el context de la matemàtica aplicada, concretament en matemàtica discreta i combinatòria. S'estudien problemes extremals en grafs per millorar-ne fites conegudes i per construir noves famílies de grafs extremals. La robustesa de les xarxes s'analitza fent servir paràmetres com ara la connectivitat, la vulnerabilitat, la dominació o la resistència efectiva. Per altra banda, l'anàlisi de dades a la frontera d'una xarxa possibilita analitzar-ne la seva estructura interna.

http://futur.upc.edu/COMPTHE

Recent Submissions

  • Vertex-disjoint cycles in bipartite tournaments 

    González Moreno, Diego; Balbuena Martínez, Maria Camino Teófila; Olsen, Mika (2016-10)
    Article
    Open Access
    Let k=2 be an integer. Bermond and Thomassen conjectured that every digraph with minimum out-degree at least 2k-1 contains k vertex-disjoint cycles. Recently Bai, Li and Li proved this conjecture for bipartite digraphs. ...
  • Characterizing identifying codes through the spectrum of a graph or digraph 

    Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2017)
    Conference report
    Open Access
  • Funciones de green en redes producto 

    Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (Universidad de Cádiz, 2017)
    Conference report
    Restricted access - publisher's policy
    En esta comunicación presentaremos la versión discreta del método de separación de variables para determinar la función de Green de redes producto en términos de la función de Green de uno de las redes factores y los ...
  • Resistive distances on networks 

    Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2016)
    Conference report
    Open Access
  • Discrete inverse problem on grids 

    Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2016)
    Conference report
    Open Access
    In this work, we present an algorithm to the recovery of the conductance of a n –dimensional grid. The algorithm is based in the solution of some overdetermined partial boundary value problems defined on the grid; that is, ...
  • Green’s kernel for subdivision networks 

    Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (2016)
    Conference report
    Open Access
  • Effective resistances and Kirchhoff index in subdivision networks 

    Carmona Mejías, Ángeles; Monsó Burgués, Enrique P.J.; Mitjana Riera, Margarida (2016)
    Conference report
    Restricted access - publisher's policy
    In this work we compute the effective resistances and the Kirchhoff Index of subdivision networks in terms of the corresponding parameters of the original network. Our techniques are based on the study of discrete operators ...
  • Green's function of a weighted $n$-cycle 

    Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia; Jiménez Jiménez, María José; Mitjana Riera, Margarida (2016)
    Conference report
    Open Access
  • Explicit inverse of a tridiagonal (p,r)-Toeplitz matrix 

    Encinas Bachiller, Andrés Marcos; Jiménez Jiménez, María José (Elsevier, 2018-04-01)
    Article
    Open Access
    We have named tridiagonal (p,r)–Toeplitz matrix to those tridiagonal matrices in which each diagonal is a quasi–periodic sequence, d(p+j)=rd(j), so with period p¿N but multiplied by a real number r. We present here the ...
  • Equilibrium measures on finite networks. Effective resistance and hitting time 

    Carmona Mejías, Ángeles; Bendito Pérez, Enrique; Encinas Bachiller, Andrés Marcos (2001)
    Article
    Open Access
    We aim here at showing how the equilibrium measures for a finite network can be used to obtain simple expressions for both Green and Poisson kernels and hence we can deduce nice expressions of the hitting time and the ...
  • Dirichlet-to-Robin matrix on networks 

    Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Open Access
    In this work, we de ne the Dirichlet{to{Robin matrix associated with a Schr odinger type matrix on general networks, and we prove that it satis es the alternating property which is essential to characterize those matrices ...
  • Recovering the conductances on grids 

    Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Restricted access - publisher's policy
    In this work, we present an algorithm to the recovery of the conductance of a 2– dimensional grid. The algorithm is based in the solution of some overdetermined partial boundary value problems defined on the grid.

View more