Related papers: Effective bounds for monochromatic connectivity me…

For an edge-colored graph $G$, we call an edge-cut $M$ of $G$ monochromatic if the edges of $M$ are colored with the same color. The graph $G$ is called monochromatic disconnected if any two distinct vertices of $G$ are separated by a…

We give a sharp Hausdorff content estimate for the size of the accessible boundary of any domain in a metric measure space of controlled geometry, i.e., a complete metric space equipped with a doubling measure supporting a $p$-Poincar\'e…

We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random…

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 1$, be a uniformly rectifiable set of dimension $n$. We show $E$ that has big pieces of boundaries of a class of domains which satisfy a 2-sided corkscrew condition, and whose connected components are…

Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…

It is well known that given two probability measures $\mu$ and $\nu$ on $\mathbb{R}$ in convex order there exists a discrete-time martingale with these marginals. Several solutions are known (for example from the literature on the Skorokhod…

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are…

The purpose of this Note is to provide a deterministic implementation of the random wave model for the number of nodal domains in the context of the two-dimensional torus. The approach is based on recent work due to Nazarov and Sodin and…

Sarnak's Density Conjecture is an explicit bound on the multiplicities of non-tempered representations in a sequence of cocompact congruence arithmetic lattices in a semisimple Lie group, which is motivated by the work of Sarnak and Xue.…

k-connectivity is an important measure of network robustness and resilience to random faults and disruptions. We undertake both local and global approaches to k-connectivity and calculate closed form analytic formulas for the probability…

Let $\Omega\subset\mathbb R^2$ be a chord arc domain. We give a simple proof of the the following fact, which is commonly known to be true: a nontrivial harmonic function which vanishes continuously on a relatively open set of the boundary…

Color-kinematics duality is a remarkable conjectured property of gauge theory which, together with double copy, is at the heart of a wealth of new developments in scattering amplitudes. So far, its validity has been verified in most cases…

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

An edge-coloured path is monochromatic if all of its edges have the same colour. For a $k$-connected graph $G$, the monochromatic $k$-connection number of $G$, denoted by $mc_k(G)$, is the maximum number of colours in an edge-colouring of…

In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous results for complete graphs whose edge sets are coloured…

The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has a monochromatic arithmetic progression of length k. The existence of such an n for any k is due to van der Waerden but known upper bounds…

The question how to Lorentz transform an N-particle wave function naturally leads to the concept of a so-called multi-time wave function, i.e. a map from (space-time)^N to a spin space. This concept was originally proposed by Dirac as the…

The analytical characterization of coverage probability in finite three-dimensional wireless networks has long remained an open problem, hindered by the loss of spatial independence in finite-node settings and the coupling between link…