Suchergebnisse - Generating random combinatorial structures Theory of Computation

Orthogonal Array Sampling for Monte Carlo Rendering von Jarosz, Wojciech, Enayet, Afnan, Kensler, Andrew, Kilpatrick, Charlie, Christensen, Per

“… ‐dimensional integrands like those in rendering, this increases variance and deteriorates its rate of convergence to that of pure random sampling …”
Volltext

Counting and Generating Permutations in Regular Classes von Basset, Nicolas

“… we (i) count the permutations of a given length within the class; (ii) compute a closed form formula for the exponential generating function; and (iii …”
Volltext

Lattice paths with catastrophes von Banderier, Cyril, Wallner, Michael

“… Furthermore, we prove several formulae for related combinatorial structures conjectured in the On-Line Encyclopedia of Integer Sequences. Thanks to the kernel method and via analytic combinatorics, we provide the enumeration and limit laws of these "lattice paths with catastrophes" for any finite set of jumps. We end with an algorithm to generate such lattice paths uniformly at random. Comment: 32 pages …”
Volltext

Controlled non-uniform random generation of decomposable structures von Denise, A., Ponty, Y., Termier, M.

“… Consider a class of decomposable combinatorial structures, using different types of atoms Z = { Z 1 , … , Z ∣ Z …”
Volltext

Reduced Density Matrix Cumulants: The Combinatorics of Size-Consistency and Generalized Normal Ordering von Misiewicz, Jonathon P, Turney, Justin M, Schaefer, Henry F

“… It is shown that both the cumulants of probability theory and the reduced density matrices are entirely combinatorial constructions, where the differences can be associated with changes in the notion …”
Weitere Angaben

Moments of normally distributed random matrices given by generating series for connection coefficients— Explicit algebraic computation von Vassilieva, Ekaterina

“… The connexion coefficients of these two algebraic structures are important numbers with significant applications …”
Volltext

Coverage-biased random exploration of large models and application to testing von Denise, Alain, Gaudel, Marie-Claude, Gouraud, Sandrine-Dominique, Lassaigne, Richard, Oudinet, Johan, Peyronnet, Sylvain

“… Using methods for counting combinatorial structures, these algorithms can efficiently explore very large models, based on a graphical representation by an automaton or by a product of several automata …”
Volltext

2-Xor Revisited: Satisfiability and Probabilities of Functions von de Panafieu, Élie, Gardy, Danièle, Gittenberger, Bernhard, Kuba, Markus

“… The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses x ⊕ y , is satisfiable …”
Volltext

A Linear Algorithm for the Random Sampling from Regular Languages von Bernardi, Olivier, Giménez, Omer

“… More precisely, for generating a uniformly random word of length n in a given regular language, our algorithm has worst-case space bit-complexity O ( n …”
Volltext

A Unified Approach to Linear Probing Hashing with Buckets von Janson, Svante, Viola, Alfredo

“… We give a unified analysis of linear probing hashing with a general bucket size. We use both a combinatorial approach, giving exact formulas for generating …”
Volltext

An Asymptotic Analysis of Labeled and Unlabeled k-Trees von Drmota, Michael, Jin, Emma Yu

“… In this paper we provide a systematic treatment of several shape parameters of (random) k -trees. Our research is motivated by many important algorithmic …”
Volltext

Planted Solutions in Quantum Chemistry: Generating Non-Trivial Hamiltonians with Known Ground States von Wang, Linjun, Cantin, Joshua T, Patel, Smik, Loaiza, Ignacio, Huang, Rick, Izmaylov, Artur F

“… Generating large, nontrivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods …”
Weitere Angaben

Average-Case Local Computation Algorithms von Biswas, Amartya Shankha, Cao, Ruidi, Pyne, Edward, Rubinfeld, Ronitt

“… ) model, we are given probe access to a huge graph, and asked to answer membership queries about some combinatorial structure on the graph, answering each query with sublinear work …”
Volltext

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation von Ekim, Tınaz, Shalom, Mordechai, Şeker, Oylum

“… (Gavril in J Comb Theory 16:47–56, 1974). This characterization has been recently used to generate random chordal graphs on n vertices by generating n subtrees of a tree on n nodes. The space (and thus time …”
Volltext

The left–right-imbalance of binary search trees von Kuba, Markus, Panholzer, Alois

“… We present a detailed study of left–right-imbalance measures for random binary search trees under the random permutation model, i.e …”
Volltext

Controlled non uniform random generation of decomposable structures von Alain, Denise, Ponty, Yann, Termier, Michel

“… Consider a class of decomposable combinatorial structures, using different types of atoms \(\Atoms = \{\At_1,\ldots ,\At_{|{\Atoms …”
Volltext

Computer Algebra Libraries for Combinatorial Structures von Flajolet, Philippe, Salvy, Bruno

“… Many properties of decomposable structures are decidable. Generating function equations, counting sequences, and random generation algorithms can be compiled from specifications …”
Volltext

On the combinatorics of sparsification von Huang, Fenix WD, Reidys, Christian M

“… Sparsification is a method that improves significantly the computation of minimum free energy (mfe) RNA structures. Results We provide a quantitative analysis of the sparsification of a particular decomposition rule …”
Volltext