Browsing by Author "Miralles de la Asunción, Alicia"
Now showing items 1-16 of 16
-
A fast and efficient algorithm to identify clusters in networks
(2008-08-02)
Article
Open AccessA characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this ... -
A fast and efficient algorithm to identify clusters in networks
(2010-11-01)
Article
Restricted access - publisher's policyA characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this ... -
Aprenentatge de càlcul
(Edicions UPC, 2002)
Book
Restricted access to the UPC academic communityConté: 1. Successions, continuïtat i derivació. 2. Integració i sèries. -
Conceptes de matemàtiques: llista de problemes amb solucions
(Universitat Politècnica de Catalunya, 2008)
Problem statement, exercise
Open Access -
Familias infinitas de digrafos de Cayley de grado 2 óptimos sobre grupos abelianos finitos
(Universidad de Almería, 2012)
Conference report
Restricted access - publisher's policySea GN un grupo abeliano finito de orden N. Para cada conjunto de generadores f, g = GN, consideremos el digrafo de Cayley Cay(GN, {f, g}). Seg´un sea GN c´ıclico o no c´ıclico, podemos obtener un di´ametro ´optimo ... -
Generalized Discontinuous Conduction Modes in the Complementarity Formalism
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2005-08)
Article
Open AccessWe model dc–dc power converters using the complementarity formalism. For each position of the switches, the dynamics is given by a linear complementarity system which incorporates, in a natural way, the description of ... -
Mean first-passage time for random walks on generalized deterministic recursive trees
(2010-01-11)
External research report
Open Access -
Modeling complex networks with self-similar outerplanar unclustered graphs
(2009-01-21)
Article
Open AccessThis paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low ... -
Planar unclustered graphs to model technological and biological networks
(2009-02-25)
Article
Open AccessMany 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
(2010-03-01)
Article
Restricted access - publisher's policyMany 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, ... -
Probabilitat i estadística
(Edicions UPC, 2003)
Book
Restricted access to the UPC academic communityEn aquest llibre s'ofereix una introducció a la probabilitat i a l'estadística adaptada a l'alumnat de primer curs d'una enginyeria tècnica, especialment les enginyeries relacionades amb les tecnologies de la informació. ... -
Probabilitat i estadística
(Edicions UPC, 2005)
Book
Restricted access to UB, UAB, UPC, UPF, UdG, UdL, URV, UOC, BC, UVic, UJI, URL, UIC usersEn aquest llibre s'ofereix una introducció a la probabilitat i a l'estadística adaptada a l'alumnat de primer curs d'una enginyeria tècnica, especialment les enginyeries relacionades amb les tecnologies de la informació. ... -
Probabilitat i estadística : problemes
(Universitat Politècnica de Catalunya, 2004)
Problem statement, exercise
Open Access -
Propiedades estructurales en 2-digrafos de Cayley óptimos sobre grupos abelianos finitos
(Universidad de Almería, 2012)
Conference report
Open AccessEn este trabajo se presentan algunas propiedades estructurales de los digrafos de Cayley de grado dos con diámetro óptimo, sobre grupos finitos abelianos. En particular, cuando el grupo no es cíclico, todos los digrafos ... -
The Frobenius problem: a geometric approach
(2007-07)
Article
Open AccessFor the well known Frobenius problem, we present a new geometric approach, based on the use of the $n$-dimensional lattice $\mathbb{Z}^n$, where $n$ is the number of generators. Within this approach we are able to study ... -
Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
(2009-07)
Article
Open AccessThis 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 ...
