Upper escape rate of Markov chains on weighted graphs

We obtain an upper escape rate function for a continuous time minimal symmetric Markov chain defined on a locally finite weighted graph. This upper rate function, which has the same form as the manifold setting, is given in terms of the volume growth with respect to an adapted path metric. Our approach also gives a weak form of Folz’s theorem on the conservativeness as a consequence.     

Sanov results for Glauber spin-glass dynamics

Summary. In this paper we prove a Sanov result, i.e. a Large Deviation Principle (LDP) for the distribution of the empirical measure, for the annealed Glauber dynamics of the Sherrington-Kirkpatrick spin-glass. Without restrictions on time or temperature we prove a full LDP for the asymmetric dynamics and the crucial upper large deviations bound for the symmetric dynamics. In the symmetric model a new order-parameter arises corresponding to the response function in [SoZi83]. In the asymmetric case we show that the corresponding rate function has a unique minimum, given as the solution of a self-consistent equation. The key argument used in the proofs is a general result for mixing of what is known as Large Deviation Systems (LDS) with measures obeying an independent LDP. Received: 18 May 1995 / In revised form: 14 March 1996     

Escape Rate of Markov Chains on Infinite Graphs

We study the escape rate of continuous time symmetric Markov chains associated with weighted graphs. The upper rate functions are given in terms of volume growth of the weighted graphs. For a class of symmetric birth and death processes, we obtain sharp upper rate functions.     

On the symmetric properties of APN functions

We study the symmetric properties of APN functions as well as the structure and properties of the range of an arbitrary APN function. We prove that there is no permutation of variables that preserves the values of an APN function. Upper bounds for the number of symmetric coordinate Boolean functions in an APN function and its coordinate functions invariant under a cyclic shift are obtained. For n ≤ 6, some upper bounds for the maximal number of identical values of an APN function are given and a lower bound is found for different values of an arbitrary APN function of n variables.     

Improved Model Selection Method for a Regression Function with Dependent Noise

This paper is devoted to nonparametric estimation, through the -risk, of a regression function based on observations with spherically symmetric errors, which are dependent random variables (except in the normal case). We apply a model selection approach using improved estimates. In a nonasymptotic setting, an upper bound for the risk is obtained (oracle inequality). Moreover asymptotic properties are given, such as upper and lower bounds for the risk, which provide optimal rate of convergence for penalized estimators.     

Tests for multiple monotone symmetric conglutinations of variables in Boolean functions

A linear lower and a quadratic upper bound on the Shannon function for the length of a detecting test for multiple monotone symmetric conglutinations are proved. Additionally, the exact value of the Shannon function for the length of a diagnostic test for multiple monotone symmetric conglutinations is found. Some of the variables of a Boolean function are said to conglutinate if each of them is replaced by a function of these variables. A conglutination is called multiple if there are several groups of conglutinated variables.     

四阶不完全对称张量M-特征值的新包含域及应用

四阶不完全对称张量的M-特征值在非线性弹性材料分析中有着广泛的应用.本文的目的是给出四阶不完全对称张量M-特征值的新包含域,得到最大M-特征值上界更精确的估计,并将得到的上界估计值应用到计算最大M-特征值的WQZ算法中,数值例子验证了结果的有效性.最后,基于得到的包含域,给出了四阶不完全对称张量正定性判定的充分条件.     

Rate Functions for Symmetric Markov Processes via Heat Kernel

By making full use of heat kernel estimates, we establish the integral tests on the zero-one laws of upper and lower bounds for the sample path ranges of symmetric Markov processes. In particular, these results concerning on upper rate bounds are applicable for local and non-local Dirichlet forms, while lower rate bounds are investigated in both subcritical setting and critical setting.     

Upper integral and its geometric meaning

The Hahn definition of the integral is recalled, the requirement of measurability of the integrand omitted. Both the upper and lower integrals comply with this definition and so does any measurable function between them. The outer product measure of the hypograph of a nonnegative bounded nonmeasurable function is equal to the upper integral which is equal to one of the Fan integrals. The outer measure of the graph of a bounded nonmeasurable function is equal to the difference between the upper and lower integrals. A norm for not necessarily measurable functions is defined with the upper integral. The linear space with this norm is complete. The convergence in this space implies the convergence in outer measure. The distance as an outer measure of the symmetric difference of two sets gives us a complete metric space of classes of subsets.      

On least eigenvalues and least eigenvectors of real symmetric matrices and graphs

We give an upper bound for the least eigenvalue of a principal submatrix of a real symmetric matrix with zero diagonal, from which we establish an upper bound for the least eigenvalue of a graph when some vertices are removed using the components of the least eigenvector(s). We give lower and upper bounds for the least eigenvalue of a graph when some edges are removed. We also establish bounds for the components of the least eigenvector(s) of a real symmetric matrix and a graph.     

Rosenthal inequalities in noncommutative symmetric spaces

We give a direct proof of the ‘upper’ Khintchine inequality for a noncommutative symmetric (quasi-)Banach function space with nontrivial upper Boyd index. This settles an open question of C. Le Merdy and the fourth named author (Le Merdy and Sukochev, 2008 [24]). We apply this result to derive a version of Rosenthal?s theorem for sums of independent random variables in a noncommutative symmetric space. As a result we obtain a new proof of Rosenthal?s theorem for (Haagerup) Lp-spaces.     

Convergence of a generalized method of conjugate gradients for the determination of the extremal eigenvalues of a matrix

For the determination of the minimal eigenvalue of a symmetric positive-definite matrix one obtains an estimate of the asymptotic rate of convergence of a generalized method of conjugate gradients, based on the method of the symmetric upper relaxation. One establishes the asymptotic value of the relaxation parameter.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instita im. V. A. Steklova AN SSSR, Vol. 111, pp. 145–150, 1981.     

两平面凸域的对称混合等周不等式

设K_k(k=i,j)为欧氏平面R~2中面积为A_k,周长为P_k的域,它们的对称混合等周亏格(symmetric mixed isoperimetric deficit)为σ(K_i,K_j)=P_i~2P_j~2-16π~2A_iA_j.根据周家足,任德麟(2010)和Zhou,Yue(2009)中的思想,用积分几何方法,得到了两平面凸域的Bonnesen型对称混合不等式及对称混合等周不等式,给出了两域的对称混合等周亏格的一个上界估计.还得到了两平面凸域的离散Bonnesen型对称混合不等式及两凸域的对称混合等周亏格的一个上界估计,并应用这些对称混合(等周)不等式估计第二类完全椭圆积分.     

Capacitary Upper Estimates for Symmetric Dirichlet Forms

Upper estimates for capacities are studied for symmetric Dirichlet forms which do not necessarily admit intrinsic metric. Firstly, a general method of obtaining a sharp estimate from upper estimates for cut-off functions are provided in the local and non-local cases. Secondly, a capacitary upper estimate is established for the skew product of two symmetric Dirichlet forms for which suitable capacitary estimates are given. Several examples of capacitary upper inequalities in the local and non-local cases are also given. Especially, an upper estimate for the capacity is proved for the symmetric Dirichlet form associated to the Markov process subordinated (in the Bochner sense) to the skew product of two one-dimensional Brownian motions with respect to the local time of the first Brownian motion at the origin. This estimate is used in the recent work by the present author to establish the sharp criteria for recurrence and transience of the above-mentioned process.     

Geometric Estimation of a Potential and Cone Conditions of a Body

We investigate a potential obtained as the convolution of a radially symmetric function and the characteristic function of a body (the closure of a bonded open set) with exterior cones. In order to restrict the location of a maximizer of the potential into a smaller closed region contained in the interior of the body, we give an estimate of the potential using the exterior cones of the body. Moreover, we apply the result to the Poisson integral for the upper half-space.     

Exponential convergence rate in entropy

The exponential convergence rate in entroy is studied for symmetric forms, with a special attention to the Markov chain with a state space having two points only. Some upper and lower bounds of the rate are obtained and five examples with precise or qualitatively exact estimates are presented.      

On the ranks of bent functions

The rank of a bent function is the 2-rank of the associated symmetric 2-design. In this paper, it is shown that it is an invariant under the equivalence relation among bent functions. Some upper and lower bounds of ranks of general bent functions, Maiorana–McFarland bent functions and Desarguesian partial spread bent functions are given. As a consequence, it is proved that almost every Desarguesian partial spread bent function is not equivalent to any Maiorana–McFarland bent function.     

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the particular case of symmetric functions our bounds are matching and we exactly characterize the best possible competitiveness achievable by a deterministic algorithm. Our upper bound is obtained by a simple polynomial time algorithm.     

A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix

An upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries is investigated in [S. Zhao, Y. Hong, On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix, Linear Algebra Appl. 340 (2002) 245-252]. We obtain a sharp upper bound on the maximal entry y^max_p in the principal eigenvector of symmetric nonnegative matrix in terms of order, the spectral radius, the largest and the smallest diagonal entries of that matrix. Our bound is applicable for any symmetric nonnegative matrix and the upper bound of Zhao and Hong (2002) for the maximal entry y^max_p follows as a special case. Moreover, we find an upper bound on maximal entry in the principal eigenvector for the signless Laplacian matrix of a graph.     

On symmetric algorithms for bilinear forms over finite fields

In this paper we study the computation of symmetric systems of bilinear forms over finite fields via symmetric bilinear algorithms. We show that, in general, the symmetric complexity of a system is upper bounded by a constant multiple of the bilinear complexity; we characterize symmetric algorithms in terms of the cosets of a specific cyclic code, and we show that the problem of finding an optimal symmetric algorithm is equivalent to the maximum-likelihood decoding problem for this code.