English
Related papers

Related papers: Self-Correlation and Maximum Independence in Finit…

200 papers

We consider a generalization of the Schur process in which a partition evolves from the empty partition into an arbitrary fixed final partition. We obtain a double integral representation of the correlation kernel. For a special final…

Mathematical Physics · Physics 2008-05-22 T. Imamura , T. Sasamoto

For years, independence has been considered as an important concept in many disciplines. Nevertheless, we present the first research that investigates the discovery problem of independence in data. In its arguably simplest form,…

Databases · Computer Science 2021-01-08 Miika Hannula , Bor-Kuan Song , Sebastian Link

We characterize the connected graphs of given order $n$ and given independence number $\alpha$ that maximize the number of maximum independent sets. For $3\leq \alpha\leq n/2$, there is a unique such graph that arises from the disjoint…

Combinatorics · Mathematics 2018-06-29 E. Mohr , D. Rautenbach

We determine a set of necessary conditions on a partition-indexed family of complex numbers to be the "highest coefficients" of a positive and symmetric multi-faced universal product; i.e. the product associated with a multi-faced version…

Functional Analysis · Mathematics 2024-06-17 Malte Gerhold , Philipp Varšo

This article is a brief review of "nonfreeness" and related measures of "correlation" for many-fermion systems. The many-fermion states we deem "uncorrelated" are the gauge-invariant quasi-free states. Uncorrelated states of systems of…

Quantum Physics · Physics 2017-03-14 Alex D. Gottlieb , Norbert J. Mauser

The maximization for the independence systems defined on graphs is a generalization of combinatorial optimization problems such as the maximum $b$-matching, the unweighted MAX-SAT, the matchoid, and the maximum timed matching problems. In…

Data Structures and Algorithms · Computer Science 2022-08-23 Yuki Amano

We derive a simple analytical expression for the level correlation function of an integrable system. It accounts for both the lack of correlations at smaller energy scales and for global rigidity (level number conservation) at larger…

Mesoscale and Nanoscale Physics · Physics 2009-11-07 R. A. Serota , J. M. A. S. P. Wickramasinghe

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…

Combinatorics · Mathematics 2013-01-09 Saeid Alikhani , Saeed Mirvakili

In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Victor Korotkikh , Galina Korotkikh

We take a different look at the problem of testing the independence of two metric-space-valued random variables using the distance correlation. Instead of testing if the distance correlation vanishes exactly, we are interested in the…

Statistics Theory · Mathematics 2025-11-19 Holger Dette , Marius Kroll

Recent research in statistics has focused on dependence measures kappa(Y,X) taking values in [0, 1], where 0 characterizes independence of X and Y, and 1 perfect functional dependence of Y on X. One class of such measures consists of the…

Statistics Theory · Mathematics 2026-04-14 Jonathan Ansari

Let $\mathbf{X}(n) \in \mathbb{R}^d$ be a sequence of random vectors, where $n\in\mathbb{N}$ and $d = d(n)$. Under certain weakly dependence conditions, we prove that the distribution of the maximal component of $\mathbf{X}$ and the…

Probability · Mathematics 2025-04-22 Mikhail Isaev , Igor Rodionov , Rui-Ray Zhang , Maksim Zhukovskii

Given a finite poset $P$, we associate a simple graph denoted by $G_P$ with all connected order ideals of $P$ as vertices, and two vertices are adjacent if and only if they have nonempty intersection and are incomparable with respect to set…

Combinatorics · Mathematics 2018-02-27 Ben P. Zhou

For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…

Logic · Mathematics 2026-05-28 Vera Koponen

Moving beyond simple associations, researchers need tools to quantify how variables influence each other in space and time. Correlation functions provide a mathematical framework for characterizing these essential dependencies, revealing…

Statistical Mechanics · Physics 2025-10-15 Henrique A. de Lima , Ismael S. S. Carrasco , Marcio Santos , Fernando A. Oliveira

Spatial autocorrelation coefficients such as Moran's index proved to be an eigenvalue of the spatial correlation matrixes. An eigenvalue represents a kind of characteristic length for quantitative analysis. However, if a spatial correlation…

Physics and Society · Physics 2021-02-04 Yanguang Chen

Earlier papers \cite{VB2022,VB2023a,VB2023b} introduced the notions of a core and an index of a relation (an index being a special case of a core). A limited form of the axiom of choice was postulated -- specifically that all partial…

Logic in Computer Science · Computer Science 2024-07-02 Ed Voermans , Jules Desharnais , Roland Backhouse

In a recent paper the last author proved that absence of complex zeros of the partition function of the hard-core model near a parameter $\lambda>0$ implies a form of correlation decay called strong spacial mixing. In this paper we…

Probability · Mathematics 2026-03-19 Han Peters , Josias Reppekus , Guus Regts

We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…

High Energy Physics - Theory · Physics 2025-09-17 Veronika E. Hubeny , Massimiliano Rota

A set S is independent if no two vertices from S are adjacent. In this paper we prove that if F is a collection of maximum independent sets of a graph, then there is a matching from S-{intersection of all members of F} into {union of all…

Discrete Mathematics · Computer Science 2011-08-26 Vadim E. Levit , Eugen Mandrescu