{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-639WUEPZ/68F369C4-DB51-483B-9E72-5E6F57518F70/PDF","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-639WUEPZ/be17d845-4774-4af6-9dc0-0015966357b8/PDF","dcterms:extent":"290 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-639WUEPZ/b7560c2b-152f-4828-a8c5-b74817f66ae6/TEXT","dcterms:extent":"34 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-639WUEPZ","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2013","dc:creator":["Policriti, Alberto","Tomescu, Alexandru I."],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:6"},{"@xml:lang":"sl","#text":"str. 57-68"}],"dc:identifier":["COBISSID:16468569","ISSN:1855-3966","URN:URN:NBN:SI:doc-639WUEPZ"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"extensional digraph"},{"@xml:lang":"en","#text":"Markov chain"},{"@xml:lang":"en","#text":"random generation"},{"@xml:lang":"en","#text":"set theory"},{"@xml:lang":"en","#text":"transitive set"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Markov chain algorithms for generating sets uniformly at random|"},"dc:description":{"@xml:lang":"sl","#text":"In this paper we tackle the problem of generating uniformly at random two representative types of sets with n elements: transitive sets and weakly transitive sets, that is, transitive sets with atoms. A set is said to be transitive if any of its elements is also a subset of it; a set is weakly transitive if any of its elements, unless disjoint from it, is also a subset of it. We interpret such sets as (weakly) extensional acyclic digraphs - that is, acyclic digraphs whose (non-sink) vertices have pairwise different out-neighborhoods - and employ a Markov chain technique already given for acyclic digraphs. We thus propose Markov chain-based algorithms for generating uniformly at random (weakly) extensional acyclic digraphs with a given number of vertices. The Markov chain is then refined to generate such digraphs which are also simply connected, and digraphs in which the number of arcs is fixed"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:DOC-639WUEPZ","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-639WUEPZ"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-639WUEPZ/68F369C4-DB51-483B-9E72-5E6F57518F70/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:DOC-639WUEPZ/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-639WUEPZ"}}}}