Related papers: Evaluation of the Permutational Structure of the C…
We give a path integral construction of the quantum mechanical partition function for gauged finite groups. Our construction gives the quantization of a system of $d$, $N\times N$ matrices invariant under the adjoint action of the symmetric…
A simple algorithm is described to sample permutations of identical particles in Path Integral Monte Carlo (PIMC) simulations of continuum many-body systems. The sampling strategy illustrated here is fairly general, and can be easily…
We compare different analytical and numerical methods for studying the partitions of a finite system into fragments. We propose a new numerical method of exploring the partition space by generating the Markov chains of partitions based on…
We propose a phase-space path integral formulation of noncommutative quantum mechanics, and prove its equivalence to the operatorial formulation. As an illustration, the partition function of a noncommutative two-dimensional harmonic…
We initiate a Stein's method approach to the study of the Plancherel measure of the symmetric group. A new proof of Kerov's central limit theorem for character ratios of random representations of the symmetric group on transpositions is…
Although the Hamiltonian formalism is so far favored for quantum computation of lattice gauge theory, the path integral formalism would never be useless. The advantages of the path integral formalism are the knowledge and experience…
The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…
Expanding upon the rich history of algebraic techniques in probability, we show the existence of and construct a Markov chain using the Hopf square map on a quantum group that is both non-commutative and non-cocommutative. This extends the…
This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems. Relevant aspects of the Hamiltonian path integral and its measure are…
In this paper we develop a general framework for constructing and analysing coupled Markov chain Monte Carlo samplers, allowing for both (possibly degenerate) diffusion and piecewise deterministic Markov processes. For many performance…
We address the problem of the minus sign sampling for two electron systems using the path integral approach. We show that this problem can be reexpressed as one of computing free energy differences and sampling the tails of statistical…
The exchange antisymmetry between identical fermions gives rise to the well known fermion sign problem, in the form of large cancellation between positive and negative contribution to the partition function, making any simulation methods…
In this paper, we introduce a classical algorithm for random sampling of permutations, drawing inspiration from the Steinhaus-Johnson-Trotter algorithm. Our approach takes a comprehensive view of permutation sampling by expressing them as…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
We consider conditional tests for non-negative discrete exponential families. We develop two Markov Chain Monte Carlo (MCMC) algorithms which allow us to sample from the conditional space and to perform approximated tests. The first…
We study the formulation of quantum statistical mechanics in noncommutative spaces. We construct microcanonical and canonical ensemble theory in noncommutative spaces. We consider for illustration some basic and important examples in the…
Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…
In the context of the graph matching problem we propose a novel method for projecting a matrix $Q$, which may be a doubly stochastic matrix, to a permutation matrix $P.$ We observe that there is an intuitve mapping, depending on a given…