Related papers: Tree expansion in time-dependent perturbation theo…

We prove an adiabatic theorem for the evolution of spectral data under a weak additive perturbation in the context of a system without an intrinsic time scale. For continuous functions of the unperturbed Hamiltonian the convergence is in…

Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…

Bayesian regression trees are flexible non-parametric models that are well suited to many modern statistical regression problems. Many such tree models have been proposed, from the simple single- tree model to more complex tree ensembles.…

We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…

Higher order conformal perturbation theory is studied for theories with and without boundaries. We identify systematically the universal quantities in the beta function equations, and we give explicit formulae for the universal coefficients…

There has been significant progress in our understanding of finite-temperature field theory over the past decade. In this paper, we review the progress in perturbative thermal field theory focusing on thermodynamic quantities. We first…

An efficient algorithm for time propagation of the time-dependent Kohn-Sham equations is presented. The algorithm is based on dividing the Hamiltonian into small time steps and assuming that it is constant over these steps. This allows for…

We demonstrate how one can construct renormalizable perturbative expansion in formally nonrenormalizable higher dimensional scalar theories. It is based on 1/N-expansion and results in a logarithmically divergent perturbation theory in…

Tree-shaped graphical models are widely used for their tractability. However, they unfortunately lack expressive power as they require committing to a particular sparse dependency structure. We propose a novel class of generative models…

Tree ensembles are very popular machine learning models, known for their effectiveness in supervised classification and regression tasks. Their performance derives from aggregating predictions of multiple decision trees, which are renowned…

Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval data, which arises in a variety of telecommunication…

In the last years, algebraic tools have been proven useful in phylogenetic reconstruction and model selection through the study of phylogenetic invariants. However, up to now, the models studied from an algebraic viewpoint are either too…

In this paper we introduce a generalization to the algebraic Bender-Wu recursion relation for the eigenvalues and the eigenfunctions of the anharmonic oscillator. We extend this well known formalism to the time-dependent quantum statistical…

Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…

This paper introduces the Partition Tree Weighting technique, an efficient meta-algorithm for piecewise stationary sources. The technique works by performing Bayesian model averaging over a large class of possible partitions of the data…

A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…

This paper presents a new approach for trees-based regression, such as simple regression tree, random forest and gradient boosting, in settings involving correlated data. We show the problems that arise when implementing standard…

This paper studies coordination problem for time-varying networks suffering from antagonistic information, quantified by scaling parameters. By such a manner, interacting property of the participating individuals and antagonistic…