Related papers: Gibbs conditioning principle for log-concave indep…
A lower bound on the probability $P(0<X<\delta)$ for all real $\delta>0$ and all random variables $X$ with log-concave p.d.f.'s such that $EX=0$ and $EX^2=1$ is obtained.
The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter…
We consider Glauber dynamics reversible with respect to Gibbs measures with heavy tails. Spins are unbounded. The interactions are bounded and finite range. The self potential enters into two classes of measures, $\kappa$-concave…
Gibbs statistical mechanics is derived for the Hamiltonian system coupling self-consistently a wave to N particles. This identifies Landau damping with a regime where a second order phase transition occurs. For nonequilibrium initial data…
We prove the following analogue of the classical Skitovich--Darmois theorem for complex random variables. Let $\alpha=a+ib$ be a nonzero complex number. Then the following statements hold. $1$. Let either $b\ne 0$, or $b=0$ and $a>0$. Let…
In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…
This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…
We consider testing marginal independence versus conditional independence in a trivariate Gaussian setting. The two models are non-nested and their intersection is a union of two marginal independences. We consider two sequences of such…
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…
For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the…
In this paper we study the conditional limit theorems for critical continuous-state branching processes with branching mechanism $\psi(\lambda)=\lambda^{1+\alpha}L(1/\lambda)$ where $\alpha\in [0,1]$ and $L$ is slowly varying at $\infty$.…
By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…
Let $X$ be a max-stable random vector with positive continuous density. It is proved that the conditional independence of any collection of disjoint sub-vectors of $X$ given the remaining components implies their joint independence. We…
In this paper we build on the work of \cite{kaber} where it was shown that the one-parameter family of Gegenbauer Polynomials (GP) exhibit a Gibbs Phenomenon at a jump discontinuity. We show that the one-parameter family of Generalized…
In this paper, we focus on studying non-probability Gibbs measures for a Hard Core (HC) model on a Cayley tree of order $k\geq 2$, where the set of integers $\mathbb Z$ is the set of spin values. It is well-known that each Gibbs measure,…
In this short note, we find an equivalent combinatorial condition only involving finite sums under which a centered Gaussian random vector with multinomial covariance matrix satisfies the Gaussian product inequality (GPI) conjecture. These…
Motivated by classical nontransitivity paradoxes, we call an $n$-tuple $(x_1,\dots,x_n) \in[0,1]^n$ \textit{cyclic} if there exist independent random variables $U_1,\dots, U_n$ with $P(U_i=U_j)=0$ for $i\not=j$ such that…
For point patterns observed in natura, spatial heterogeneity is more the rule than the exception. In numerous applications, this can be mathematically handled by the flexible class of log Gaussian Cox processes (LGCPs); in brief, a LGCP is…
The problem is sequence prediction in the following setting. A sequence x1,..., xn,... of discrete-valued observations is generated according to some unknown probabilistic law (measure) mu. After observing each outcome, it is required to…
We show that for any isotropic log-concave probability measure $\mu$ on $\mathbb R^n$, for every $\varepsilon > 0$, every $1 \leq k \leq \sqrt{n}$ and any $E \in G_{n,k}$ there exists $F \in G_{n,k}$ with $d(E,F) < \varepsilon$ and…