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

Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…

Although most of the real networks contain a mixture of directed and bidirectional (reciprocal) connections, the reciprocity $r$ has received little attention as a subject of theoretical understanding. We study the expected reciprocity of…

In their paper on multiplicity bounds (1998), Herzog and Srinivasan study the relationship between the graded Betti numbers of a homogeneous ideal I in a polynomial ring R and the degree of I. For certain classes of ideals, they prove a…

In dimension greater than or equal to three, we investigate the spectrum of a Schr{\"o}dinger operator with a $\delta$-interaction supported on a cone whose cross section is the sphere of co-dimension two. After decomposing into fibers, we…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

We develop a new degree theory for 4-dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over $S^3$ with non-negative scalar…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to…

This paper brings together two theories in algebra that have had been extensively developed in recent years. First is the study of various homological dimensions and what information such invariants can give about a ring and its modules. A…

The micro-structure of the giant component of the Erd{\H o}s-R\'enyi network and other configuration model networks is analyzed using generating function methods. While configuration model networks are uncorrelated, the giant component…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…

We obtain closed form expressions for the expected conditional degree distribution and the joint degree distribution of the linear preferential attachment model for network growth in the steady state. We consider the multiple-destination…

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…

In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…

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…

Let $Z$ be a projective hypersurface such that its underlying reduced variety has only isolated singularities. In case its irreducible components have constant multiplicities, for instance if $\dim Z>1$, we show that the spectrum of its…