搜索结果: 1-15 共查到“数学 mixing”相关记录34条 . 查询时间(0.127 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Mixing flow and advection-diffusion-reaction equations
混合流 平流 扩散反应方程
2023/5/18
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Exponential mixing of frame flows for geometrically finite hyperbolic manifolds with cusps
几何有限 双曲流形带尖 框架流 指数混合
2023/4/28
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars: Exponential mixing of frame flows for geometrically finite hyperbolic manifolds with cusps
几何有限 双曲流形带尖 框架流 指数混合
2023/5/4
ON MIXING PROPERTIES OF COMPACT GROUP EXTENSIONS OF HYPERBOLIC SYSTEMS
GROUP EXTENSIONS HYPERBOLIC SYSTEMS
2015/9/29
We study compact group extensions of hyperbolic diffeomorphisms. We relate mixing properties of such extensions with
accessibility properties of their stable and unstable laminations.
We show that g...
GENERALIZED SPARSE SIGNAL MIXING MODEL AND APPLICATION TO NOISY BLIND SOURCE SEPARATION
GENERALIZED SPARSE SIGNAL MIXING MODEL NOISY BLIND SOURCE SEPARATION
2015/9/29
Sparse constraints on signal decompositions are justified bytypical sensor data used in a variety of signal processing fields such as acoustics, medical imaging, or wireless, but moreover can lead to ...
Information Theory Based Estimator of the Number of Sources in a Sparse Linear Mixing Model
Information Theory Estimator of the Number of Sources Sparse Linear Mixing Model
2015/9/29
In this paper we present an Information Theoretic Estimator for the number of sources mutuallydisjoint in a linear mixing model. The approach follows the Minimum Description Length prescription and is...
Detecting the Presence of Mixing with Multiscale Maximum Likelihood
Log-concave Mixture detection
2015/8/20
A test of homogeneity tries to decide whether observations come from a single distribution or from a mixture of several distributions.
A powerful theory has been developed for the case where the comp...
Fastest mixing Markov chain on a graph
Markov chains second largest eigenvalue modulus fast mixing semidefinite programming subgradient method
2015/8/11
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equ...
Mixing times for random walks on geometric random graphs
Random geometric random graph nodes wireless network model and threshold properties random walk figure d dimension
2015/8/11
A geometric random graph, G^d(n,r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each oth...
Fastest mixing Markov chain on a path
Random walks symmetrical transition probability markov chain the uniform distribution the transfer matrix
2015/8/10
We consider a random walk on a path with n nodes, with symmetric transition probabilities, i.e., the probability of making a transition between node i and node i+1 is the same as making a transition f...
Fastest mixing Markov chain on graphs with symmetries
Markov chains fast mixing eigenvalue optimization semidefi nite programming graph automorphism group representation
2015/8/10
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest ei...
We study enhancement of diffusive mixing on a compact Riemannian manifold by a fast incompressible flow. Our main result is a sharp description of the class of flows that make the deviation of the sol...
Fastest Mixing Markov Chain on a Graph。
Fastest mixing Markov chain on a path
Distribution probability the edge markov chain random walk
2015/7/8
We consider the problem of assigning transition probabilities to the edges of a path, so the resulting Markov chain or random walk mixes as rapidly as possible. In this note we prove that fastest mixi...
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Markov connected graph edge tags transition rates
2015/7/8
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...