相关论文: Independent sets in random subgraphs of the hyperc…

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq2.$ For $p>N$ and $1\leq q(p)<\infty$ set \[ \lambda_{p,q(p)}:=\inf\left\{ \int_{\Omega}\left\vert \nabla u\right\vert ^{p}\mathrm{d}x:u\in W_{0}^{1,p}(\Omega)\text{ \ and…

The paper deals with the study of rate-induced tipping in asymptotically autonomous scalar ordinary differential equations. We prove that, in such a tipping scenario, a solution which limits at a hyperbolic stable equilibrium of the past…

We establish central and local limit theorems for the number of vertices in the largest component of a random $d$-uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, where $(d-1)^{-1}+\eps<c<\infty$. The proof relies on a new,…

In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…

Let $Q^d$ be the $d$-dimensional binary hypercube. We say that $P=\{v_1,\ldots, v_k\}$ is an increasing path of length $k-1$ in $Q^d$, if for every $i\in [k-1]$ the edge $v_iv_{i+1}$ is obtained by switching some zero coordinate in $v_i$ to…

Let $Q_d$ be the $d$-dimensional hypercube and $N=2^d$. We prove that the number of (proper) 4-colorings of $Q_d$ is asymptotically \[6e2^N,\] as was conjectured by Engbers and Galvin in 2012. The proof uses a combination of information…

This article is concerned with the asymptotic behavior of certain sequences of ideals in rings of prime characteristic. These sequences, which we call $p$-families of ideals, are ubiquitous in prime characteristic commutative algebra (e.g.,…

Let $Q$ be an $s$-vertex $r$-uniform hypergraph, and let $H$ be an $n$-vertex $r$-uniform hypergraph. Denote by $\mathcal{N}(Q,H)$ the number of isomorphic copies of $Q$ in $H$. For a hereditary family $\mathcal{P}$ of $r$-uniform…

In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…

Elements $f$ of finite order in the isometry group of hyperbolic three-space $\IH^3$ have a hyperbolic line as a fixed point set, this line is the axis of $f$. The possible hyperbolic distances between axes of elements of order $p$ and $q$,…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We recently introduced a robust approach to the derivation of sharp asymptotic formula for correlation functions of statistical mechanics models in the high-temperature regime. We describe its application to the nonperturbative proof of…

We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…

We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution…

We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…

We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with…

We consider the algorithmic problem of finding large \textit{balanced} independent sets in sparse random bipartite graphs, and more generally the problem of finding independent sets with specified proportions of vertices on each side of the…

We consider Glauber dynamics for the low-temperature, ferromagnetic Ising Model set on the n-dimensional hypercube. We derive precise asymptotic results for the crossover time (the time it takes for the dynamics to go from the configuration…

Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to IQP circuits, which have applications in quantum…

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…