Related papers: Uniqueness of Markov random fields with higher-ord…

We prove pathwise uniqueness for stochastic differential equations driven by non-degenerate symmetric $\alpha$-stable L\'evy processes with values in $\R^d$ having a bounded and $\beta$-H\"older continuous drift term. We assume $\beta > 1 -…

We begin an investigation of the action of pseudo-Anosov elements of $\mathrm{Out}(\mathbf{F}_{2})$ on the Markoff-type varieties \[ \mathbb{X}_{\kappa}:\:x^{2}+y^{2}+z^{2}=xyz+2+\kappa \] over finite fields $\mathbb{F}_{p}$ with $p$ prime.…

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

Inference of evolutionary trees and rates from biological sequences is commonly performed using continuous-time Markov models of character change. The Markov process evolves along an unknown tree while observations arise only from the tips…

Consider a finite graph $G=(V(G),E(G))$ and two continuous weight distributions $\omega$ and $\xi$, for which we only assume that $\xi$ is lower bounded. Next, independently draw weights $(w(e))_{e \in E(G)}$ with distribution $\omega$ on…

Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in $G=\left( V,E\right) $. Let $\xi(G)$ denote the size of the intersection of all maximum independent sets. It is known…

Recently, there has been significant interest in understanding the properties of Markov random fields (M.r.f.) defined on the independent sets of sparse graphs. When these M.r.f. are restricted to pairwise interactions (i.e. hardcore…

Let $\Omega$ be a Polish space with Borel $\sigma$-field $\mathcal{F}$ and countably generated sub $\sigma$-field $\mathcal{G}\subset\mathcal{F}$. Denote by $\mathcal{L}(\mathcal{F})$ the set of all bounded $\mathcal{F}$-upper semianalytic…

A fractional matching of a graph $G$ is a function $h: E(G) \to [0,1]$ such that $\sum_{e \in E_G(v)} h(e) \leq 1$ for every vertex $v \in V(G)$, where $E_G(v)$ is the set of edges incident to $v$. If $\sum_{e \in E_G(v)} h(e) = 1$ for all…

A graphon satisfies the $H$-property if graphs sampled from it contain a Hamiltonian decomposition almost surely, which in turn implies that the corresponding network topologies are, e.g., structurally stable and structurally ensemble…

We continue the study of $n$-dependent groups, fields and related structures, largely motivated by the conjecture that every $n$-dependent field is dependent. We provide evidence towards this conjecture by showing that every infinite…

Let $\mathcal G$ be the Cayley graph of a finitely generated, infinite group $\Gamma$. We show that $\Gamma$ has the Haagerup property if and only if for every $\alpha<1$, there is a $\Gamma$-invariant bond percolation $\mathbb P$ on…

Let $\Gamma$ be a sofic group, $\Sigma$ be a sofic approximation sequence of $\Gamma$ and $X$ be a $\Gamma$-subshift with nonnegative sofic topological entropy with respect to $\Sigma$. Further assume that $X$ is a shift of finite type, or…

The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…

We consider an infinite locally finite system (configuration) $\gamma$ of particles distributed over a Euclidean space $X$. Each particle located at $x\in X$ carries an internal parameter (mark, or ``spin'') $\sigma_{x}\in S=\mathbb{R}.$…

Let $\mathcal{F}$ be a collection of $r$-uniform hypergraphs, and let $0 < p < 1$. It is known that there exists $c = c(p,\mathcal{F})$ such that the probability of a random $r$-graph in $G(n,p)$ not containing an induced subgraph from…

In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…

Let $G=\{e^{tA}:t\in\mathbb{R}\}$ be a closed one-parameter subgroup of the general linear group of matrices of order $n$ acting on $\mathbb{R}^{n}$ by matrix-vector multiplications. We assume that all eigenvalues of $A$ are rationally…

Consider a Markov process $\{\Phi(t) : t\geq 0\}$ evolving on a Polish space ${\sf X}$. A version of the $f$-Norm Ergodic Theorem is obtained: Suppose that the process is $\psi$-irreducible and aperiodic. For a given function $f\colon{\sf…

Let $ S $ be a positivity preserving symmetric linear operator acting on bounded functions. The nonlinear equation $ -\frac{1}{m}=z+Sm $ with a parameter $ z $ in the complex upper half-plane $ \mathbb{H} $ has a unique solution $ m $ with…