Related papers: Generalized Cross-correlation Properties of Chu Se…
We determine the distributions of lengths of runs in random sequences of elements from a totally ordered set (total order) or partially ordered set (partial order). In particular, we produce novel formulae for the expected value, variance,…
We present the first treatment of the arc length of the Gaussian Process (GP) with more than a single output dimension. GPs are commonly used for tasks such as trajectory modelling, where path length is a crucial quantity of interest.…
We consider the correlation functions of eigenvalues of a unidimensional chain of large random hermitian matrices. An asymptotic expression of the orthogonal polynomials allows to find new results for the correlations of eigenvalues of…
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…
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern mining. A structural correlation pattern is a dense subgraph…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…
In this research article, we consider the uniqueness sequences for multidimensional vector-valued Laplace transform. We establish the fundamental relationships between uniqueness sequences for one-dimensional Laplace transform and…
We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…
The cyclic matching sequenceability of a simple graph $G$, denoted $\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so that every set of $s$ consecutive edges forms a matching. In…
Measurements in macrodiversity situations have been performed. Crosscorrelation of shadowing terms between two basestations and a mobile have been computed. It results that high cross-correlation coefficients may appear in practice.…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
Understanding and developing a correlation measure that can detect general dependencies is not only imperative to statistics and machine learning, but also crucial to general scientific discovery in the big data age. In this paper, we…
This article is a discussion of some characteristic properties in connection with global models, particularly for the application of prediction, such as the approximation property, the interpolation property and the transmission property.
I present a short review of models for transverse-momentum distributions and transversity, with a particular attention on general features common to many models. I compare some model results with experimental extractions. I discuss the…
We perform an analytical analysis of the long-range degree correlation of the giant component in an uncorrelated random network by employing generating functions. By introducing a characteristic length, we find that a pair of nodes in the…
We consider the two-point correlation function of the photodissociation cross section in molecules where the fragmentation process is indirect, passing through resonances above the dissociation threshold. In the limit of overlapping…
We study a generalization of deduplication, which enables lossless deduplication of highly similar data and show that standard deduplication with fixed chunk length is a special case. We provide bounds on the expected length of coded…
Cross-correlations in the activity in neural networks are commonly used to characterize their dynamical states and their anatomical and functional organizations. Yet, how these latter network features affect the spatiotemporal structure of…
Let $G$ denote a distance-regular graph with diameter $D\ge 3$, valency $k$, and intersection numbers $a_i$, $b_i$, $c_i$. By a {\it pseudo cosine sequence} of $G$ we mean a sequence of real numbers $s_0, s_1, ..., s_D$ such that $s_0=1$…