Browsing by Author "Fàbrega Canudas, José"
Now showing items 1-20 of 71
-
1-Markov chains: Basic concepts
(Universitat Politècnica de Catalunya, 2022-07-08)
Other
Open Access -
2-Markov chains: Absorbing Markov chains
(Universitat Politècnica de Catalunya, 2022-07-08)
Other
Open Access -
3-Markov chains: Stationary distributions
(Universitat Politècnica de Catalunya, 2022-07-08)
Other
Open Access -
4-Markov chains: Limiting distributions
(Universitat Politècnica de Catalunya, 2022-07-08)
Other
Open Access -
A mathematical model for dynamic memory networks
(Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessThe aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A ... -
Algunos grafos compuestos
(Universidad de Barcelona, Departamento de Estadística Matemática;Universidad Politécnica de Barcelona, Escuela Técnica Superior de Arquitectura, Departamento de Matemáticas y Estadística, 1983)
Article
Open AccessFrom two graphs $G_1$ and $G_2$ on $N_1$ and $N_2$ vertices respectively, the compound graph $G_1[G_2]$ on $N_1N_2$ vertices is obtained connecting $N_2$ copies of $G_1$ following the structure of $G_2$. We present in ... -
Basic notions on random processes
(Universitat Politècnica de Catalunya, 2022-03-19)
Other
Open Access -
Combinatorial vs. algebraic characterizations of pseudo-distance-regularity around a set
(2009-06)
Research report
Open AccessGiven a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regularity around $C$ generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to now, most ... -
Connectivity: properties and structure
(CRC Press Taylor & Francis Group, 2013-12-05)
Part of book or chapter of book
Open AccessConnectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, ... -
Digraphs with walks of equal length between vertices
(1984)
Conference report
Open Access -
Distance-layer structure of the De Bruijn and Kautz digraphs: analysis and application to deflection routing
(2023-07-29)
Article
Open AccessIn this article, we present a detailed study of the reach distance-layer structure of the De Bruijn and Kautz digraphs, and we apply our analysis to the performance evaluation of deflection routing in De Bruijn and Kautz ... -
Edge distance-regular graphs
(2011)
Article
Open AccessEdge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... -
Edge-distance-regular graphs
(2011-03-11)
Research report
Open AccessEdge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... -
Edge-distance-regular graphs
(2011)
Article
Restricted access - publisher's policyEdge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a ... -
Enhancing dynamic student learning by teamwork in innovative projects at an Erasmus Mundus master subject adapted to the EHEA (EEES)
(Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació (ICE), 2010)
Conference report
Open AccessThe EHEA (EEES in Spain) is creating common academic degree standards comparable and compatible between the European countries. The definition of the new Credit unit, the ECTS, focused on the ... -
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
(2020-09)
Article
Open AccessThe spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the so-called predistance polynomials can be defined, as a generalization, for any graph, of the ... -
From clutters to matroids
(Universidad de Sevilla, 2013)
Conference report
Restricted access - publisher's policyThis paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion ... -
Further topics in connectivity
(CRC Press Taylor & Francis Group, 2013-12-05)
Part of book or chapter of book
Open AccessContinuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ... -
Gaussian random vectors
(Universitat Politècnica de Catalunya, 2022-02-25)
Other
Open Access -
Generating and characteristic functions
(Universitat Politècnica de Catalunya, 2022-02-04)
Other
Open Access
