Related papers: Regular sequences and the joint spectral radius
We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
The normalized radial basis function neural network emerges in the statistical modeling of natural laws that relate components of multivariate data. The modeling is based on the kernel estimator of the joint probability density function…
There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.
We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description. We carry out a precise distributional analysis of…
We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…
The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…
In this paper, we compute the spectral norms of the matrices related with integer squences and we give two examples related with Fibonacci and Lucas numbers.
Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…
Spectral sampling is associated with the group of unitary transformations acting on matrices in much the same way that simple random sampling is associated with the symmetric group acting on vectors. This parallel extends to symmetric…
The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic…
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set. The lower spectral radius arises…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
Based on the density of connections between the nodes of high degree, we introduce two bounds of the spectral radius. We use these bounds to split a network into two sets, one of these sets contains the high degree nodes, we refer to this…
We prove a nonlinear regularity principle in sequence spaces which produces universal estimates for special series defined therein. Some consequences are obtained and, in particular, we establish new inclusion theorems for multiple summing…
For linear nonautonomous differential equations we introduce a new family of spectrums defined with general nonuniform dichotomies: for a given growth rate $\mu$ in a large family of growth rates, we consider a notion of spectrum, named…
The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…
In this article we construct what we call a higher spectral sequence for any chain complex (or topological space) that is filtered in $n$ compatible ways. For this we extend the previous spectral system construction of the author, and we…