Enviaments recents

  • Explicit inverse of a tridiagonal (p,r)-Toeplitz matrix 

    Encinas Bachiller, Andrés Marcos; Jiménez Jiménez, M. Jose (Elsevier, 2017-06-12)
    Article
    Accés restringit per política de l'editorial
    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
    Accés obert
    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 Lombardia, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Accés obert
    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 Lombardia, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos (2014)
    Article
    Accés restringit per política de l'editorial
    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.
  • Resistance distances on networks 

    Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2017)
    Article
    Accés obert
    This paper aims to study a family of distances in networks associated witheffective resistances. Speci cally, we consider the e ective resistance distance with respect to a positive parameter and a weight on the vertex ...
  • The group inverse of subdivision networks 

    Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (2016-10)
    Article
    Accés restringit per política de l'editorial
    In this paper, given a network and a subdivision of it, we show how the Group Inverse of the subdivision network can be related to the Group Inverse of initial given network. Our approach establishes a relationship between ...
  • A family of mixed graphs with large order and diameter 2 

    Araujo Pardo, Gabriela; Balbuena Martínez, Maria Camino Teófila; Miller, Mirka; Zdimalova, Maria (2017-02)
    Article
    Accés restringit per política de l'editorial
    A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed ...
  • Kirchhoff index of a non-complete wheel 

    Gago Álvarez, Silvia (2016)
    Article
    Accés restringit per política de l'editorial
    In this work, we compute analitycally the Kirchhoff index and effective resistances of a weighted non–complete wheel that has been obtained by adding a vertex to a weighted cycle and some edges conveniently chosen. To this ...
  • Effective resistances and Kirchhoff index in subdivision networks 

    Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (Taylor & Francis, 2016-11-12)
    Article
    Accés obert
    We define a subdivision network ¿S of a given network ¿; by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network. In ...
  • Combinatorial recurrences and linear difference equations 

    Jiménez Jiménez, M. Jose; Encinas Bachiller, Andrés Marcos (2016-10-17)
    Article
    Accés restringit per política de l'editorial
    In this work we introduce the triangular arrays of depth greater than 1 given by linear recurrences, that generalize some well known recurrences that appear in enumerative combinatorics. In particular, we focussed on ...

Mostra'n més