Related papers: Weighted graphs and complex Gaussian free fields
We calculate correlation functions of the (signed) density of zeros of Gaussian distributed vector fields. We are able to express correlation functions of arbitrary order through the curvature tensor of a certain abstract Riemann-Cartan or…
Adapting Lindstr\"om's well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a…
This paper is devoted to the construction of stochastic flows of measurable mappings in a locally compact separable metric space (M, $\rho$). We propose a new construction that produces strong measurable continuous modifications for certain…
We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and…
We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…
The complex Gaussian distribution has been widely used as a fundamental spectral and noise model in signal processing and communication. However, its Gaussian structure often limits its ability to represent the diverse amplitude…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We study the joint distribution of SYK Hamiltonians for different systems with specified overlaps. We show that, in the large-system limit, their joint distribution converges in distribution to a mixed $q$-Gaussian system. We explain that…
A basic model of a dynamical distribution network is considered, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows…
The free energy of the Ginzburg-Landau theory satisfies a nonlinear functional differential equation which is turned into a recursion relation. The latter is solved graphically order by order in the loop expansion to find all connected…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
We present a general (i.e., independent of the underlying model) interpolation technique based on optimal transportation of Gaussian models for parametric advection-dominated problems. The approach relies on a scalar testing function to…
We show that the grading of fields by conformal weight, when built into the initial group symmetry, provides a discrete, non-central conformal extension of any group containing dilatations. We find a faithful vector representation of the…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
Outlined in this paper is a description of \emph{equivariance} in the world of 2-dimensional extended topological quantum field theories, under a topological action of compactLie groups. In physics language, I am gauging the theories ---…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
We initiate the study on chemical distances of percolation clusters for level sets of two-dimensional discrete Gaussian free fields as well as loop clusters generated by two-dimensional random walk loop soups. One of our results states that…
Even in low dimensions, sampling from multi-modal distributions is challenging. We provide the first sampling algorithm for a broad class of distributions -- including all Gaussian mixtures -- with a query complexity that is polynomial in…