Related papers: Independent sets in random subgraphs of the hyperc…
Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…
An independent set may not contain both a vertex and one of its neighbours. This basic fact makes the uniform distribution over independent sets rather special. We consider the hard-core model, an essential generalization of the uniform…
Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…
It is known that many different types of finite random subgraph models undergo quantitatively similar phase transitions around their percolation thresholds, and the proofs of these results rely on isoperimetric properties of the underlying…
Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…
In this first article of a multi-part series, we inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathbb{Z}$ and the…
We study the algorithmic task of finding a large independent set in a sparse Erd\H{o}s-R\'{e}nyi random graph with $n$ vertices and average degree $d$. The maximum independent set is known to have size $(2 \log d / d)n$ in the double limit…
The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…
In this paper, we study the basic problem of counting independent sets in a graph and, in particular, the problem of counting antichains in a finite poset, from an algebraic perspective. We show that neither independence polynomials of…
We introduce a new way to sample inhomogeneous random graphs designed to have a lot of flexibility in the assignment of the degree sequence and the individual edge probabilities while remaining tractable. To achieve this we run a Poisson…
In this paper we derive three new asymptotic models for an hyperbolic-hyperbolicelliptic system of PDEs describing the motion of a collision-free plasma in a magnetic field. The first of these models takes the form of a non-linear and…
In order to study the influence of quenched disorder on second-order phase transitions, high-temperature series expansions of the \sus and the free energy are obtained for the quenched bond-diluted Ising model in $d = 3$--5 dimensions. They…
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we…
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned…
Let (lambda_d)(p) be the p monomer-dimer entropy on the d-dimensional integer lattice Z^d, where p in [0,1] is the dimer density. We give upper and lower bounds for (lambda_d)(p) in terms of expressions involving (lambda_(d-1))(q). The…
In this paper, we consider an analog of the well-studied extremal problem for triangle-free subgraphs of graphs for uniform hypergraphs. A loose triangle is a hypergraph $T$ consisting of three edges $e,f$ and $g$ such that $|e \cap f| = |f…
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…
We present a brief survey of rigorous results on the asymptotic behavior of correlations between two local functions as the distance between their support diverges, concentrating on the Ising model on $\mathbb{Z}^d$ with finite-range…
The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…
We use an m-vicinity method to examine Ising models on hypercube lattices of high dimensions d>=3. This method is applicable for both short-range and long-range interactions. We introduce a small parameter, which determines whether the…