Mostra el registre d'ítem simple
Sampling matchings in parallel
dc.contributor.author | Díaz Cort, Josep |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.author | Spirakis, Paul George |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-03-09T12:56:54Z |
dc.date.available | 2016-03-09T12:56:54Z |
dc.date.issued | 1998-03 |
dc.identifier.citation | Diaz, J., Serna, M., Spirakis, P.G. "Sampling matchings in parallel". 1998. |
dc.identifier.uri | http://hdl.handle.net/2117/84049 |
dc.description.abstract | We present a parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. The technique used is based on the definition of a genetic system that converges to the uniform distribution. The system evolves according to a non-linear equation. Little is known about the convergence of these systems. We can define a non-linear system which converges to a stationary distribution under quite natural conditions. We prove convergence for the system corresponding to the almost uniform sampling of matchings in a graph (up to know the only known convergence for non-linear systems for matchings was matchings on a tree). We give empirical evidence that the system converges fast. |
dc.description.abstract | We present a parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. The technique used is based on the definition of a genetic system that converges to the uniform distribution. The system evolves according to a non-linear equation. Little is known about the convergence of these systems. We can define a non-linear system which converges to a stationary distribution under quite natural conditions. We prove convergence for the system corresponding to the almost uniform sampling of matchings in a graph (up to know the only known convergence for non-linear systems for matchings was matchings on a tree). We give empirical evidence that the system converges fast. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | R98-16 |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Parallel algorithms |
dc.title | Sampling matchings in parallel |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 515092 |
dc.description.version | Preprint |
local.citation.author | Diaz, J.; Serna, M.; Spirakis, P.G. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]