Related papers: Uniqueness of Markov random fields with higher-ord…
For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings,…
Positive dependencies have been compared in the literature under rather strong assumptions such as equality of conditional distributions, exchangeability, or stationarity. We establish supermodular ordering results for distributions that…
Given a finite state space E, we build a universal dilation for all possible discrete time Markov chains on E, homogeneous or not: we introduce a second system (an ``environment'') and a deterministic invertible time-homogeneous global…
We consider germs of holomorphic vector fields with an isolated singularity at the origin $0\in\mathbb{C}^2$. We introduce a notion of stability, similar to "Lyapunov stability". For such a germ, called $L$-stable singularity, either the…
The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…
Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…
We explore in this paper sufficient conditions for the $H$-property to hold, with a particular focus on the so-called line graphons. A graphon is a symmetric, measurable function from the unit square $[0,1]^2$ to the closed interval…
We derive some key extremal features for $k$th order Markov chains that can be used to understand how the process moves between an extreme state and the body of the process. The chains are studied given that there is an exceedance of a…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established under simple conditions on the Laplace…
In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…
We extend Balser-Kostov method of studying summability properties of a singularly perturbed inhomogeneous linear system with regular singularity at origin to nonlinear systems of the form \varepsilon zf^{\prime} = F(\varepsilon,z,f) with F…
For a graph $G$ let $\gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$\mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a…
Let $G(k)=\int_0^1g(x)e^{kx}dx$, $g\in L^1(0,1)$. The main result of this paper is the following theorem. {\bf Theorem}. {\it If $\limsup_{k\to +\infty}|G(k)|<\infty$, then $g=0$. There exists $g\not\equiv 0$, $g\in L^1(0,1)$, such that…
A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\nu(\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\mathcal{H}$. A subset $D$ of vertices of $\mathcal{H}$ is a…
Given a function $f : A \to \mathbb{R}^n$ of a certain regularity defined on some open subset $A \subseteq \mathbb{R}^m$, it is a classical problem of analysis to investigate whether the function can be extended to all of $\mathbb{R}^m$ in…
An $r$-graph $G$ is a pair $(V,E)$ such that $V$ is a set and $E$ is a family of $r$-element subsets of $V$. The \emph{independence number} $\alpha(G)$ of $G$ is the size of a largest subset $I$ of $V$ such that no member of $E$ is a subset…
This paper investigates how the structure of the underlying graph influences the behavior of stochastic partial differential equations (SPDEs) on finite tree graphs, where each edge is driven by space-time white noise. We first introduce a…
We extend the circle of ideas from a previous paper on hypersurfaces to functions $f \colon (\mathbb C^n, 0) \to (\mathbb C^k, 0)$ with an isolated singularity in a stratified sense on an arbitrary, but fixed complex analytic germ $(X, 0)$.…
Ancestral graphs are a class of graphs that encode conditional independence relations arising in DAG models with latent and selection variables, corresponding to marginalization and conditioning. However, for any ancestral graph, there may…