相关论文: Correlation bound for distant parts of factor of I…

Let $G$ be a large-girth $d$-regular graph and $\mu$ be a random process on the vertices of $G$ produced by a randomized local algorithm. We prove the upper bound $(k+1-2k/d)\Bigl(\frac{1}{\sqrt{d-1}}\Bigr)^k$ for the (absolute value of…

We study invariant percolation processes on the d-regular tree that are obtained as a factor of an iid process. We show that the density of any factor of iid site percolation process with finite clusters is asymptotically at most (log d)/d…

We study isomorphism invariant point processes of $\mathbb{R}^d$ whose groups of symmetries are almost surely trivial. We define a 1-ended, locally finite tree factor on the points of the process, that is, a mapping of the point…

Given an iid sequence of pairs of stochastic processes on the unit interval we construct a measure of independence for the components of the pairs. We define distance covariance and distance correlation based on approximations of the…

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

In this paper, we show that every $(3k-3)$-edge-connected graph $G$, under a certain condition on whose degrees, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_G(v)/k|< 1$,…

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the…

We prove that a measure on $[-d, d]$ is the spectral measure of a factor of i.i.d. process on a vertex-transitive infinite graph if and only if it is absolutely continuous with respect to the spectral measure of the graph. Moreover, we show…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

A $[k,n,1]$-graph is a $k$-partite graph with parts of order $n$ such that the bipartite graph induced by any pair of parts is a matching. An independent transversal in such a graph is an independent set that intersects each part in a…

This paper is concerned with certain invariant random processes (called factors of IID) on infinite trees. Given such a process, one can assign entropies to different finite subgraphs of the tree. There are linear inequalities between these…

Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension $d$ at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., an equivariant measurable function of…

Given integers $r>d\ge 0$ and an $r$-partite graph, an independent $(r-d)$-transversal or $(r-d)$-IT is an independent set of size $r-d$ that intersects each part in at most one vertex. We show that every $r$-partite graph with maximum…

A leaf matching operation on a graph consists of removing a vertex of degree~$1$ together with its neighbour from the graph. For $k\geq 0$, let $G$ be a $d$-regular cyclically $(d-1+2k)$-edge-connected graph of even order. We prove that for…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…

The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…

In this paper, we show that every highly edge-connected graph $G$, under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$ with $1\le i\le k$,…