Related papers: A Relation on ${(\omega, <)}$ of Intermediate Degr…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…

Degree assortativity refers to the increased or decreased probability of connecting two neurons based on their in- or out-degrees, relative to what would be expected by chance. We investigate the effects of such assortativity in a network…

We introduce concepts of intermediate rank for countable groups that "interpolate" between consecutive values of the classical (integer-valued) rank. Various classes of groups are proved to have intermediate rank behaviors. We are…

In the abstract pseudodifferential setup of Connes and Moscovici, we prove a general formula for the discrepancies of zeta-regularised traces associated with certain spectral triples, and we introduce a canonical trace on operators, whose…

Let $\Omega \subset \mathbb{R}$ be a compact set with measure $1$. If there exists a subset $\Lambda \subset \mathbb{R}$ such that the set of exponential functions $E_{\Lambda}:=\{e_\lambda(x) = e^{2\pi i \lambda x}|_\Omega :\lambda \in…

Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…

Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…

Let k be an algebraically closed field of characteristic 0, and let $A = k[x,y]/(f)$ be a quasi-homogeneous plane curve. We show that for any graded torsion free A-module M, there exists a natural graded integrable connection, i.e. a graded…

This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

Given a positively graded commutative coherent ring A which is finitely generated as an A_0-algebra, a bijection between the tensor Serre subcategories of qgr A and the set of all subsets Y\subseteq Proj A of the form…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…

This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…

Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…

We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…

We generalize the degree-organizational view of real-world networks with broad degree-distributions in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent…

We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…

We introduce the periodic Airy-Schr\"odinger operator and we study its band spectrum. This is an example of an explicitly solvable model with a periodic potential which is not differentiable at its minima and maxima. We define a…