Related papers: Density-1-bounding and quasiminimality in the gene…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
We give a short proof of the $L^{1}$ criterion for Beurling generalized integers to have a positive asymptotic density. We actually prove the existence of density under a weaker hypothesis. We also discuss related sufficient conditions for…
We study various measures of irrationality for hypersurfaces of large degree in projective space and other varieties. These include the least degree of a rational covering of projective space, and the minimal gonality of a covering family…
Mean density of lower dimensional random closed sets, as well as the mean boundary density of full dimensional random sets, and their estimation are of great interest in many real applications. Only partial results are available so far in…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…
We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all…
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We…
We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…
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…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
The aim of the current paper is to explore the implications on the group $G$ of the non-vanishing of the cohomology in degree one of one of its representation $\pi$, given some mixing conditions on $\pi$. In one direction, harmonic cocycles…
We give a necessary and sufficient geometric structural condition for a stable codimension 1 integral varifold on a smooth Riemannian manifold to correspond to an embedded smooth hypersurface away from a small set of generally unavoidable…
It is a classic result that two number fields have equal Dedekind zeta functions if and only if the arithmetic type of a prime $p$ is the same in both fields for almost all prime $p$. Here, almost all means with the possible exception of a…
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…
We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…