2011
DOI: 10.1137/100790082
|View full text |Cite
|
Sign up to set email alerts
|

Boltzmann Samplers, Pólya Theory, and Cycle Pointing

Abstract: Abstract. We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n pointed structures. We extend Pólya theory to the corresponding pointing operator, and present a random sampling framework based on both the principles of Boltzmann sampling and on Pólya operators. All previously known unlabeled construction principles for Boltzmann s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
75
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 37 publications
(76 citation statements)
references
References 25 publications
(71 reference statements)
0
75
0
Order By: Relevance
“…In the case normalΩ=double-struckN, Benjamini‐Schramm convergence for Tn was independently obtained by Georgakopoulos and Wagner using different techniques. Our methods for the proof of Theorems and are based on the cycle pointing decomposition established recently by Bodirsky, Fusy, Kang and Vigerske . This novel and effective centering method differs fundamentally from classical approaches, such as the geometric center, and applies to arbitrary classes of combinatorial structures.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…In the case normalΩ=double-struckN, Benjamini‐Schramm convergence for Tn was independently obtained by Georgakopoulos and Wagner using different techniques. Our methods for the proof of Theorems and are based on the cycle pointing decomposition established recently by Bodirsky, Fusy, Kang and Vigerske . This novel and effective centering method differs fundamentally from classical approaches, such as the geometric center, and applies to arbitrary classes of combinatorial structures.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…More details on this structural result are given in [, Section 4.3], [, Sec. 2.6.2] and [, Section 3].…”
Section: Combinatorial Species Of Structuresmentioning
confidence: 99%
See 3 more Smart Citations