相关论文: Revisiting the Universal Texture Zero of Flavour: …

We present an extensive study of non-minimally flavour violating (NMFV) terms in the Lagrangian of the Minimal Supersymmetric Standard Model (MSSM). We impose a variety of theoretical and experimental constraints and perform a detailed scan…

Markov chain Monte Carlo (MCMC) is a key algorithm in computational statistics, and as datasets grow larger and models grow more complex, many popular MCMC algorithms become too computationally expensive to be practical. Recent progress has…

Texture matrices are a way of mitigating the redundancy inherent in the description of flavor physics via Yukawa couplings by eliminating some entries in order to identify relevant parameters. A four-zero texture scheme has been used in the…

We carry out a new study of quark mass matrices $M^{}_{\rm u}$ (up-type) and $M^{}_{\rm d}$ (down-type) which are Hermitian and have four zero entries, and find a new part of the parameter space which was missed in the previous works. We…

We stress that specific texture zeros of lepton mass matrices, which might dynamically arise from a new kind of flavor symmetry, can help us to establish simple and testable relations between the lepton flavor mixing parameters and lepton…

We define a new class of Z' models with neutral flavour-changing interactions at tree level in the down-quark sector. They are related in an exact way to elements of the quark mixing matrix due to an underlying flavoured U(1)' gauge…

We present a numeric method for the analysis of the fermion mass matrices predicted in flavour models. The method does not require any previous algebraic work, it offers a $\chi^{2}$ comparison test and an easy estimate of confidence…

We attempt to trace the history and development of Markov chain Monte Carlo (MCMC) from its early inception in the late 1940s through its use today. We see how the earlier stages of Monte Carlo (MC, not MCMC) research have led to the…

Adaptive Markov chain Monte Carlo (MCMC) algorithms, which automatically tune their parameters based on past samples, have proved extremely useful in practice. The self-tuning mechanism makes them `non-Markovian', which means that their…

Markov Chain Monte Carlo (MCMC) is a computational approach to fundamental problems such as inference, integration, optimization, and simulation. The field has developed a broad spectrum of algorithms, varying in the way they are motivated,…

Motivated by the recently improved results from the Fermilab Lattice and MILC Collaborations on the hadronic matrix elements entering $\Delta M_{s,d}$ in $B_{s,d}^0-\bar B_{s,d}^0$ mixing, we determine the Universal Unitarity Triangle (UUT)…

We revisit the minimal type II seesaw mechanism generating the Majorana neutrino mass matrix $M^{\nu}$, under the assumption that two entries of $M^{\nu}$ vanish. Such flavor structures are known as two-zero textures. Processes with charged…

Interest is in evaluating, by Markov chain Monte Carlo (MCMC) simulation, the expected value of a function with respect to a, possibly unnormalized, probability distribution. A general purpose variance reduction technique for the MCMC…

Markov Chain Monte Carlo (MCMC) is a class of algorithms to sample complex and high-dimensional probability distributions. The Metropolis-Hastings (MH) algorithm, the workhorse of MCMC, provides a simple recipe to construct reversible…

We study the predictions for CP phases and absolute neutrino mass scale for broad classes of models with a U(2) flavor symmetry. For this purpose we consider the same special textures in neutrino and charged lepton mass matrices that are…

We consider the recently introduced Transformation-based Markov Chain Monte Carlo (TMCMC) (Dutta and Bhattacharya (2014)), a methodology that is designed to update all the parameters simultaneously using some simple deterministic…

The Markov Chain Monte Carlo (MCMC) algorithm is a widely recognised as an efficient method for sampling a specified posterior distribution. However, when the posterior is multi-modal, conventional MCMC algorithms either tend to become…

Texture zeros in fermion mass matrices have been widely considered in tackling the Standard Model flavour puzzle. In this work, we perform a systematic analysis of texture zeros in lepton mass matrices in the framework of $\Gamma_{3}'\cong…

This paper presents a novel framework for enhancing the quantum resistance of NTRUEncrypt using Markov Chain Monte Carlo (MCMC) methods. We establish formal bounds on sampling efficiency and provide security reductions to lattice problems,…

Against the conventional picture that the mass matrix forms in the quark sectors will take somewhat different structures from those in the lepton sectors, on the basis of an idea that all the mass matrices of quarks and leptons have the…