Related papers: The intersection of algorithmically random closed …
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
As a fundamental piece of multi-object Bayesian inference, multi-object density has the ability to describe the uncertainty of the number and values of objects, as well as the statistical correlation between objects, thus perfectly matches…
The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…
Anomaly detection (AD) has garnered ample attention in security research, as such algorithms complement existing signature-based methods but promise detection of never-before-seen attacks. Cyber operations manage a high volume of…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
Let $c$ be a positive constant. Suppose that $r=o(n^{5/12})$ and the members of $\binom{[n]}{r}$ are chosen sequentially at random to form an intersecting hypergraph $\mathcal{H}$. We show that whp $\mathcal{H}$ consists of a simple…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
We prove that the extrinsic Hausdorff dimension is always greater than or equal to the intrinsic Hausdorff dimension in models of triangulated random surfaces with action which is quadratic in the separation of vertices. We furthermore…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…
Random systems of curves exhibiting fluctuating features on arbitrarily small scales ($\delta$) are often encountered in critical models. For such systems it is shown that scale-invariant bounds on the probabilities of crossing events imply…
For integer $m\ge3$, we study the dynamical system $(\Lambda_m,\sigma_m)$ where $\Lambda_m$ is the set $\{w\in\{0,1\}^\mathbb{N}: w$ does not contain $0^m$ or $1^m\}$ and $\sigma_m$ is the shift map on $\{0,1\}^\mathbb{N}$ restricted to…
The random reversal graph offers new perspectives, allowing to study the connectivity of genomes as well as their most likely distance as a function of the reversal rate. Our main result shows that the structure of the random reversal graph…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…
We extend the results previously published on exact packing dimensions of random recursive constructions to include constructions satisfying commonly occurring conditions. We remove the restrictive assumption that the diameter reduction…
A classical theorem due to Mattila (see \cite{Mat84}; see also \cite{M95}, Chapter 13) says that if $A,B \subset {\Bbb R}^d$ of Hausdorff dimension $s_A, s_B$, respectively, with $s_A+s_B \ge d$, $s_B>\frac{d+1}{2}$ and $dim_{{\mathcal…
We develop a new multi-scale framework flexible enough to solve a number of problems involving embedding random sequences into random sequences. Grimmett, Liggett and Richthammer asked whether there exists an increasing M-Lipschitz…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…
Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random…