相关论文: Delta-system method: a survey
Frankl--Pach and Erd\H{o}s conjectured that any $(d+1)$-uniform set family $\mathcal{F}\subseteq \binom{[n]}{d+1}$ with VC-dimension at most $d$ has size at most $\binom{n-1}{d}$ when $n$ is sufficiently large. Ahlswede and Khachatrian…
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…
We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…
A well-known theorem of Mantel states that every $n$-vertex graph with more than $\lfloor n^2/4\rfloor $ edges contains a triangle. An interesting problem in extremal graph theory studies the minimum number of edges contained in triangles…
Higher-order network analysis uses the ideas of hypergraphs, simplicial complexes, multilinear and tensor algebra, and more, to study complex systems. These are by now well established mathematical abstractions. What's new is that the ideas…
Panel data arise in a wide range of application areas, and developing modelling methods for extreme values under such a setup is essential for reliable risk assessment and management. When choosing to model the marginal distributions of…
A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Dense subgraph discovery methods are routinely used in a variety of applications including the identification of a team of skilled individuals for collaboration from a social network. However, when the network's node set is associated with…
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain intersection constraints are equivalent to that with the union…
The Waldmeier Effect is the observation that the rise time of a sunspot cycle varies inversely with the cycle amplitude: strong cycles rise to their maximum faster than weak cycles. The shape of the cycle and thus the rise time does not…
Extreme shock models have been introduced in Gut and H\"usler (1999) to study systems that at random times are subject to shock of random magnitude. These systems break down when some shock overcomes a given resistance level. In this paper…
For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…
Reachability analysis is at the core of many applications, from neural network verification, to safe trajectory planning of uncertain systems. However, this problem is notoriously challenging, and current approaches tend to be either too…
The Lotka-Volterra system is a set of ordinary differential equations describing growth of interacting ecological species. This model has gained renewed interest in the context of random interaction networks. One of the debated questions is…
Because of the lack of reliable sunspot observation, the quality of sunspot number series is poor in the late 18th century, leading to the abnormally long solar cycle (1784--1799) before the Dalton minimum. Using the newly recovered solar…
The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…
Given a family $\mathcal{F}=\{A_1,\dots,A_s\}$ of subsets of $\mathbb{Z}_n$, define $\Delta \mathcal{F}$ to be the multiset of all (cyclic) distances dist$(x,y)$, where $\{x,y\} \subset A_i$, $x \neq y$, for some $i=1,\dots,s$. Taking…
An $n$-vertex graph is called $C$-Ramsey if it has no clique or independent set of size $C\log_2 n$ (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-statistics in Ramsey graphs, in particular obtaining very…
We develop an analytical synthesis that bridges data-driven Distributionally Robust Optimization (DRO) and Economic Decision Theory under Ambiguity (DTA). By reinterpreting standard regularization and DRO techniques as data-driven…