اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMarkov Chains on Orbits of Permutation Groups
270
0
0.0
(
0
)
تأليف
Mathias Niepert
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.
قيم البحث
اقرأ أيضاً
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 symmetries of g
raphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.
We analyze random walks on a class of semigroups called ``left-regular bands. These walks include the hyperplane chamber walks of Bidigare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are diagonalizable an
d we calculate the eigenvalues and multiplicities. The methods lead to explicit formulas for the projections onto the eigenspaces. As examples of these semigroup walks, we construct a random walk on the maximal chains of any distributive lattice, as well as two random walks associated with any matroid. The examples include a q-analogue of the Tsetlin library. The multiplicities of the eigenvalues in the matroid walks are ``generalized derangement numbers, which may be of independent interest.
This survey paper describes two geometric representations of the permutation group using the tools of toric topology. These actions are extremely useful for computational problems in Schubert calculus. The (torus) equivariant cohomology of the flag v
ariety is constructed using the combinatorial description of Goresky-Kottwitz-MacPherson, discussed in detail. Two permutation representations on equivariant and ordinary cohomology are identified in terms of irreducible representations of the permutation group. We show how to use the permutation actions to construct divided difference operators and to give formulas for some localizations of certain equivariant classes. This paper includes several new results, in particular a new proof of the Chevalley-Monk formula and a proof that one of the natural permutation representations on the equivariant cohomology of the flag variety is the regular representation. Many examples, exercises, and open questions are provided.
In this paper we will present the results of Artin--Markov on braid groups by using the Groebner--Shirshov basis. As a consequence we can reobtain the normal form of Artin--Markov--Ivanovsky as an easy corollary.
We define an excedance number for the multi-colored permutation group, i.e. the wreath product of Z_{r_1} x ... x Z_{r_k} with S_n, and calculate its multi-distribution with some natural parameters. We also compute the multi-distribution of the par
ameters exc(pi) and fix(pi) over the sets of involutions in the multi-colored permutation group. Using this, we count the number of involutions in this group having a fixed number of excedances and absolute fixed points.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
