Related papers: Turing Degrees and Randomness for Continuous Measu…
Castelnuovo-Mumford regularity and any extended degree function can be thought of as complexity measures for the structure of finitely generated graded modules. A recent result of Doering, Gunston, Vasconcelos shows that both can be…
We prove that for a typical Radon measure mu in R^d, every non-zero Radon measure is a tangent measure of mu at mu almost every point. This was already shown by T. O'Neil in his PhD thesis from 1994, but we provide a different…
In this paper, we identify a class of absolutely continuous probability distributions, and show that the differential entropy is uniformly convergent over this space under the metric of total variation distance. One of the advantages of…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
The problem of corrupted data, missing features, or missing modalities continues to plague the modern machine learning landscape. To address this issue, a class of regularization methods that enforce consistency between imputed and fully…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
Spatial interaction between two or more classes or species has important implications in various fields and causes multivariate patterns such as segregation or association. Segregation occurs when members of a class or species are more…
We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability…
Complex networks are often used to represent systems that are not static but grow with time: people make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of…
Methods for measuring convexity defects of compacts in R^n abound. However, none of the those measures seems to take into account continuity. Continuity in convexity measure is essential for optimization, stability analysis, global…
This thesis is a study of various ways of measuring the size and complexity of finitely generated modules over a Noetherian local ring. The classical example is the multiplicity or degree. Here we investigate several variants of the degree…
Consider a sequence of linear contractions $S_{j}(x)=\varrho x+d_{j}$ and probabilities $p_{j}>0$ with $\sum p_{j}=1$. We are interested in the self-similar measure $\mu =\sum p_{j}\mu \circ S_{j}^{-1}$, of finite type. In this paper we…
We study families of depth measures defined by natural sets of axioms. We show that any such depth measure is a constant factor approximation of Tukey depth. We further investigate the dimensions of depth regions, showing that the Cascade…
Multivariate interaction between two or more classes (or species) has important consequences in many fields and causes multivariate clustering patterns such as segregation or association. The spatial segregation occurs when members of a…
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…
For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…
We study algorithmically random closed subsets of $2^\omega$, algorithmically random continuous functions from $2^\omega$ to $2^\omega$, and algorithmically random Borel probability measures on $2^\omega$, especially the interplay between…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
Let $T_n$ be a random recursive tree with $n$ nodes. List vertices of $T_n$ in decreasing order of degree as $v^1,\ldots,v^n$, and write $d^i$ and $h^i$ for the degree of $v^i$ and the distance of $v^i$ from the root, respectively. We prove…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…