Related papers: Supplementary material for Markov equivalence for …

A graph $G$ has the $k$-strong parity property if for any $X\subseteq V(G)$ with $|X|$ even, $G$ contains a spanning subgraph $F$ with $d_F(u)\equiv1$ (mod 2) for each $u\in X$ and $d_F(v)\in\{k,k+2,k+4,\ldots\}$ for each $v\in…

Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a…

For Markov processes with absorption, we provide general criteria ensuring the existence and the exponential non-uniform convergence in total variation norm to a quasi-stationary distribution. We also characterize a subset of its domain of…

Let $V$ be a symmetric convex body in $\R^m$. We prove sharp Bernstein-type inequalities for entire functions of exponential type with the spectrum in $V$ and discuss certain properties of the extremal functions. Markov-type inequalities…

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

We investigate the possibility of proving upper bounds on Hadwiger's number of a graph with partial information, mirroring several known upper bounds for the chromatic number. For each such bound we determine whether the corresponding bound…

Improved rates of convergence for ergodic Markov chains and relaxed conditions for them, as well as analogous convergence results for some non-homogeneous Markov chains are studied. The setting from the previous works is extended. Examples…

This paper introduces two Gaussian graphical models defined on complete bipartite graphs. We show that the determinants of the precision matrices associated with the models are equal up to scale, where the scale factor only depends on model…

Let $a,b,n$ be three positive integers such that $a\equiv b\pmod 2$ and $n\geq b(a+b)(a+b+2)/(2a)$. Let $G$ be a graph of order $n$ with minimum degree at least $a+b/a-1$. We show that $G$ has an $(a,b)$-parity factor, if…

In the paper we prove that a quadratic stochastic process satisfies the ergodic principle if and only if the associated Markov process satisfies one.

Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a graph has Markov width at most four if and only if it…

We introduce a novel approach to description of networks/graphs. It is based on an analogue physical model which is dynamically evolved. This evolution depends on the connectivity matrix and readily brings out many qualitative features of…

For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its maximal element and its minimal element. In this…

Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…

We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of…

We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative…

We give a new and elementary proof that simultaneous similarity and simultaneous equivalence of families of matrices are invariant under extension of the ground field, a result which is non-trivial for finite fields and first appeared in a…

We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…

A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…