相关论文: Scaling Relations for Logarithmic Corrections
We study the logarithmic correction to the scaling of the first Lee-Yang (LY) zero in the classical $XY$ model on square lattices by using tensor renormalization group methods. In comparing the higher-order tensor renormalization group…
Some recent approaches for scalable offline partial evaluation of logic programs include a size-change analysis for ensuring both so called local and global termination. In this work|inspired by experimental evaluation|we introduce several…
We describe an approach to logarithmic conformal field theories as limits of sequences of ordinary conformal field theories with varying central charge c. Logarithmic behaviour arises from degeneracies in the spectrum of scaling dimensions…
A detailed investigation of the scaling properties of the fully finite ${\cal O}(n)$ systems with long-range interaction, decaying algebraically with the interparticle distance $r$ like $r^{-d-\sigma}$, below their upper critical dimension…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
Scaling and hyperscaling laws provide exact relations among critical exponents describing the behavior of a system at criticality. For nonequilibrium growth models with a conserved drift there exist few of them. One such relation is $\alpha…
Log-symmetric regression models are particularly useful when the response variable is continuous, strictly positive and asymmetric. In this paper, we proposed a class of log-symmetric regression models in the context of correlated errors.…
These lecture notes provide a unified overview of most known canonical desingularization methods in characteristic zero. It starts with discussing the classical method, and then proceeds with the recently discovered ones: logarithmic…
In the present paper we propose a new approach to investigate the logistic function, commonly used in mathematical models in economics and management. The approach is based on indicating in a given time series, having a logistic trend, some…
General log-linear models specified by non-negative integer design matrices have a potentially wide range of applications, although using models without the genuine overall effect, that is, ones which cannot be reparameterized to include a…
Monte Carlo and series expansion data for the energy, specific heat, magnetisation and susceptibility of the 4-state Potts model in the vicinity of the critical point are analysed. The role of logarithmic corrections is discussed. Estimates…
We introduce a dynamic approach to probabilistic forecast reconciliation at scale. Our model differs from the existing literature in this area in several important ways. Firstly we explicitly allow the weights allocated to the base…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
Long traces and large event logs that originate from sensors and prediction models are becoming more common in our data-rich world. In such circumstances, conformance checking, a key task in process mining, can become computationally…
We investigate the corrections to scaling of the Renyi entropies of a region of size l at the end of a semi-infinite one-dimensional system described by a conformal field theory when the corrections come from irrelevant boundary operators.…
We investigate the critical properties of the Lee-Yang model in less than six spacetime dimensions using truncations of the functional renormalization group flow. We give estimates for the critical exponents, study the dependence on the…
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
Low-rank approximation with zeros aims to find a matrix of fixed rank and with a fixed zero pattern that minimizes the Euclidean distance to a given data matrix. We study the critical points of this optimization problem using algebraic…
Logarithmic Number Systems (LNS) hold considerable promise in helping reduce the number of bits needed to represent a high dynamic range of real-numbers with finite precision, and also efficiently support multiplication and division.…
Logarithmic number systems (LNS) are used to represent real numbers in many applications using a constant base raised to a fixed-point exponent making its distribution exponential. This greatly simplifies hardware multiply, divide and…