DSpace Community:
http://hdl.handle.net/2117/3740
2014-04-20T08:40:50ZOn the nucleolus of 2 × 2 assignment games
http://hdl.handle.net/2117/21814
Title: On the nucleolus of 2 × 2 assignment games
Authors: Martínez De Albeniz, Javier; Rafels Pallarola, Carlos; Ybern Carballo, M. de Las Nieves
Abstract: We provide explicit formulas for the nucleolus of an arbitrary assignment game with two buyers and two sellers. Five different cases are analyzed depending on the entries of the assignment matrix. We extend the results to the case of 2 × m or m × 2 assignment games.2014-02-28T15:22:22ZA procedure to compute the nucleolus of the assignment game
http://hdl.handle.net/2117/21811
Title: A procedure to compute the nucleolus of the assignment game
Authors: Martínez De Albeniz, Javier; Rafels Pallarola, Carlos; Ybern Carballo, M. de Las Nieves
Abstract: The assignment game introduced by Shapley and Shubik (1972) [6] is a model for a two-sided market where there is an exchange of indivisible goods for money and buyers or sellers demand or supply exactly one unit of the goods. We give a procedure to compute the nucleolus of any assignment game, based on the distribution of equal amounts to the agents, until the game is reduced to fewer agents.2014-02-28T15:06:04ZLa función de Green y el índice de Kirchhoff de redes cluster
http://hdl.handle.net/2117/21039
Title: La función de Green y el índice de Kirchhoff de redes cluster
Authors: Arauz Lombardía, Cristina; Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos
Abstract: En este trabajo determinamos las Funciones de Green, respecto de un peso fijado sobre los vértices, en una amplia clase de redes compuestas que se engloban bajo la denominación de redes cluster. También aplicamos las expresiones obtenidas al
cálculo de la resistencia efectiva, respecto de un peso, entre cualquier par de vértices y
el Índice de Kirchhoff de la red cluster, en términos de los parámetros correspondientes
a cada uno de sus factores. Finalmente mostramos que la particularización de nuestros resultados al caso estándar, esto es, al caso de grafos con peso constante en los vértices recupera las expresiones obtenidas por otros autores en trabajos previos.2013-12-17T14:05:05ZGreen function on product networks
http://hdl.handle.net/2117/21038
Title: Green function on product networks
Authors: Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos
Abstract: Our objective is to determine the Green function of product networks in terms of the Green function of one of the factor networks and the eigenvalues and eigenfunctions of the Schr odinger operator of the other factor network, which we consider that are known. Moreover, we use these results to obtain the Green function of spider networks in terms of Green functions over cicles and paths.2013-12-17T13:44:47ZBoundary value problems for Schrödinger operators on a Path Associated to Orthogonal Polynomials
http://hdl.handle.net/2117/20424
Title: Boundary value problems for Schrödinger operators on a Path Associated to Orthogonal Polynomials
Authors: Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia
Abstract: In this work, we concentrate on determining explicit expressions, via
suitable orthogonal polynomials on the line, for the Green function associated with
any regular boundary value problem on a weighted path, whose weights are determined
by the coefficients of the three-term recurrence relation.2013-10-21T08:34:14ZTwo-side boundary value problems in distance-regular graphs
http://hdl.handle.net/2117/17276
Title: Two-side boundary value problems in distance-regular graphs
Authors: Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia
Abstract: In this work we analyze regular boundary value problems on a distanceregular
graph associated with Schr¨odinger operators in the case that the boundary has
two vertices. Moreover, we obtain the Green matrix for each regular problem. In each
case, the Green matrix is given in terms of two families of orthogonal polynomials, one
of them corresponding with the distance polynomials of the distance-regular graph.2013-01-11T12:28:45ZThe Green function of a perturbed network
http://hdl.handle.net/2117/16454
Title: The Green function of a perturbed network
Authors: Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida
Abstract: The díscrete Green functions and their relationship whit discrete Laplace equations
have deserved the interest of many researchs useing different approac. In this work we derive the Green function of a perturbed network in terms of the Green function of its base network.2012-09-07T10:39:29ZGeneralized linear polyominoes, Green functions and Green matrices
http://hdl.handle.net/2117/16453
Title: Generalized linear polyominoes, Green functions and Green matrices
Authors: Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida
Abstract: In this work we derive the Creen function of a generalized linear Polyomino as a suitable perturbation of the Creen function of a Hamiltonian path on it. So, our study encompasses previous work:; on polyomino-like chains.2012-09-07T10:28:56ZBoundary value problems for Schrödinger operators on a path
http://hdl.handle.net/2117/16111
Title: Boundary value problems for Schrödinger operators on a path
Authors: Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia
Abstract: In this work, we concentrate on determining explicit expressions, via suitable orthogonal polynomials on the line, for the Green function associated with any regular boundary value problem on a weighted path, whose weights are determined by the coefficients of the three terms recurrence relation defining the polynomials. Our study is similar to what is known for boundary value problems associated with ordinary differential equations.2012-06-21T08:55:34ZBetweenness-selfcentric graphs
http://hdl.handle.net/2117/15768
Title: Betweenness-selfcentric graphs
Authors: Gago Álvarez, Silvia; Hurajová, Jana; Madaras, Tomas
Abstract: The betweenness centrality of a vertex of a graph is the portion of shortest paths between all pairs of vertices passing through that vertex. In this paper, we study properties and constructions of graphs whose vertices have the same value of betweenness centrality.2012-05-02T08:54:06ZSmoothing of yield surfaces and a reformulation of multi-surface plasticity
http://hdl.handle.net/2117/14935
Title: Smoothing of yield surfaces and a reformulation of multi-surface plasticity
Authors: Gesto Beiroa, José Manuel; Gens Solé, Antonio; Vaunat, Jean
Abstract: In this work we describe a procedure for the smoothing of non-regular yield surfaces and
plastic potential functions. We also present several application examples corresponding to different well-known cases. Moreover, we show that a multi-surface plasticity model can be reduced to a model with a single yield surface by using the same smoothing procedure.2012-02-03T18:49:51ZJacobi matrices and boundary value problems in distance-regular graphs
http://hdl.handle.net/2117/14821
Title: Jacobi matrices and boundary value problems in distance-regular graphs
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gago Álvarez, Silvia
Abstract: In this work we analyze regular boundary value problems on a distance-regular graph associated with SchrÄodinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain the Green matrix for each regular problem. In each case, the Green matrices are given in terms of two families of orthogonal polynomials one of them corresponding with the distance polynomials of the distance-regular graphs.2012-01-26T10:21:55ZM-Matrix Inverse problem for distance-regular graphs
http://hdl.handle.net/2117/8331
Title: M-Matrix Inverse problem for distance-regular graphs
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida2010-07-22T07:31:15ZKirchhoff indexes of a network
http://hdl.handle.net/2117/8290
Title: Kirchhoff indexes of a network
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel; Mitjana Riera, Margarida
Abstract: In this work we define the effective resistance between any pair of vertices with respect to a value λ ≥ 0 and a weight ω on the vertex set. This allows us to consider a generalization of the Kirchhoff Index of a finite network. It turns out that λ is the lowest eigenvalue of a suitable semi-definite positive Schrödinger operator and ω is the associated eigenfunction. We obtain the relation between the effective resistance, and hence between the Kirchhoff Index, with respect to λ and ω and the eigenvalues of the associated Schrödinger
operator. However, our main aim in this work is to get explicit expressions of the above parameters in terms of equilibrium measures
of the network. From these expressions, we derive a full generalization of Foster’s formulae that incorporate a positive probability of remaining in each vertex in every step of a random walk. Finally, we compute the effective resistances and the generalized Kirchhoff Index with respect to a λ and ω for some families of networks with
symmetries, specifically for weighted wagon-wheels and circular ladders.2010-07-21T08:33:04ZA formula for the Kirchhoff index
http://hdl.handle.net/2117/1247
Title: A formula for the Kirchhoff index
Authors: Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel
Abstract: We show here that the Kirchhoff index of a network is the average of the Wiener capacities of its vertices. Moreover, we obtain a closed-form formula for the effective resistance between any pair of vertices when the considered network has some symmetries which allows us to give the corresponding formulas for the Kirchhoff index. In addition, we find the expression for the Foster's n-th Formula.2007-10-17T14:55:49Z