Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorSpirakis, Paul George
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-03-09T12:56:54Z
dc.date.available2016-03-09T12:56:54Z
dc.date.issued1998-03
dc.identifier.citationDiaz, J., Serna, M., Spirakis, P.G. "Sampling matchings in parallel". 1998.
dc.identifier.urihttp://hdl.handle.net/2117/84049
dc.description.abstractWe 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.abstractWe 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.extent12 p.
dc.language.isoeng
dc.relation.ispartofseriesR98-16
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherParallel algorithms
dc.titleSampling matchings in parallel
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument515092
dc.description.versionPreprint
upcommons.citation.authorDiaz, J., Serna, M., Spirakis, P.G.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder