Related papers: Weighted graphs and complex Gaussian free fields
In the mixture modeling frame, this paper presents the polynomial Gaussian cluster-weighted model (CWM). It extends the linear Gaussian CWM, for bivariate data, in a twofold way. Firstly, it allows for possible nonlinear dependencies in the…
The non-commutative version of the euclidean $g^2\phi^4$ theory is considered. By using Wilsonian flow equations the ultraviolet renormalizability can be proved to all orders in perturbation theory. On the other hand, the infrared sector…
We study the complex free field associated with a symmetric Markov chain. Applications are given to loop ensembles, second Ray Knight theorem and random Eulerian circuits.
Algorithms based on normalizing flows are emerging as promising machine learning approaches to sampling complicated probability distributions in a way that can be made asymptotically exact. In the context of lattice field theory,…
We determine the master integrals for vertex and propagator diagrams that appear in effective field theories containing heavy fields. The integrals involve at least one heavy line, and the standard lines include an arbitrary mass scale. The…
This note provides a detailed proof of the fact that a linear vector field on a vector bundle has a flow by vector bundle isomorphisms. It implies then easily the existence of global solutions to linear non-autonomous ODE's, with a standard…
Directed acyclic graphical models (DAGs) are often used to describe common structural properties in a family of probability distributions. This paper addresses the question of classifying DAGs up to an isomorphism. By considering Gaussian…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
We develop a method to calculate the persistent currents and their spatial distribution (and transport properties) on graphs made of quasi-1D diffusive wires. They are directly related to the field derivatives of the determinant of a matrix…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
In science and engineering, we often work with models designed for accurate prediction of variables of interest. Recognizing that these models are approximations of reality, it becomes desirable to apply multiple models to the same data and…
In this work, we introduce a combinatorial-geometric model for the space of discrete Morse functions on any CW complex $X$. We relate this version of a space of discrete Morse functions to the space of cellular filtrations of $X$ and…
Directed acyclic graphs provide a fundamental tool for representing directed dependence structures in multivariate network data, and are widely used to model financial and economic networks. However, accurate and interpretable estimation…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
In this paper we consider external current QED in the Coulomb gauge and in axial gauges for various spatial directions of the axis. For a non-zero electric charge of the current, we demonstrate that any two different gauges from this class…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
We study on the metric graphs two types of scalar Gaussian free fields (GFF), the usual one and the one twisted by a $\{-1,1\}$-valued gauge field. We show that the latter can be obtained, up to an additional deterministic transformation,…
Gaussian process (GP) models have received increasing attention in recent years due to their superb prediction accuracy and modeling flexibility. To address the computational burdens of GP models for large-scale datasets, distributed…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…