Related papers: Self-Correlation and Maximum Independence in Finit…
We propose the finite-size scaling of correlation function in a finite system near its critical point. At a distance ${\bf r}$ in the finite system with size $L$, the correlation function can be written as the product of $|{\bf…
Scattering amplitudes at weak coupling are highly constrained by Lorentz invariance, locality and unitarity, and depend on model details only through coupling constants and particle content. In this paper, we develop an understanding of…
This work addresses testing the independence of two continuous and finite-dimensional random variables from the design of a data-driven partition. The empirical log-likelihood statistic is adopted to approximate the sufficient statistics of…
An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex…
The maximal (or Hilbertian) correlation coefficient between two random variables X and Y, denoted by \{X:Y\}, is the supremum of the |Corr(f(X),g(Y))| for real measurable functions f, g, where "Corr" denotes Pearson's correlation…
In this paper we study relationships between the \emph{matching number}, written $\mu(G)$, and the \emph{independence number}, written $\alpha(G)$. Our first main result is to show \[ \alpha(G) \le \mu(G) + |X| - \mu(G[N_G[X]]), \] where…
A new seemingly weak axiomatic formulation of information algebras is given. It is shown how such information algebras can be embedded into set (information) algebras. In set algebras there is a natural relation of conditional independence…
We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others,…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A set $I_0(G) \subseteq V(G)$ is a vertex independent set if no two vertices in $I_0(G)$ are adjacent in $G$. We study $\alpha_1(G)$, which is the maximum cardinality of a set…
We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…
We derive novel identities satisfied by inflationary correlation functions in the limit where two external momenta are taken to be small. We derive these statements in two ways: using background-wave arguments and as Ward identities…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In network applications, maximal independent sets can be used…
We consider a decision network on an undirected graph in which each node corresponds to a decision variable, and each node and edge of the graph is associated with a reward function whose value depends only on the variables of the…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
We derive exact and closed-form expressions for a large class of two-point and three-point inflation correlators with the tree-level exchange of a single massive particle. The intermediate massive particle is allowed to have arbitrary mass,…
We consider a self-interacting scalar field in a de Sitter background and deal with the associated infrared divergences in a purely diagrammatic way using the in-in formalism. In the particular case of a large N O(N) invariant scalar field…
We extend the theory of d-separation to cases in which data instances are not independent and identically distributed. We show that applying the rules of d-separation directly to the structure of probabilistic models of relational data…
The question of determining a signal from its higher-order autocorrelation data is of practical interest in fields as varied as X-ray crystallography, image processing, and satellite communications. At the heart of the issue is how much of…
A partition of a positive integer $n$ is defined as a non-increasing sequence $P = [y_0, y_1, ..., y_m]$ of positive integers which sum to $n$, where the $y_i$ are called the $parts$ of the partition. A Young diagram is a visual…