Related papers: Self-Correlation and Maximum Independence in Finit…
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…
The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum cardinality of a set of edges whose deletion results in a…
We study parity violation in the early universe by examining the four-point correlation function within the axion inflation model. Using an open quantum system formalism from our previous work, we calculate the influence functional to…
Detecting dependence between variables is a crucial issue in statistical science. In this paper, we propose a novel metric called label projection correlation to measure the dependence between numerical and categorical variables. The…
We present a derivation of a recently proposed theory for the time dependence of density fluctuations in stationary states of strongly interacting, athermal, self-propelled particles. The derivation consists of two steps. First, we start…
Networks where each node has one or more associated numerical values are common in applications. This work studies how summary statistics used for the analysis of spatial data can be applied to non-spatial networks for the purposes of…
In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function…
Given a database and a target attribute of interest, how can we tell whether there exists a functional, or approximately functional dependence of the target on any set of other attributes in the data? How can we reliably, without bias to…
An isolating set of a graph is a set of vertices $S$ such that, if $S$ and its neighborhood is removed, only isolated vertices remain; and the isolation number is the minimum size of such a set. It is known that for every connected graph…
We compute correlation functions of the primordial density perturbations when they couple to a gapless, strongly coupled sector of spectator fields -- ``unparticles" -- during inflation. We first derive a four-point function of conformally…
Let $G$ be a finite simple graph. An independent set $I$ of $G$ is critical if $\left|I\right|-\left|N(I)\right|\ge\left|J\right|-\left|N(J)\right|$ for every independent set $J$ of $G$. A critical independent set is maximum if it has…
Building on prior work on distributed databases and the CALM Theorem, we define and study the question of free termination: in the absence of distributed coordination, what query properties allow nodes in a distributed (database) system to…
A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$ coincides with each linked family $\mathcal…
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…
Let $\mathcal{L}$ be a centric linking system associated to a saturated fusion system on a finite $p$-group $S$. An automorphism of $\mathcal{L}$ is said to be rigid if it restricts to the identity on the fusion system. An inner rigid…
In fully developed turbulence, the velocity field possesses long-range correlations, denoted by a scaling power spectrum or structure functions. Here we consider the autocorrelation function of velocity increment $ {\Delta u_{\ell}(t)}$ at…
We consider inapproximability of the correlation clustering problem defined as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+" (similar) or "-" (dissimilar), correlation clustering seeks to partition the vertices…
An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free…