Related papers: A measure-theoretic approach to the theory of dens…
The magnitude homology, introduced by R. Hepworth and S. Willerton, offers a topological invariant that enables the study of graph properties. Hypergraphs, being a generalization of graphs, serve as popular mathematical models for data with…
We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…
In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…
In recent years hypergraphs have emerged as a powerful tool to study systems with multi-body interactions which cannot be trivially reduced to pairs. While highly structured methods to generate synthetic data have proved fundamental for the…
Graph pattern matching is a routine process for a wide variety of applications such as social network analysis. It is typically defined in terms of subgraph isomorphism which is NP-Complete. To lower its complexity, many extensions of graph…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
Counting the number of small patterns is a central task in network analysis. While this problem is well studied for graphs, many real-world datasets are naturally modeled as hypergraphs, motivating the need for efficient hypergraph motif…
In the present paper, we study a set that can be treated as a generalised set of subsums for a geometric series. This object was discovered independently in various mathematical aspects. For instance, it is closely related to various…
We provide a vast class of counterexamples to the chain rule for the divergence of bounded vector fields in three space dimensions. Our convex integration approach allows us to produce renormalization defects of various kinds, which in a…
In this paper, we revisit the notion of length measures associated to planar closed curves. These are a special case of area measures of hypersurfaces which were introduced early on in the field of convex geometry. The length measure of a…
We study a measure-theoretic notion of connectedness for sets of finite perimeter in the setting of doubling metric measure spaces supporting a weak $(1,1)$-Poincar\'{e} inequality. The two main results we obtain are a decomposition theorem…
For a given metric measure space $(X,d,\mu)$ we consider finite samples of points, calculate the matrix of distances between them and then reconstruct the points in some finite-dimensional space using the multidimensional scaling (MDS)…
In recent breakthrough results, Saxton--Thomason and Balogh--Morris--Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and…
The theme here is category-measure duality, in the context of a topological group. One can often handle the (Baire) category case and the (Lebesgue, or Haar) measure cases together, by working bi-topologically: switching between the…
Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…
We classify possible supersymmetry-preserving relevant, marginal, and irrelevant deformations of unitary superconformal theories in $d \geq 3$ dimensions. Our method only relies on symmetries and unitarity. Hence, the results are model…
We seek a practical method for establishing dense correspondences between two images with similar content, but possibly different 3D scenes. One of the challenges in designing such a system is the local scale differences of objects…
We study the problem of testing the existence of a heterogeneous dense subhypergraph. The null hypothesis corresponds to a heterogeneous Erd\"{o}s-R\'{e}nyi uniform random hypergraph and the alternative hypothesis corresponds to a…
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities. In this work, we propose a novel approach for the partitioning…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…