Related papers: Definable regularity lemmas for NIP hypergraphs
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…
Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…
A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a "certificate" to the…
We investigate the mean-field dynamics of stochastic McKean differential equations with heterogeneous particle interactions described by large network structures. To express a wide range of graphs, from dense to sparse structures, we…
In this paper we continue the investigation of the regularity of the so-called weak $\frac{n}{p}$-harmonic maps in the critical case. These are critical points of the following nonlocal energy \[ {\mathcal{L}}_s(u)=\int_{\mathbb{R}^n}| (…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
We consider a general class of spin systems with potentially unbounded real-valued spins, defined via a single-site potential with super-Gaussian tails on general graphs, allowing for both short- and long-range interactions. This class…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W.~Kantor's non-classical $\mathrm{GQ}(5^2,5)$, are stumbling stones for existing…
Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of…
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow; both cooperative and noncooperative…
This paper establishes a general topological condition under which the semilocal stability of a set-valued mapping can be exactly determined by its local stability properties. Specifically, we investigate the relationship between the…
In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian with homogeneous Neumann boundary conditions. First, we derive a bound on the distance between two continuous-in-time trajectories…
The main goal in distributed symmetry-breaking is to understand the locality of problems; i.e., the radius of the neighborhood that a node needs to explore in order to arrive at its part of a global solution. In this work, we study the…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
A trichotomy theorem for countable, stable, unsuperstable theories is offered. We develop the notion of a `regular ideal' of formulas and study types that are minimal with respect to such an ideal.
We study the NP-hard Stable Hypergraph Matching (SHM) problem and its generalization allowing capacities, the Stable Hypergraph $b$-Matching (SH$b$M) problem, and investigate their computational properties under various structural…
The Hilbert functions and the regularity of the graded components of local cohomology of a bigraded algebra are considered. Explicit bounds for these invariants are obtained for bigraded hypersurface rings.
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…