Related papers: Properties of Quick Simulation Random Fields
Diffusions are a fundamental class of models in many fields, including finance, engineering, and biology. Simulating diffusions is challenging as their sample paths are infinite-dimensional and their transition functions are typically…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
In this paper, we show that the methods of mathematical statistical physics can be successfully applied to random fields in finite volumes. As a result, we obtain simple necessary and sufficient conditions for the existence and uniqueness…
The use of sparse precision (inverse covariance) matrices has become popular because they allow for efficient algorithms for joint inference in high-dimensional models. Many applications require the computation of certain elements of the…
We construct random dynamics on collections of non-intersecting planar contours, leaving invariant the distributions of length- and area-interacting polygonal Markov fields with V-shaped nodes. The first of these dynamics is based on the…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
Random features (RFs) are a popular technique to scale up kernel methods in machine learning, replacing exact kernel evaluations with stochastic Monte Carlo estimates. They underpin models as diverse as efficient transformers (by…
The efficient simulation of isotropic Gaussian random fields on the unit sphere is a task encountered frequently in numerical applications. A fast algorithm based on Markov properties and fast Fourier Transforms in 1d is presented that…
We use the $H$-matrix technology to compute the approximate square root of a covariance matrix in linear cost. This allows us to generate normal and log-normal random fields on general point sets with optimal cost. We derive rigorous error…
So far, the pseudo cross-variogram is primarily used as a tool for the structural analysis of multivariate random fields. Mainly applying recent theoretical results on the pseudo cross-variogram, we use it as a cornerstone in the…
Rue and Held (2005) proposed a method for efficiently computing the Gaussian likelihood for stationary Markov random field models, when the data locations fall on a complete regular grid, and the model has no additive error term. The…
Rare events are ubiquitous in many different fields, yet they are notoriously difficult to simulate because few, if any, events are observed in a conventiona l simulation run. Over the past several decades, specialised simulation methods…
We derive a Poisson random field model for population site polymorphisms differences within and between two species that share a relatively recent common ancestor. The model can be either equilibrium or time inhomogeneous. We first consider…
Markov networks are popular models for discrete multivariate systems where the dependence structure of the variables is specified by an undirected graph. To allow for more expressive dependence structures, several generalizations of Markov…
Particle Markov Chain Monte Carlo (PMCMC) is a general computational approach to Bayesian inference for general state space models. Our article scales up PMCMC in terms of the number of observations and parameters by generating the…
Piecewise Deterministic Monte Carlo algorithms enable simulation from a posterior distribution, whilst only needing to access a sub-sample of data at each iteration. We show how they can be implemented in settings where the parameters live…
We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for…
Copulas are essential tools in statistics and probability theory, enabling the study of the dependence structure between random variables independently of their marginal distributions. Among the various types of copulas, Ratio-Type Copulas…
We introduce a class of spatial stochastic processes in the max-domain of attraction of familiar max-stable processes. The new class is based on Cox processes and comprises models with short range dependence. We show that statistical…
The paper introduces a new class of random fields, supCAR fields, which are constructed as superpositions of continuous autoregressive random fields. These supCAR fields possess infinitely divisible marginal distributions. Their…