相关论文: Almost-Sharp Quantitative Duffin-Schaeffer without…

Quantitative multivariate central limit theorems for general functionals of possibly non-symmetric and non-homogeneous infinite Rademacher sequences are proved by combining discrete Malliavin calculus with the smart path method for normal…

We investigate the \emph{minimum weight cycle (MWC)} problem in the $\mathsf{CONGEST}$ model of distributed computing. For undirected weighted graphs, we design a randomized algorithm that achieves a $(k+1)$-approximation, for any…

Originally arising in the context of interacting particle systems in statistical physics, dynamical systems and differential equations on networks/graphs have permeated into a broad number of mathematical areas as well as into many…

A sharp asymptotic formula for the number of strongly connected digraphs on $n$ labelled vertices with $m$ arcs, under a condition $m-n\to\infty$, $m=O(n)$, is obtained; this solves a problem posed by Wright back in $1977$. Our formula is a…

We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

The goal of this paper is to generalize the main results of [KM] and subsequent papers on metric Diophantine approximation with dependent quantities to the set-up of systems of linear forms. In particular, we establish `joint strong…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k< n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph is minimal if for every edge, the deletion of…

We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the…

In this article, we study the geometry of compact quasi-Einstein manifolds with boundary. We establish sharp boundary estimates for compact quasi-Einstein manifolds with boundary that improve some previous results. Moreover, we obtain a…

We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…

In this note, we present an improvement to a recent result due to Beresnevich, Levesley, and Ward (2021) pertaining to weighted simultaneous Diophantine approximation on manifolds.

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…

We consider the \emph{$k$-edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs $\{c_e\}_{e\in E}$, and we seek a minimum-cost \emph{$k$-edge connected} subgraph…

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

n this paper we refine Vahlen's 1895 result in Diophantine approximation by providing sharper bounds for the approximation coefficients, especially when at least one of the partial quotients $a_n$ or $a_{n+1}$ of the regular continued…

In this paper we introduce a notion of spectral approximation for directed graphs. While there are many potential ways one might define approximation for directed graphs, most of them are too strong to allow sparse approximations in…

Hypothesis testing is a fundamental issue in statistical inference and has been a crucial element in the development of information sciences. The Chernoff bound gives the minimal Bayesian error probability when discriminating two hypotheses…