3,064 research outputs found
Spectral learning of dynamic systems from nonequilibrium data
Observable operator models (OOMs) and related models are one of the most
important and powerful tools for modeling and analyzing stochastic systems.
They exactly describe dynamics of finite-rank systems and can be efficiently
and consistently estimated through spectral learning under the assumption of
identically distributed data. In this paper, we investigate the properties of
spectral learning without this assumption due to the requirements of analyzing
large-time scale systems, and show that the equilibrium dynamics of a system
can be extracted from nonequilibrium observation data by imposing an
equilibrium constraint. In addition, we propose a binless extension of spectral
learning for continuous data. In comparison with the other continuous-valued
spectral algorithms, the binless algorithm can achieve consistent estimation of
equilibrium dynamics with only linear complexity
Beyond the Spectral Theorem: Spectrally Decomposing Arbitrary Functions of Nondiagonalizable Operators
Nonlinearities in finite dimensions can be linearized by projecting them into
infinite dimensions. Unfortunately, often the linear operator techniques that
one would then use simply fail since the operators cannot be diagonalized. This
curse is well known. It also occurs for finite-dimensional linear operators. We
circumvent it by developing a meromorphic functional calculus that can
decompose arbitrary functions of nondiagonalizable linear operators in terms of
their eigenvalues and projection operators. It extends the spectral theorem of
normal operators to a much wider class, including circumstances in which poles
and zeros of the function coincide with the operator spectrum. By allowing the
direct manipulation of individual eigenspaces of nonnormal and
nondiagonalizable operators, the new theory avoids spurious divergences. As
such, it yields novel insights and closed-form expressions across several areas
of physics in which nondiagonalizable dynamics are relevant, including
memoryful stochastic processes, open non unitary quantum systems, and
far-from-equilibrium thermodynamics.
The technical contributions include the first full treatment of arbitrary
powers of an operator. In particular, we show that the Drazin inverse,
previously only defined axiomatically, can be derived as the negative-one power
of singular operators within the meromorphic functional calculus and we give a
general method to construct it. We provide new formulae for constructing
projection operators and delineate the relations between projection operators,
eigenvectors, and generalized eigenvectors.
By way of illustrating its application, we explore several, rather distinct
examples.Comment: 29 pages, 4 figures, expanded historical citations;
http://csc.ucdavis.edu/~cmg/compmech/pubs/bst.ht
Griffiths phases and localization in hierarchical modular networks
We study variants of hierarchical modular network models suggested by Kaiser
and Hilgetag [Frontiers in Neuroinformatics, 4 (2010) 8] to model functional
brain connectivity, using extensive simulations and quenched mean-field theory
(QMF), focusing on structures with a connection probability that decays
exponentially with the level index. Such networks can be embedded in
two-dimensional Euclidean space. We explore the dynamic behavior of the contact
process (CP) and threshold models on networks of this kind, including
hierarchical trees. While in the small-world networks originally proposed to
model brain connectivity, the topological heterogeneities are not strong enough
to induce deviations from mean-field behavior, we show that a Griffiths phase
can emerge under reduced connection probabilities, approaching the percolation
threshold. In this case the topological dimension of the networks is finite,
and extended regions of bursty, power-law dynamics are observed. Localization
in the steady state is also shown via QMF. We investigate the effects of link
asymmetry and coupling disorder, and show that localization can occur even in
small-world networks with high connectivity in case of link disorder.Comment: 18 pages, 20 figures, accepted version in Scientific Report
Laplacian Mixture Modeling for Network Analysis and Unsupervised Learning on Graphs
Laplacian mixture models identify overlapping regions of influence in
unlabeled graph and network data in a scalable and computationally efficient
way, yielding useful low-dimensional representations. By combining Laplacian
eigenspace and finite mixture modeling methods, they provide probabilistic or
fuzzy dimensionality reductions or domain decompositions for a variety of input
data types, including mixture distributions, feature vectors, and graphs or
networks. Provable optimal recovery using the algorithm is analytically shown
for a nontrivial class of cluster graphs. Heuristic approximations for scalable
high-performance implementations are described and empirically tested.
Connections to PageRank and community detection in network analysis demonstrate
the wide applicability of this approach. The origins of fuzzy spectral methods,
beginning with generalized heat or diffusion equations in physics, are reviewed
and summarized. Comparisons to other dimensionality reduction and clustering
methods for challenging unsupervised machine learning problems are also
discussed.Comment: 13 figures, 35 reference
- …