搜索结果: 1-15 共查到“数学 connection”相关记录31条 . 查询时间(0.118 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Connection probabilities for random-cluster model and uniform spanning treeConnection probabilities for random-cluster model and uniform spanning tree
随机 聚类模型 均匀生成树 连接概率
2023/5/16
THE CONNECTION BETWEEN REPRESENTATION THEORY AND SCHUBERT CALCULUS
CONNECTION BETWEEN REPRESENTATION SCHUBERT CALCULUS
2015/12/17
Our aim here is to describe a direct and natural connection between the representation theory of GLn and the Schubert calculus, which goes via the Chern-Weil
theory of characteristic classes. Indeed,...
CONNECTION OF KINETIC MONTE CARLO MODEL FOR SURFACES TO ONE-STEP FLOW THEORY IN 1+1 DIMENSIONS
kinetic Monte Carlo Burton–Cabrera–Frank theory low-density approximation near-equilibrium condition master equation maximum principle
2015/10/16
The Burton–Cabrera–Frank (BCF) theory of step flow has been recognized as a valuable tool for describing nanoscale evolution of crystal surfaces. We formally derive a single-step BCF-type model from a...
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 ...
Random Conley-Markov Connection Matrix for Gradient Flows
Gradient Flows Random Conley-Markov Connection Matrix
2015/4/3
Morse Decomposition for Dynamical Systems on
compact metric spaces : φ : R × X → X, initiated by
Morse, was established by Morse, Smale, ect by using
the gradient–like flows for Morse decomposition...
A connection between the bipartite complements of line graphs and the line graphs with two positive eigenvalues
line graphs graph spectra complements Courant-Weyl inequalities
2012/4/16
In 1974 Cvetkovi\'c and Simi\'c showed which graphs $G$ are the bipartite complements of line graphs. In 2002 Borovi\'canin showed which line graphs $L(H)$ have third largest eigenvalue $\lambda_3\leq...
A sharp upper bound for the rainbow 2-connection number of 2-connected graphs
rainbow edge-coloring rainbow k-connection number 2-connected graph ear decomposition
2012/4/18
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-c...
The Associated Map of the Nonabelian Gauss-Manin Connection
the Nonabelian Gauss-Manin Connection Algebraic Geometry The Associated Map
2011/9/1
Abstract: The Gauss-Manin connection for nonabelian cohomology spaces is the isomonodromy flow. We write down explicitly the vector fields of the isomonodromy flow and calculate its induced vector fie...
Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows
Compress-and-Forward Scheme Relay Network Approximate Optimality Connection Algebraic Flows
2011/1/17
We study a wireless relay network, with a single source and a single destination.Our main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data ...
The distribution of gaps for saddle connection directions
distribution of gaps saddle connection directions
2011/2/23
Motivated by the study of billiards in polygons, we prove fine results for the distribution of gaps of directions of saddle connections on translation surfaces.
A vertex-colored graph is rainbow vertex-connected if any two ver-tices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
Characterization of the Lovelock-Palatini Lagrangians with an arbitrary connection
Characterization Lovelock-Palatini Lagrangians arbitrary connection
2011/3/2
We define the concept of Levi Civita truncation for a Lagrangian in the Palatini formulation with an arbitrary connection, and show that its consistency uniquely identifies the Lovelock Lagrangians.
A solution to a conjecture on the rainbow connection number
edge-colored graph (strong) rainbow coloring (strong) rainbow con-nection number
2011/1/21
For a graph G, Chartrand et al. defined the rainbow connection number rc(G)and the strong rainbow connection number src(G) in “G. Charand, G.L. John,K.A. Mckeon, P. Zhang, Rainbow connection in graphs...
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
edge-colored graph rainbow connection number Nordhaus-Gaddumtype
2011/1/21
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted rc(G), is the minimum number of c...