Related papers: Cluster expansion methods in rigorous statistical …
It is usual to rely on the quasi-likelihood methods for deriving statistical methods applied to clustered multinomial data with no underlying distribution. Even though extensive literature can be encountered for these kind of data sets,…
We provide a pedagogical introduction to numerical linked-cluster expansions (NLCEs). We sketch the algorithm for generic Hamiltonians that only connect nearest-neighbor sites in a finite cluster with open boundary conditions. We then…
This is a first step guide to the theory of cluster algebras. We especially focus on basic notions, techniques, and results concerning seeds, cluster patterns, and cluster algebras.
During the past two decades, methods for identifying groups with different trends in longitudinal data have become of increasing interest across many areas of research. To support researchers, we summarize the guidance from the literature…
In modern science, computer models are often used to understand complex phenomena, and a thriving statistical community has grown around analyzing them. This review aims to bring a spotlight to the growing prevalence of stochastic computer…
This pedagogical review addresses several issues related to statistical description of gravitating systems in both static and expanding backgrounds, focusing on the latter. After briefly reviewing the results for the static background, I…
The article is the translation of authors paper, printed earlier in inaccessible edition and devoted to the formulation of basic concepts of dynamic description of particles' statistic ensemble in a gravitational field. Later on, the…
This is a preliminary draft of Chapter 7 of our forthcoming textbook "Introduction to Cluster Algebras." Chapters 1-3 have been posted as arXiv:1608.05735. Chapters 4-5 have been posted as arXiv:1707.07190. Chapter 6 has been posted as…
This is the compendium of the cluster algebra and quiver package for sage. The purpose of this package is to provide a platform to work with cluster algebras in graduate courses and to further develop the theory by working on examples, by…
The exponential family of random graphs is among the most widely-studied network models. We show that any exponential random graph model may alternatively be viewed as a lattice gas model with a finite Banach space norm. The system may then…
Many clustering algorithms when the data are curves or functions have been recently proposed. However, the presence of contamination in the sample of curves can influence the performance of most of them. In this work we propose a robust,…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
In this paper we develop a cluster-variant of the Stochastic Series expansion method (SCSE). For certain systems with longer-range interactions the SCSE is considerably more efficient than the standard implementation of the Stochastic…
In this tutorial-style review we discuss basic concepts of coupled cluster theory and recent developments that increase its computational efficiency for calculations of molecules, solids and materials in general. We will touch upon the…
We correct an error in a technical lemma of Drees and Rootz\'en (2010) [arXiv:0910.0343] and discuss consequences for applications.
Recent years have seen the development of two types of non-local extensions to the single-site dynamical mean field theory. On one hand, cluster approximations, such as the dynamical cluster approximation, recover short-range…
We review some recent progress on applications of Cluster Expansions. We focus on a system of classical particles living in a continuous medium and interacting via a stable and tempered pair potential. We review the cluster expansion in…
Mesoscopic systems in a slowly fluctuating environment are often well described by superstatistical models. We develop a generalized statistical mechanics formalism for superstatistical systems, by mapping the superstatistical complex…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
It is shown how the well-known large mass expansion can be simplified to obtain more terms of the expansion in an analytic form. Expanding two-loop four-point Feynman integrals which contribute to the process $H \to ggg$ is used as an…