Related papers: Turing Degrees and Randomness for Continuous Measu…
Generalizing Keisler's notion of regularity for ultrafilters, Taylor introduced degrees of regularity for ideals and showed that a countably complete nonregular ideal on $\omega_1$ must be somewhere $\omega_1$-dense. We prove a dichotomy…
We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…
Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation $r$,…
Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph…
In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-L\"of random with respect to a Bernoulli measure $\mu_p$ for some $p\in[0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in…
L\"uroth series, like regular continued fractions, provide an interesting identification of real numbers with infinite sequences of integers. These sequences give deep arithmetic and measure-theoretic properties of subsets of numbers…
We study nonparametric clustering of smooth random curves on the basis of the L2 gradient flow associated to a pseudo-density functional and we show that the clustering is well-defined both at the population and at the sample level. We…
We study continuity and discontinuity properties of some popular measure-dimension mappings under some topologies on the space of probability measures in this work. We give examples to show that no continuity can be guaranteed under general…
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…
We study the entropy and Lyapunov exponents of invariant measures $\mu$ for smooth surface diffeomorphisms $f$, as functions of $(f,\mu)$. The main result is an inequality relating the discontinuities of these functions. One consequence is…
For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The…
An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An $N$-vertex graph is called $C$-Ramsey if it has no homogeneous set of size $C\log N$. A theorem of Bukh and…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
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 provide a topological classification of locally constant functions over subshifts of finite type via their zero-temperature measures. Our approach is to analyze the relationship between the distribution of the zero-temperature measures…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
We numerically investigate the robustness of networks with degree-degree correlations between nodes separated by distance $l=2$ in terms of shortest path length. The degree-degree correlation between the $l$-th nearest neighbors can be…
In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measures. We analyze several classes of extraction procedures: a…