955 resultados para Markov random fields (MRFs)
Resumo:
We develop a general theory of Markov chains realizable as random walks on R-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via Mobius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom-Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.
Resumo:
The ``synthetic dimension'' proposal A. Celi et al., Phys. Rev. Lett. 112, 043001 (2014)] uses atoms with M internal states (''flavors'') in a one-dimensional (1D) optical lattice, to realize a hopping Hamiltonian equivalent to the Hofstadter model (tight-binding model with a given magnetic flux per plaquette) on an M-sites-wide square lattice strip. We investigate the physics of SU(M) symmetric interactions in the synthetic dimension system. We show that this system is equivalent to particles with SU(M) symmetric interactions] experiencing an SU(M) Zeeman field at each lattice site and a non-Abelian SU(M) gauge potential that affects their hopping. This equivalence brings out the possibility of generating nonlocal interactions between particles at different sites of the optical lattice. In addition, the gauge field induces a flavor-orbital coupling, which mitigates the ``baryon breaking'' effect of the Zeeman field. For M particles, concomitantly, the SU(M) singlet baryon which is site localized in the usual 1D optical lattice, is deformed to a nonlocal object (''squished baryon''). We conclusively demonstrate this effect by analytical arguments and exact (numerical) diagonalization studies. Our study promises a rich many-body phase diagram for this system. It also uncovers the possibility of using the synthetic dimension system to laboratory realize condensed-matter models such as the SU(M) random flux model, inconceivable in conventional experimental systems.
Resumo:
The influences of the fluctuation fields are important in many astrophysical environments as shown by the observations, and can not be neglected. On the basis of the first-order smoothing approximation, in the present paper, we demonstrate the magnetostatic equations for both the cases of the conventional turbulence aud the random waves, and discuss the consistent conditions of the equations. In the static problem, the fluctuation Lorentz force(▽×δB)×δB influences the large-scale configurations of magnetic field. To study this influence in detail is quite necessary for the explanations of the observation features, especially for the astrophysical environments where the magnetic fields, including the fluctuation fields, are the dominant factors in the equilibrium of momentum and energy.
Resumo:
In this paper, reanalysis fields from the ECMWF have been statistically downscaled to predict from large-scale atmospheric fields, surface moisture flux and daily precipitation at two observatories (Zaragoza and Tortosa, Ebro Valley, Spain) during the 1961-2001 period. Three types of downscaling models have been built: (i) analogues, (ii) analogues followed by random forests and (iii) analogues followed by multiple linear regression. The inputs consist of data (predictor fields) taken from the ERA-40 reanalysis. The predicted fields are precipitation and surface moisture flux as measured at the two observatories. With the aim to reduce the dimensionality of the problem, the ERA-40 fields have been decomposed using empirical orthogonal functions. Available daily data has been divided into two parts: a training period used to find a group of about 300 analogues to build the downscaling model (1961-1996) and a test period (19972001), where models' performance has been assessed using independent data. In the case of surface moisture flux, the models based on analogues followed by random forests do not clearly outperform those built on analogues plus multiple linear regression, while simple averages calculated from the nearest analogues found in the training period, yielded only slightly worse results. In the case of precipitation, the three types of model performed equally. These results suggest that most of the models' downscaling capabilities can be attributed to the analogues-calculation stage.
Resumo:
We present a method of image-speckle contrast for the nonprecalibration measurement of the root-mean-square roughness and the lateral-correlation length of random surfaces with Gaussian correlation. We use the simplified model of the speckle fields produced by the weak scattering object in the theoretical analysis. The explicit mathematical relation shows that the saturation value of the image-speckle contrast at a large aperture radius determines the roughness, while the variation of the contrast with the aperture radius determines the lateral-correlation length. In the experimental performance, we specially fabricate the random surface samples with Gaussian correlation. The square of the image-speckle contrast is measured versus the radius of the aperture in the 4f system, and the roughness and the lateral-correlation length are extracted by fitting the theoretical result to the experimental data. Comparison of the measurement with that by an atomic force microscope shows our method has a satisfying accuracy. (C) 2002 Optical Society of America.
Resumo:
This dissertation studies long-term behavior of random Riccati recursions and mathematical epidemic model. Riccati recursions are derived from Kalman filtering. The error covariance matrix of Kalman filtering satisfies Riccati recursions. Convergence condition of time-invariant Riccati recursions are well-studied by researchers. We focus on time-varying case, and assume that regressor matrix is random and identical and independently distributed according to given distribution whose probability distribution function is continuous, supported on whole space, and decaying faster than any polynomial. We study the geometric convergence of the probability distribution. We also study the global dynamics of the epidemic spread over complex networks for various models. For instance, in the discrete-time Markov chain model, each node is either healthy or infected at any given time. In this setting, the number of the state increases exponentially as the size of the network increases. The Markov chain has a unique stationary distribution where all the nodes are healthy with probability 1. Since the probability distribution of Markov chain defined on finite state converges to the stationary distribution, this Markov chain model concludes that epidemic disease dies out after long enough time. To analyze the Markov chain model, we study nonlinear epidemic model whose state at any given time is the vector obtained from the marginal probability of infection of each node in the network at that time. Convergence to the origin in the epidemic map implies the extinction of epidemics. The nonlinear model is upper-bounded by linearizing the model at the origin. As a result, the origin is the globally stable unique fixed point of the nonlinear model if the linear upper bound is stable. The nonlinear model has a second fixed point when the linear upper bound is unstable. We work on stability analysis of the second fixed point for both discrete-time and continuous-time models. Returning back to the Markov chain model, we claim that the stability of linear upper bound for nonlinear model is strongly related with the extinction time of the Markov chain. We show that stable linear upper bound is sufficient condition of fast extinction and the probability of survival is bounded by nonlinear epidemic map.
Resumo:
A segmentação dos nomes nas suas partes constitutivas é uma etapa fundamental no processo de integração de bases de dados por meio das técnicas de vinculação de registros. Esta separação dos nomes pode ser realizada de diferentes maneiras. Este estudo teve como objetivo avaliar a utilização do Modelo Escondido de Markov (HMM) na segmentação nomes e endereços de pessoas e a eficiência desta segmentação no processo de vinculação de registros. Foram utilizadas as bases do Sistema de Informações sobre Mortalidade (SIM) e do Subsistema de Informação de Procedimentos de Alta Complexidade (APAC) do estado do Rio de Janeiro no período entre 1999 a 2004. Uma metodologia foi proposta para a segmentação de nome e endereço sendo composta por oito fases, utilizando rotinas implementadas em PL/SQL e a biblioteca JAHMM, implementação na linguagem Java de algoritmos de HMM. Uma amostra aleatória de 100 registros de cada base foi utilizada para verificar a correção do processo de segmentação por meio do modelo HMM.Para verificar o efeito da segmentação do nome por meio do HMM, três processos de vinculação foram aplicados sobre uma amostra das duas bases citadas acima, cada um deles utilizando diferentes estratégias de segmentação, a saber: 1) divisão dos nomes pela primeira parte, última parte e iniciais do nome do meio; 2) divisão do nome em cinco partes; (3) segmentação segundo o HMM. A aplicação do modelo HMM como mecanismo de segmentação obteve boa concordância quando comparado com o observador humano. As diferentes estratégias de segmentação geraram resultados bastante similares na vinculação de registros, tendo a estratégia 1 obtido um desempenho pouco melhor que as demais. Este estudo sugere que a segmentação de nomes brasileiros por meio do modelo escondido de Markov não é mais eficaz do que métodos tradicionais de segmentação.
Resumo:
This paper discusses the problem of restoring a digital input signal that has been degraded by an unknown FIR filter in noise, using the Gibbs sampler. A method for drawing a random sample of a sequence of bits is presented; this is shown to have faster convergence than a scheme by Chen and Li, which draws bits independently. ©1998 IEEE.
Resumo:
In this work, we examine the phenomenon of random lasing from the smectic A liquid crystal phase. We summarise our results to date on random lasing from the smectic A phase including the ability to control the output from the sample using applied electric fields. In addition, diffuse random lasing is demonstrated from the electrohydrodynamic instabilities of a smectic A liquid crystal phase that has been doped with a low concentration of ionic impurities. Using a siloxane-based liquid crystal doped with ionic impurities and a laser dye, nonresonant random laser emission is observed from the highly scattering texture of the smectic A phase which is stable in zero-field. With the application of a low frequency alternating current electric field, turbulence is induced due to motion of the ions. This is accompanied by a decrease in the emission linewidth and an increase in the intensity of the laser emission. The benefit in this case is that a field is not required to maintain the texture as the scattering and homeotropic states are both stable in zero field. This offers a lower power consumption alternative to the electric-field induced static scattering sample.
Resumo:
Using a chiral nematic liquid crystal with a negative dielectric anisotropy, it is possible to switch between band-edge laser emission and random laser emission with an electric field. At low frequencies (1 kHz), random laser emission is observed as a result of scattering due to electro-hydrodynamic instabilities. However, band-edge laser emission is found to occur at higher frequencies (5 kHz), where the helix is stabilized due to dielectric coupling. These results demonstrate a method by which the linewidth of the laser source can be readily controlled externally (from 4 nm to 0.5 nm) using electric fields. © 2012 American Institute of Physics.
Resumo:
Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.
Resumo:
© 2015 IOP Publishing Ltd & London Mathematical Society.This is a detailed analysis of invariant measures for one-dimensional dynamical systems with random switching. In particular, we prove the smoothness of the invariant densities away from critical points and describe the asymptotics of the invariant densities at critical points.
Resumo:
© 2015 Society for Industrial and Applied Mathematics.We consider parabolic PDEs with randomly switching boundary conditions. In order to analyze these random PDEs, we consider more general stochastic hybrid systems and prove convergence to, and properties of, a stationary distribution. Applying these general results to the heat equation with randomly switching boundary conditions, we find explicit formulae for various statistics of the solution and obtain almost sure results about its regularity and structure. These results are of particular interest for biological applications as well as for their significant departure from behavior seen in PDEs forced by disparate Gaussian noise. Our general results also have applications to other types of stochastic hybrid systems, such as ODEs with randomly switching right-hand sides.
Resumo:
This note provides a new probabilistic approach in discussing the weighted Markov branching process (WMBP) which is a natural generalisation of the ordinary Markov branching process. Using this approach, some important characteristics regarding the hitting times of such processes can be easily obtained. In particular, the closed forms for the mean extinction time and conditional mean extinction time are presented. The explosion behaviour of the process is investigated and the mean explosion time is derived. The mean global holding time and the mean total survival time are also obtained. The close link between these newly developed processes and the well-known compound Poisson processes is investigated. It is revealed that any weighted Markov branching process (WMBP) is a random time change of a compound Poisson process.
Resumo:
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters, and photodetectors. Our model enables us to simulate a quantum random walk using of the wave nature of classical light fields. Furthermore, the proposed setup allows the analysis of the effects of decoherence. The transition from a pure mean-photon-number distribution to a classical one is studied varying the decoherence parameters.