相关论文: On Kemeny's constant and stochastic complement
Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…
We analyze the exponential stability of distributed parameter systems. The system we consider is described by a coupled parabolic partial differential equation with spatially varying coefficients. We approximate the coefficients by…
We consider stochastic differential equations, obtained by adding weak Gaussian white noise to ordinary differential equations admitting $N$ asymptotically stable periodic orbits. We construct a discrete-time, continuous-space Markov chain,…
Fundamental mathematical constants like $e$ and $\pi$ are ubiquitous in diverse fields of science, from abstract mathematics to physics, biology and chemistry. For centuries, new formulas relating fundamental constants have been scarce and…
We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
Komjath studied the list chromatic number of infinite graphs and introduced the notion of restricted list chromatic number. For a graph $X=(V_X,E_X)$ and a cardinal $\kappa$, we say that $X$ is restricted list colorable for $\kappa$ if for…
We study the distributed computing setting in which there are multiple servers, each holding a set of points, who wish to compute functions on the union of their point sets. A key task in this setting is Principal Component Analysis (PCA),…
A randomly perturbed graph $G^p = G_\alpha \cup G(n,p)$ is obtained by taking a deterministic $n$-vertex graph $G_\alpha = (V, E)$ with minimum degree $\delta(G)\geq \alpha n$ and adding the edges of the binomial random graph $G(n,p)$…
We investigate mixed eigenstates in systems with sharply-divided phase space, using different piecewise-linear maps whose regular-chaotic boundaries are formed by marginally unstable periodic orbits (MUPOs) or by quasi-periodic orbits. With…
We introduce a kind of "perturbation" for the Li-Keiper coefficients around the Koebe function (the K function) and establish a closed system of Equations for the Li-Keiper coefficients. We then check the correctness of some of the many…
We study PCA as a stochastic optimization problem and propose a novel stochastic approximation algorithm which we refer to as "Matrix Stochastic Gradient" (MSG), as well as a practical variant, Capped MSG. We study the method both…
Let H be a positive semidefinite matrix partitioned into Hermitian blocks. Then, up to a direct sum operation, H is the average of matrices isometrically congruent to its partial trace. A few corollaries are given, related to important…
This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct - only using the graph structure of the Markov chain and…
This letter explores how a reinterpretation of the generalized uncertainty principle as an effective variation of Planck's constant provides a physical explanation for a number of fundamental quantities and couplings. In this context, a…
The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…
In this paper, we prove that the kappa distribution is the stationary solution of the Vlasov-Poisson system in an inhomogeneous plasma under the polytropic equation of state and an assumption restricting the local velocity distribution to a…
We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
A new kinetic theory Boltzmann-like collision term including correlations is proposed. In equilibrium it yields the one-particle distribution function in the form of a generalised-Lorentzian resembling but not being identical with the…