相关论文: On Kemeny's constant and stochastic complement

The initial theoretical connections between Leontief input-output models and Markov chains were established back in 1950s. However, considering the wide variety of mathematical properties of Markov chains, there has not been a full…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…

This paper considers the speed of convergence (mixing) of a finite Markov kernel $P$ with respect to the Kullback-Leibler divergence (entropy). Given a Markov kernel one defines either a discrete-time Markov chain (with the $n$-step…

We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…

Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…

Linear systems with a tensor product structure arise naturally when considering the discretization of Laplace type differential equations or, more generally, multidimensional operators with separable coefficients. In this work, we focus on…

The coupled entropy, $H_\kappa,$ is proven to uniquely satisfy the requirement that a generalized entropy be a measure of the uncertainty at the scale, $\sigma,$ for a class of non-exponential distributions. The coupled stretched…

In this paper, we mainly investigate $K_{1,2}$-structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $\kappa(G; K_{1,2})$ is well-defined if $diam(G)\geq 4$, or $n\equiv 1\pmod 3$, or…

Bergsma (2006) proposed a covariance $\kappa$(X,Y) between random variables X and Y. He derived their asymptotic distributions under the null hypothesis of independence between X and Y. The non-null (dependent) case does not seem to have…

The intriguing and still open question concerning the composition law of $\kappa$-entropy $S_{\kappa}(f)=\frac{1}{2\kappa}\sum_i (f_i^{1-\kappa}-f_i^{1+\kappa})$ with $0<\kappa<1$ and $\sum_i f_i =1$ is here reconsidered and solved. It is…

Statistical analysis of large and sparse graphs is a challenging problem in data science due to the high dimensionality and nonlinearity of the problem. This paper presents a fast and scalable algorithm for partitioning such graphs into…

The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants…

A new parametric class of semi-implicit numerical schemes for a level set advection equation on Cartesian grids is derived and analyzed. An accuracy and a stability study is provided for a linear advection equation with a variable velocity…

The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's…

Exact results for the scaling properties of compact polymers on the square lattice are obtained from an effective field theory. The entropic exponent \gamma=117/112 is calculated, and a line of fixed points associated with interacting…

Recent experiments and simulations have shown that two-dimensional systems can form tetratic phases with four-fold rotational symmetry, even if they are composed of particles with only two-fold symmetry. To understand this effect, we…

A new measure $c(e)$ of the centrality of an edge $e$ in an undirected graph $G$ is introduced. It is based on the variation of the Kemeny constant of the graph after removing the edge $e$. The new measure is designed in such a way that the…

For random graphs distributed according to a stochastic block model, we consider the inferential task of partioning vertices into blocks using spectral techniques. Spectral partioning using the normalized Laplacian and the adjacency matrix…

Coupled Tchebyscheff maps have recently been introduced to explain parameters in the standard model of particle physics, using the stochastic quantisation of Parisi and Wu. This paper studies dynamical properties of these maps, finding…