相关论文: On Kemeny's constant and stochastic complement
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…
There is one-to-one correspondence between quadratic operators (mapping $\mathbb R^m$ to itself) and cubic matrices. It is known that any quadratic operator corresponding to a stochastic (in a fixed sense) cubic matrix preserves the…
For any channel $P_{Y|X}$ the strong data processing constant is defined as the smallest number $\eta_{KL}\in[0,1]$ such that $I(U;Y)\le \eta_{KL} I(U;X)$ holds for any Markov chain $U-X-Y$. It is shown that the value of $\eta_{KL}$ is…
Let $p$ and $q$ be two distinct odd primes. Let $K$ be an imaginary quadratic field over which $p$ and $q$ are both split. Let $\Psi$ be a Hecke character over $K$ of infinity type $(k,j)$ with $0\le-j< k$. Under certain technical…
The syntactic nature and compositionality characteristic of stochastic process algebras make models to be easily understood by human beings, but not convenient for machines as well as people to directly carry out mathematical analysis and…
The quadratic embedding constant (QEC) of a graph $G$ is a new numeric invariant, which is defined in terms of the distance matrix and is denoted by $\mathrm{QEC}(G)$. By observing graph structure of the maximal cliques (clique graph), we…
We consider averages $\kappa$ of spectral measures of rank one perturbations with respect to a $\sigma$-finite measure $\nu$. It is examined how various degrees of continuity of $\nu$ with respect to $\alpha$-dimensional Hausdorff measures…
Applications of stochastic models often involve the evaluation of steady-state performance, which requires solving a set of balance equations. In most cases of interest, the number of equations is infinite or even uncountable. As a result,…
We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given $k$: $(\star)$ For any set of parameters $A$, formula $\varphi(x,b)$, and $A$-bi-invariant…
Finding the stochastic equilibria for finite-state stochastic matrices amounts to solving an eigen\-vector problem $\pi = \pi P$. Various techniques for doing so are known, some extremely computationally intensive. Herein we shall aim to…
Given an ergodic finite-state Markov chain, let M_{iw} denote the mean time from i to equilibrium, meaning the expected time, starting from i, to arrive at a state selected randomly according to the equilibrium measure w of the chain. John…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
The basic question in perturbation analysis of Markov chains is: how do small changes in the transition kernels of Markov chains translate to chains in their stationary distributions? Many papers on the subject have shown, roughly, that the…
In classical thermodynamics the entropy is an extensive quantity, i.e.\ the sum of the entropies of two subsystems in equilibrium with each other is equal to the entropy of the full system consisting of the two subsystems. The extensitivity…
The full family of discrete logistic maps has been widely studied both as a canonical example of the period-doubling route to chaos, and as a model of natural processes. In this paper we present a study of the stochastic process described…
Sparse PCA is the optimization problem obtained from PCA by adding a sparsity constraint on the principal components. Sparse PCA is NP-hard and hard to approximate even in the single-component case. In this paper we settle the computational…
We study irreducible time-homogenous Markov chains with finite state space in discrete time. We obtain results on the sensitivity of the stationary distribution and other statistical quantities with respect to perturbations of the…
We study the problem of enumerating Braess edges for Kemeny's constant in trees. We obtain bounds and asympotic results for the number of Braess edges in some families of trees.
Kunchenko's method of polynomial maximization provides a semiparametric apparatus for parameter estimation under non-Gaussian errors, but its classical power basis relies on finite higher-order integer moments. This paper introduces the…