Related papers: Directed Hypercube Routing, a Generalized Lehman-R…
Although overparameterized models have achieved remarkable practical success, their theoretical properties, particularly their generalization behavior, remain incompletely understood. The well known double descents phenomenon suggests that…
Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This work addresses a critical gap in this context by proposing…
We contribute to an original problem studied by Hamilton and others, in order to understand the behaviour of maximal solutions of the Ricci flow both in compact and non-compact complete orientable Riemannian manifolds of finite volume. The…
This paper gives a concise proof of the Jordan curve theorem on discrete surfaces. We also embed the discrete surface in the 2D plane to prove the original version of the Jordan curve theorem. This paper is a simple version of L. Chen, Note…
We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and…
The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…
By Gromov's compactness theorem for metric spaces, every uniformly compact sequence of metric spaces admits an isometric embedding into a common compact metric space in which a subsequence converges with respect to the Hausdorff distance.…
Motivated by Talagrand's conjecture on regularization properties of the natural semigroup on the Boolean hypercube, and in particular its continuous analogue involving regularization properties of the Ornstein-Uhlenbeck semigroup acting on…
We prove the sharp quantitative stability for a wide class of weighted isoperimetric inequalities. More precisely, we consider isoperimetric inequalities in convex cones with homogeneous weights. Inspired by the proof of such isoperimetric…
We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…
Nonnegative measures that are solutions to a transport equation with continuous coefficients have been widely studied. Because of the low regularity of the associated vector field, there is no natural flow since nonuniqueness of integral…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
Given a measurable set $A\subset \mathbb R^d$ we consider the "large-distance graph" $\mathcal{G}_A$, on the ground set $A$, in which each pair of points from $A$ whose distance is bigger than 2 forms an edge. We consider the problems of…
A conjecture by Lichiardopol states that for every $k \ge 1$ there exists an integer $g(k)$ such that every digraph of minimum out-degree at least $g(k)$ contains $k$ vertex-disjoint directed cycles of pairwise distinct lengths. Motivated…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
This paper develops the metric theory of simultaneous inhomogeneous Diophantine approximation on a planar curve with respect to multiple approximating functions. Our results naturally generalize the homogeneous Lebesgue measure and Hausdor?…
The theory of log concave polynomials has recently been developed to study objects and problems in combinatorics and other subfields in mathematics. Particular classes of log concave polynomials called Lorentzian polynomials and…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We generalize the extension and trace results of Bj\"orn-Bj\"orn-Shanmugalingam \cite{BBS21} to the setting of complete noncompact doubling metric measure spaces and their uniformized hyperbolic fillings. This is done through a…