Related papers: Diagrammatic approach in the variational coupled-c…
Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…
We study the probability distribution function of the long-time values of observables being time-evolved by Hamiltonians modeling clean and disordered one-dimensional chains of many spin-1/2 particles. In particular, we analyze the return…
We suggest novel statistics for the CMB maps that are sensitive to non-Gaussian features. These statistics are natural generalizations of the geometrical and topological methods that have been already used in cosmology such as the…
The theory of Wilson loops for gauge theories with unitary gauge groups is formulated in the language of symmetric functions. The main objects in this theory are two generating functions, which are related to each other by the involution…
The world-line representation of quantum field theory is a powerful framework for the computation of perturbative multi-leg Feynman amplitudes. In particular, in gauge theories, it provides an efficient way, via point particle Grassmann…
We demonstrate how correlation functions for non-diagonal operators can be measured with the loop-cluster algorithm for quantum spin models. We introduce the U(1) quantum link model and present the construction of a cluster algorithm for…
Observed clusters should be modelled by considering the distribution function to be a random variable that quantifies the degree of excitation of the system's normal modes. A system of canonical coordinates for the space of DFs is…
Shape dependence of higher order correlations introduces complication in direct determination of these quantities. For this reason theoretical and observational progress has been restricted in calculating one point distribution functions…
Parameter estimation for non-stationary stochastic differential equations (SDE) with an arbitrary nonlinear drift, and nonlinear diffusion is accomplished in combination with a non-parametric clustering methodology. Such a model-based…
We present the description of the exponentiated diagrams in terms of generating function within the universal diagrammatic technique. In particular, we show the exponentiation of the gauge theory amplitudes involving products of an…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
Much work has been done in the area of the cluster weighted model (CWM), which extends the finite mixture of regression model to include modelling of the covariates. Although many types of distributions have been considered for both the…
We present a general-order spin-free formulation of the single-reference closed-shell coupled-cluster method. We show that the working equations of a fully biorthogonal contravariant projection formulation of the residual equations, as…
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits…
A formalism based on the fermionic functional-renormalization-group approach to interacting electron models defined on a lattice is presented. One-loop flow equations for the coupling constants and susceptibilities in the particle-particle…
Cumulant mapping employs a statistical reconstruction of the whole by sampling its parts. The theory developed in this work formalises and extends ad hoc methods of `multi-fold' or `multi-dimensional' covariance mapping. Explicit formulae…
Persistence modules and barcodes are used in symplectic topology to define various invariants of Hamiltonian diffeomorphisms, however numerical methods for computing these barcodes are not yet well developed. In this paper we define one…
A novel formulation of the clustering problem is introduced in which the task is expressed as an estimation problem, where the object to be estimated is a function which maps a point to its distribution of cluster membership. Unlike…
The clustering method based on graph models has garnered increased attention for its widespread applicability across various knowledge domains. Its adaptability to integrate seamlessly with other relevant applications endows the graph…
Some of the most arduous and error-prone aspects of precision resummed calculations are related to the partonic hard process, having nothing to do with the resummation. In particular, interfacing to parton-distribution functions, combining…