Related papers: Efficient Computation of $N$-point Correlation Fun…
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…
Linear mixed models with large imbalanced crossed random effects structures pose severe computational problems for maximum likelihood estimation and for Bayesian analysis. The costs can grow as fast as $N^{3/2}$ when there are N…
We explore the new technique developed recently in \cite{Rosenhaus:2014woa} and suggest a correspondence between the $N$-point correlation functions on spacetime with conical defects and the $(N+1)$-point correlation functions in regular…
In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as…
The shapes of galaxy N-point correlation functions can be used as standard rulers to constrain the distance-redshift relationship and thence the expansion rate of the Universe. The cosmological density fields traced by late-time galaxy…
This paper explores the integration of Diophantine equations into neural network (NN) architectures to improve model interpretability, stability, and efficiency. By encoding and decoding neural network parameters as integer solutions to…
We consider near-critical two-dimensional statistical systems with boundary conditions inducing phase separation on the strip. By exploiting low-energy properties of two-dimensional field theories, we compute arbitrary $n$-point correlation…
We use the conformal bootstrap approach to explore $5D$ CFTs with $O(N)$ global symmetry, which contain $N$ scalars $\phi_i$ transforming as $O(N)$ vector. Specifically, we study multiple four-point correlators of the leading $O(N)$ vector…
The inverse source problem arising in photoacoustic tomography and in several other coupled-physics modalities is frequently solved by iterative algorithms. Such algorithms are based on the minimization of a certain cost functional. In…
This article provides a method for quick computation of galaxy two-point correlation function(2pCF) from redshift surveys using python. One of the salient features of this approach is that it can be used for calculating galaxy clustering…
We present an $8.1\sigma$ detection of the non-Gaussian 4-Point Correlation Function (4PCF) using a sample of $N_{\rm g} \approx 8\times 10^5$ galaxies from the BOSS CMASS dataset. Our measurement uses the $\mathcal{O}(N_{\rm g}^2)$ NPCF…
We compute higher-point superstring correlators involving spin fields in various even space-time dimensions D at tree-level and to arbitrary loop order. This generalizes previous work in D=4 space-time dimensions. The main focus are D=6,8…
Learning system dynamics directly from observations is a promising direction in machine learning due to its potential to significantly enhance our ability to understand physical systems. However, the dynamics of many real-world systems are…
Disordered systems are ubiquitous in physical, biological and material sciences. Examples include liquid and glassy states of condensed matter, colloids, granular materials, porous media, composites, alloys, packings of cells in avian…
In this paper, we study the implications of conformal invariance in momentum space for correlation functions in quantum mechanics. We find that three point functions of arbitrary operators can be written in terms of the $_2 F_1$…
We derive exact analytic results for several four-point correlation functions for statistical models exhibiting phase separation in two-dimensions. Our theoretical results are then specialized to the Ising model on the two-dimensional strip…
In the paper it is shown that there exist infinite classes of fast DFT algorithms having multiplicative complexity lower than O(NlogN), i.e. smaller than their arithmetical complexity. The derivation starts with nesting of Discrete Fourier…
We propose a novel efficient algorithm to solve Poisson equation in irregular two dimensional domains for electrostatics. It can handle Dirichlet, Neumann or mixed boundary problems in which the filling media can be homogeneous or…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…