Related papers: Loop Calculus and Belief Propagation for q-ary Alp…
We introduce a new concept of logarithmic topological recursion that provides a patch to topological recursion in the presence of logarithmic singularities and prove that this new definition satisfies the universal $x-y$ swap relation. This…
The estimation of the covariance matrix is an initial step in many multivariate statistical methods such as principal components analysis and factor analysis, but in many practical applications the dimensionality of the sample space is…
Decoding low-density parity-check codes is critical in many current technologies, such as fifth-generation (5G) wireless networks and satellite communications. The belief propagation algorithm allows for fast decoding due to the low density…
MAP is the problem of finding a most probable instantiation of a set of nvariables in a Bayesian network, given some evidence. MAP appears to be a significantly harder problem than the related problems of computing the probability of…
Due to the intractable nature of exact lifted inference, research has recently focused on the discovery of accurate and efficient approximate inference algorithms in Statistical Relational Models (SRMs), such as Lifted First-Order Belief…
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
The *algebrization barrier*, proposed by Aaronson and Wigderson (STOC '08, ToCT '09), captures the limitations of many complexity-theoretic techniques based on arithmetization. Notably, several circuit lower bounds that overcome the…
In this paper, we introduce the notion of augmentation for polytopes and use it to show the error in two presumptions that have been key in arriving at over-reaching/over-scoped claims of "impossibility" in recent extended formulations (EF)…
We consider a model for chaotic diffusion with amplification on graphs associated with piecewise-linear maps of the interval. We investigate the possibility of having power-law tails in the invariant measure by approximate solution of the…
Over the last decade or so, Approximate Message Passing (AMP) algorithms have become extremely popular in various structured high-dimensional statistical problems. The fact that the origins of these techniques can be traced back to notions…
In prior joint work with Lewis, we developed a theory of enriched set-valued $P$-partitions to construct a $K$-theoretic generalization of the Hopf algebra of peak quasisymmetric functions. Here, we situate this object in a diagram of six…
This work investigates in detail the performance and advantages of a new quantum Monte Carlo integrator, dubbed Quantum Fourier Iterative Amplitude Estimation (QFIAE), to numerically evaluate for the first time loop Feynman integrals in a…
In Non - ergodic belief networks the posterior belief OF many queries given evidence may become zero.The paper shows that WHEN belief propagation IS applied iteratively OVER arbitrary networks(the so called, iterative OR loopy belief…
A new method for the construction of classical integrable systems, that we call loop coproduct formulation, is presented. We show that the linear r-matrix formulation, the Sklyanin algebras and the reflection algebras can be obtained as…
An algorithm for calculating two-loop propagator type Feynman diagrams with arbitrary masses and external momentum is proposed. Recurrence relations allowing to express any scalar integral in terms of basic integrals are given. A minimal…
An efficient way to calculate one-loop counterterms within the Feynman diagrammatic approach and dimensional regularization is to expand the propagators in the integrands of the Feynman integrals around vanishing external momentum. In this…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
We generalize the study of standard Lyndon loop words from [A.Negut, A.Tsymbaliuk, "Quantum loop groups and shuffle algebras via Lyndon words", Adv. Math. 439 (2024), Paper No. 109482] to a more general class of orders on the underlying…
We use rational approximants to study missing higher orders in the massless scalar-current quark correlator. We predict the yet unknown six-loop coefficient of its imaginary part, related to $\Gamma(H\to b \bar b)$, to be $c_5=-6900\pm…