نتایج جستجو برای: symmetric doubly stochastic matrix
تعداد نتایج: 564739 فیلتر نتایج به سال:
We present preliminary results from Fermilab E791 on D 0 ? D 0 mixing and doubly Cabibbo-suppressed decays (DCSD) of the D 0 and D + mesons. The time dependence of the wrong-sign signal (D 0 ! K + ?) is used to establish separate limits on DCSD and mixing. From one third of our data we obtained r mix < 0:47%, r DCSD < 2:7% at the 90% conndence level.
To a unitary matrix U we associate a doubly stochastic matrix M by taking the modulus squared of each element of U. To study the connection between onset of quantum chaos on graphs and ergodicity of the underlying Markov chain, specified by M, we study the limiting distribution of the spectral gap of M when U is taken from the Circular Unitary Ensemble and the dimension N of U is taken to infin...
In this paper we propose a regularized relaxation based graph matching algorithm. The graph matching problem is formulated as a constrained convex quadratic program, by relaxing the permutation matrix to a doubly stochastic one. To gradually push the doubly stochastic matrix back to a permutation one, a simple weighted concave regular term is added to the convex objective function. The concave ...
In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graphmatrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris’ question...
Abstract. In this paper we introduce doubly symmetric functions, arising from the equivalence of particular linear combinations of Schur functions and hook Schur functions. We study algebraic and combinatorial aspects of doubly symmetric functions, in particular as they form a subalgebra of the algebra of symmetric functions. This subalgebra is generated by the odd power sum symmetric functions...
In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices. We then further investigate the properties of the numerical matrices and show that they are d...
Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general. For the case when all edges in the MRF carry the same symmetric, doubly stochastic potential, recent works have proposed to approximate BP by linearizing th...
In this paper we show that one-qubit polynomial time computations are as powerful as NC circuits. More generally, we define syntactic models for quantum and stochastic branching programs of bounded width and prove upper and lower bounds on their power. We show that any NC language can be accepted exactly by a width-2 quantum branching program of polynomial length, in contrast to the classical c...
Since Pardoux and Peng firstly studied the following nonlinear backward stochastic differential equations in 1990. The theory of BSDE has been widely studied and applied, especially in the stochastic control, stochastic differential games, financial mathematics and partial differential equations. In 1994, Pardoux and Peng came up with backward doubly stochastic differential equations to give th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید