Related papers: Multi-colour random fields with polygonal realisat…
Vector fields and line fields, their counterparts without orientations on tangent lines, are familiar objects in the theory of dynamical systems. Among the techniques used in their study, the Morse--Smale decomposition of a (generic) field…
We study a colored generalization of the famous simple-switch Markov chain for sampling the set of graphs with a fixed degree sequence. Here we consider the space of graphs with colored vertices, in which we fix the degree sequence and…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…
Smooth irreducible representations of tori over local fields have been parameterized by Langlands, using class field theory and Galois cohomology. This paper extends this parameterization to central extensions of such tori, which arise…
We provide theoretical procedures and practical recipes to simulate non-Gaussian correlated, homogeneous random fields with prescribed marginal distributions and cross-correlation structure, either in a N-dimensional Cartesian space or on…
Algorithms based on normalizing flows are emerging as promising machine learning approaches to sampling complicated probability distributions in a way that can be made asymptotically exact. In the context of lattice field theory,…
We analyse the performance of simple distributed colouring algorithms under the assumption that the input graph is a hyperbolic random graph (HRG), a generative model capturing key properties of real-world networks such as power-law degree…
In this paper, we study Markovian random iterations of maps on standard measurable spaces. We establish a one-to-one correspondence between stationary measures and a certain class of invariant measures of a Markovian random iteration,…
We introduce a method based on Gaussian process regression to identify discrete variational principles from observed solutions of a field theory. The method is based on the data-based identification of a discrete Lagrangian density. It is a…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
We study "circular net" (discrete orthogonal net) equations for angular data generalized by external spectral parameters. A criterion defining physical regimes of these Hamiltonian equations is the reality of Lagrangian density. There are…
This paper constructs a solvability theory for a system of stochastic partial differential equations. On account of the Kolmogorov continuity theorem, solutions are looked for in certain H\"older-type classes in which a random field is…
Anthropic solutions to the cosmological constant problem require seemingly unnatural scalar field potentials with a very small slope or domain walls (branes) with a very small coupling to a four-form field. Here we introduce a class of…
This paper describes the generation of initial conditions for numerical simulations in cosmology with multiple levels of resolution, or multiscale simulations. We present the theory of adaptive mesh refinement of Gaussian random fields…
Random fields are useful mathematical tools for representing natural phenomena with complex dependence structures in space and/or time. In particular, the Gaussian random field is commonly used due to its attractive properties and…
Structure formation in our Universe creates non-Gaussian random fields that will soon be observed over almost the entire sky by the Euclid satellite, the Vera-Rubin observatory, and the Square Kilometre Array. An unsolved problem is how to…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
Selecting between different dependency structures of hidden Markov random field can be very challenging, due to the intractable normalizing constant in the likelihood. We answer this question with approximate Bayesian computation (ABC)…
Gibbs random fields corresponding to systems of real-valued spins (e.g. systems of interacting anharmonic oscillators) indexed by the vertices of unbounded degree graphs with a certain summability property are constructed. It is proven that…
We study, theoretically and experimentally, a 1-parameter family of transformations and their limiting vector field on the space of plane polygons. These transformations are discrete analogs of completely integrable transformation on closed…