The analysis of datasets taking the form of simple, undirected graphs
continues to gain in importance across a variety of disciplines. Two choices of
null model, the logistic-linear model and the implicit log-linear model, have
come into common use for analyzing such network data, in part because each
accounts for the heterogeneity of network node degrees typically observed in
practice.
Covariance matrix estimates are an essential part of many signal processing
algorithms, and are often used to determine a low-dimensional principal
subspace via their spectral decomposition. However, exact eigenanalysis is
computationally intractable for sufficiently high-dimensional matrices, and in
the case of small sample sizes, sample eigenvalues and eigenvectors are known
to be poor estimators of their true counterparts. To address these issues, we
propose a covariance estimator that is computationally efficient while also
performing shrinkage on the sample eigenvalues.
Network data often take the form of repeated interactions between senders and
receivers tabulated over time. A primary question to ask of such data is which
traits and behaviors are predictive of interaction. To answer this question, a
model is introduced for treating directed interactions as a multivariate point
process: a Cox multiplicative intensity model using covariates that depend on
the history of the process.
Vocal tract resonance characteristics in acoustic speech signals are
classically tracked using frame-by-frame point estimates of formant frequencies
followed by candidate selection and smoothing using dynamic programming methods
that minimize ad hoc cost functions. The goal of the current work is to provide
both point estimates and associated uncertainties of center frequencies and
bandwidths in a statistically principled state-space framework.
We present asymptotic and finite-sample results on the use of
single-membership stochastic blockmodels for the analysis of network data. We
show that the fraction of misclassified network nodes converges in probability
to zero under maximum likelihood fitting when the number of classes is allowed
to grow as the root of the network size and the average network degree grows at
least poly-logarithmically in this size.
In conventional supervised pattern recognition tasks, model selection is
typically accomplished by minimizing the classification error rate on a set of
so-called development data, subject to ground-truth labeling by human experts
or some other means. In the context of speech processing systems and other
large-scale practical applications, however, such labeled development data are
typically costly and difficult to obtain.
This article develops a general detection theory for speech analysis based on
time-varying autoregressive models, which themselves generalize the classical
linear predictive speech analysis framework. This theory leads to a
computationally efficient decision-theoretic procedure that may be applied to
detect the presence of vocal tract variation in speech waveform data.
Rank estimation is a classical model order selection problem that arises in a
variety of important statistical signal and array processing systems, yet is
addressed relatively infrequently in the extant literature. Here we present
sample covariance asymptotics stemming from random matrix theory, and bring
them to bear on the problem of optimal rank estimation in the context of the
standard array observation model with additive white Gaussian noise.
In this article we introduce a broad family of adaptive, linear
time-frequency representations termed superposition frames, and show that they
admit desirable fast overlap-add reconstruction properties akin to standard
short-time Fourier techniques. This approach stands in contrast to many
adaptive time-frequency representations in the extant literature, which, while
more flexible than standard fixed-resolution approaches, typically fail to
provide efficient reconstruction and often lack the regular structure necessary
for precise frame-theoretic analysis.
Material indentation studies, in which a probe is brought into controlled
physical contact with an experimental sample, have long been a primary means by
which scientists characterize the mechanical properties of materials. More
recently, the advent of atomic force microscopy, which operates on the same
fundamental principle, has in turn revolutionized the nanoscale analysis of
soft biomaterials such as cells and tissues.
This article describes a series of new results outlining equivalences between
certain "rewirings" of filterbank system block diagrams, and the corresponding
actions of convolution, modulation, and downsampling operators. This gives rise
to a general framework of reverse-order and convolution subband structures in
filterbank transforms, which we show to be well suited to the analysis of
filterbank coefficients arising from subsampled or multiplexed signals.
This article describes a series of new results outlining equivalences between
certain "rewirings" of filterbank system block diagrams, and the corresponding
actions of convolution, modulation, and downsampling operators. This gives rise
to a general framework of reverse-order and convolution subband structures in
filterbank transforms, which we show to be well suited to the analysis of
filterbank coefficients arising from subsampled or multiplexed signals.