Related papers: Density-1-bounding and quasiminimality in the gene…
Copulas are known to satisfy a number of regularity properties, and one might therefore believe that their densities, when they exist, admit a certain degree of regularity themselves. We show that this is not true in general by constructing…
We discuss the (re-)construction of quasiprobability representations from generic measurements, including noisy ones. Based on the measurement under study, quasiprobabilities and the associated concept of nonclassicality are introduced. A…
In this paper we prove an optimal co-degrees resilience property for the binomial $k$-uniform hypergraph model $H_{n,p}^k$ with respect to perfect matchings. That is, for a sufficiently large $n$ which is divisible by $k$, and $p\geq…
Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…
A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…
Let $\mathcal{A}$ be a mathematical structure with an additional relation $R$. We are interested in the degree spectrum of $R$, either among computable copies of $\mathcal{A}$ when $(\mathcal{A},R)$ is a "natural" structure, or (to make…
We provide a general framework for analyzing degree correlations between nodes separated by more than one step (i.e., beyond nearest neighbors) in complex networks. One probability and four conditional probabilities are introduced to fully…
In this paper we consider the isoperimetric problem with double density in an Euclidean space, that is, we study the minimisation of the perimeter among subsets of $\mathbb{R}^n$ with fixed volume, where volume and perimeter are relative to…
We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the "dissipation"…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
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…
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set. The proof handles the simple cases via…
For each positive integer $Q\in\mathbb{Z}_{\geq 2}$, we prove a multi-valued $C^{1,\alpha}$ regularity theorem for varifolds in the class $\mathcal{S}_Q$, i.e., stable codimension one stationary integral $n$-varifolds which have no…
The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping…
We study set systems definable in graphs using variants of logic with different expressive power. Our focus is on the notion of Vapnik-Chervonenkis density: the smallest possible degree of a polynomial bounding the cardinalities of…
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…
For any constant $C_0>0$, we construct a set $A \subset {\mathbb N}$ such that one has $$ \sum_{n \in A: n \leq x} \frac{1}{n} = \exp\left(\left(\frac{C_0}{2}+o(1)\right) (\log\log x)^{1/2} \log\log\log x \right)$$ and $$ \sum_{n,m \in A:…