理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 mixing相关记录34条 . 查询时间(0.115 秒)
In the study of incompressible fluid, one fundamental phenomenon that arises in a wide variety of application is dissipation enhancement by so-called mixing flow. In this talk, I will give a brief int...
I will present the joint work with Jialun Li and Pratyush Sarkar in the talk. As a final work to establish that the frame flows for geometrically finite hyperbolic manifolds of arbitrary dimensions ar...
I will present the joint work with Jialun Li and Pratyush Sarkar in the talk. As a final work to establish that the frame flows for geometrically finite hyperbolic manifolds of arbitrary dimensions ar...
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...
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 ...
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...
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...
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...
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...
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...
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...
DIFFUSION AND MIXING IN FLUID FLOW     DIFFUSION  MIXING  FLUID FLOW       2015/7/14
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     Mix  markov chain  figure       2015/7/8
Fastest Mixing Markov Chain on a Graph。
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...
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 ...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...