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

Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Chen method to derive Poisson approximations for the distribution of the number of subgraphs in the stochastic block model which are…

We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic…

We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical…

The stochastic block model is a canonical random graph model for clustering and community detection on network-structured data. Decades of extensive study on the problem have established many profound results, among which the phase…

The time evolution of the one-point probability vector of stochastic processes and quantum processes for $N$-level systems have been unified. Hence, quantum states and quantum operations can be regarded as generalizations of the one-point…

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

It is well known that real measures on the circle are characterized by their Herglotz transform, an analytic function in the unit disc. Invariance of the measure under N-multiplication translates into a functional equation for the Herglotz…

We investigate here the asymptotic behaviour of a large typical meandric system. More precisely, we show the quenched local convergence of a random uniform meandric system $M_n$ on $2n$ points, as $n \rightarrow \infty$, towards the…

We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…

The generalized Markoff mod $p$ graph is defined via the equation $x^2+y^2+z^2=xyz+\kappa$ over the finite field $\mathbb{F}_p$ of prime order $p$. In this paper, we investigate the topological properties of the graph such as non-planarity,…

A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…

We give a hierarchy of many-parameter families of maps of the interval [0,1] with an invariant measure and using the measure, we calculate Kolmogorov--Sinai entropy of these maps analytically. In contrary to the usual one-dimensional maps…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…

A new framework for many multiblock component methods (including consensus and hierarchical PCA) is proposed. It is based on the consensus PCA model: a scheme connecting each block of variables to a superblock obtained by concatenation of…

In an influential paper, Courtois and Semal (1984) establish that when $G$ is an irreducible substochastic matrix for which $\sum_{n=0}^{\infty}G^n <\infty$, then the stationary distribution of any stochastic matrix $P\ge G$ can be…

We present a new method which uses Feynman-like diagrams to calculate the statistical quantities of embedded many-body random matrix problems. The method provides a promising alternative to existing techniques and offers many important…

We consider the time dependent probability distribution of a coarse grained observable Y whose evolution is governed by a discrete time map. If the map is mixing, the time dependent one-step transition probabilities converge in the long…

There are well-known constructions of integrable systems which are chains of infinitely many copies of the equations of the KP hierarchy ``glued'' together with some additional variables, e.g., the modified KP hierarchy. Another…