Alexander Soshnikov, Benny Sudakov
Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely λ_1(G)= (1+o(1)) max(Δ^{1/2}(G),np), where Δ(G) is the maximum degree of G and o(1) term tends to zero as max (Δ^{1/2}(G), np) tends to infinity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let $Q_{d,p}$ be the random subgraph of the $d$-dimensional hypercube $\{0,1\}^d$, where each edge is retained independently with probability $p$. We study the asymptotic number of independent sets in $Q_{d,p}$ as $d \to \infty$ for a wide range of parameters $p$, including values of $p$ tending to zero as fast as $\frac{C\log d}{d^{1/3}}$, constant values of $p$, and values of $p$ tending to one. The results extend to the hardcore model on $Q_{d,p}$, and are obtained by studying the closely related antiferromagnetic Ising model on the hypercube, which can be viewed as a positive-temperature h…
We consider a sparse random subraph of the $n$-cube where each edge appears independently with small probability $p(n) =O(n^{-1+o(1)})$. In the most interesting regime when $p(n)$ is not exponentially small we prove that the largest eigenvalue of the graph is asymtotically equal to the square root of the maximum degree.
It is well-known that the behaviour of a random subgraph of a $d$-dimensional hypercube, where we include each edge independently with probability $p$, undergoes a phase transition when $p$ is around $\frac{1}{d}$. More precisely, standard arguments show that just below this value of $p$ all components of this graph have order $O(d)$ with probability tending to one as $d \to \infty$ (whp for short), whereas Ajtai, Komlós and Szemerédi [Largest random component of a $k$-cube, Combinatorica 2 (1982), no. 1, 1--7; MR0671140] showed that just above this value, in the supercritical regime, whp ther…
Climbing up a random subgraph of the hypercube
本文研究随机边保留超立方体中的最长递增路径，证明其长度在 $p=e/d$ 处发生相变：亚临界时线性短于 $d$，超临界时至少为 $d-2$。
Nearly spanning cycle in the percolated hypercube
本文研究渗流超立方体随机子图，证明当边保留概率 p≥C/d 时，以高概率存在长度至少为 (1-ε)2^d 的近生成圈，从而证实了一个长期未决的民间猜想。
We study bond percolation on the Hamming hypercube {0,1}^m around the critical probability p_c. It is known that if p=p_c(1+O(2^{-m/3})), then with high probability the largest connected component C_1 is of size Theta(2^{2m/3}) and that this quantity is non-concentrated. Here we show that for any sequence eps_m such that eps_m=o(1) but eps_m >> 2^{-m/3} percolation on the hypercube at p_c(1+eps_m) has |C_1| = (2+o(1)) eps_m 2^m and |C_2| = o(eps_m 2^m) with high probability, where C_2 is the second largest component. This resolves a conjecture of Borgs, Chayes, the first author, Slade and Spen…
We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter. We establish that with high probability the largest component has cardinality $Θ\left(\varepsilon_m^{-2} \log(\varepsilon_m^3 2^m)\right)$, that the maximal diameter of all clusters is $(1+o(1)) \varepsilon_m^{-1} \log(\varepsilon_m^3 2^m)$, and that the maximal mixing time of all clusters is $Θ\left(\varepsilon_m^{-3} \log^2(\varepsilon_m^3 2^m)\right)$. The…
The generation of a random triangle-saturated graph via the triangle-free process has been studied extensively. In this short note our aim is to introduce an analogous process in the hypercube. Specifically, we consider the $Q_2$-free process in $Q_d$ and the random subgraph of $Q_d$ it generates. Our main result is that with high probability the graph resulting from this process has at least $cd^{2/3} 2^d$ edges. We also discuss a heuristic argument based on the differential equations method which suggests a stronger conjecture, and discuss the issues with making this rigorous. We conclude wi…
Cycle lengths in the percolated hypercube
研究渗流超立方体中圈的存在性，证明在边概率足够大时，随机子图包含所有从4到接近最大可能长度的偶数圈，加强了先前仅保证存在一个长圈的结果。
We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size planar matching (set of non--crossing disjoint edges) and maximum size planar subgraph (set of non--crossing edges which may share endpoints)? The problem is a generalization of the Longest Increasing Sequence (LIS) problem (also called Ulam's problem). We present combinatorial identities which relate the number of $r$-regular bipartite multi--graphs with maximum planar matching (maximum planar subgraph)of at most $…
For the Erdős-Rényi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t = t(n) is not too large. In the case of fixed t and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. This generalises a result on the independence number of random graphs. For both the upper and lower bounds, we rely on large deviations inequalities for the binomial distribution.
The largest subgraph without a forbidden induced subgraph
本文研究在边密度受限的图中不含禁用导出二部图的最大子图边数，针对稠密随机图和Paley图在常数因子内确定答案，并应用于遗传性质子图与字符串子图问题。
We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size planar matching (set of non--crossing disjoint edges) and maximum size planar subgraph (set of non--crossing edges which may share endpoints)? The problem is a generalization of the Longest Increasing Sequence (LIS) problem (also called Ulam's problem). We present combinatorial identities which relate the number of r-regular bipartite multi--graphs with maximum planar matching (maximum planar subgraph) of at most d …
An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on n vertices, i.e., in a binomial random graph G(n,1/2). We prove that with high probability a largest induced regular subgraph of G(n,1/2) has about n^{2/3} vertices.
We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs et al., Random subgraphs of finite graphs: I. The scaling window under the triangle condition, Rand. Struct. Alg. (2005), and in Borgs et al., Random subgraphs of finite graphs: II. The lace expansion and the triangle condition, Ann. Probab. (2005), the size of the largest connected component was estimated precisely for a large class of graphs including H(2…
The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability $p$, so that the average degree $2(n-1)p=1+ε$. Previous work by van der Hofstad and Luczak had shown that in the barely supercritical region $n^{-2/3}\ln^{1/3}n\ll ε\ll 1$ the largest component has size $\sim 2εn$. Here we show that the second largest component has size close to $ε^{-2}$, so that the dominant component has emerged. This result also suggests th…
Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
本文研究了随机子图$G_p$的性质，证明了对于$d$-regular图，当$p\ge \frac{C}{d}$时存在覆盖几乎全部顶点的匹配，且对广泛图族（含超立方体），当$p\ge \frac{\log^5d}{d}$时包含度数集中于$dp$的导出子图。
In this paper we study random induced subgraphs of the binary $n$-cube, $Q_2^n$. This random graph is obtained by selecting each $Q_2^n$-vertex with independent probability $λ_n$. Using a novel construction of subcomponents we study the largest component for $λ_n=\frac{1+χ_n}{n}$, where $ε\ge χ_n\ge n^{-{1/3}+ δ}$, $δ>0$. We prove that there exists a.s. a unique largest component $C_n^{(1)}$. We furthermore show that $χ_n=ε$, $| C_n^{(1)}|\sim α(ε) \frac{1+χ_n}{n} 2^n$ and for $o(1)=χ_n\ge n^{-{1/3}+δ}$, $| C_n^{(1)}| \sim 2 χ_n \frac{1+χ_n}{n} 2^n$ holds. This improves the result of \cite{Bol…
The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus the threshold for the appearance of a $k$-regular subgraph of a random graph is at most the threshold for the $(k+2)$-core. In particular, this pins down the point of appearance of a $k$-regular subgraph in $\G(n,p)$ to a window for $p$ of width roughly $2/n$ for large $n$ and moderately large $k$.
Perfect Matching in Product Graphs and in their Random Subgraphs
研究笛卡尔积图及其随机子图中的完美匹配问题，证明当维度t≥2lnM时，t维笛卡尔积图存在（近）完美匹配且该维度界紧至常数因子，还推广了Bollobás关于二元超立方体的结果，得出随机图过程中最小度1、连通性及（近）完美匹配存在的击中时间一致。
In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations with independent probability, $λ_n$. Our main result is that for any minimal generating set of transpositions, for probabilities $λ_n=\frac{1+ε_n}{n-1}$ where $n^{-{1/3}+δ}\le ε_n<1$ and $δ>0$, a random induced subgraph has a.s. a unique largest component of size $\wp(ε_n)\frac{1+ε_n}{n-1}n!$, where $\wp(ε_n)$ is the survival probability of a specific branchi…
The d-dimensional Hamming torus is the graph whose vertices are all of the integer points inside an a_1 n X a_2 n X ... X a_d n box in R^d (for constants a_1, ..., a_d > 0), and whose edges connect all vertices within Hamming distance one. We study the size of the largest connected component of the subgraph generated by independently removing each vertex of the Hamming torus with probability 1-p. We show that if p=λ/ n, then there exists λ_c > 0, which is the positive root of a degree d polynomial whose coefficients depend on a_1, ..., a_d, such that for λ< λ_c the largest component has O(log …
We study random subgraphs of the $n$-cube $\{0,1\}^n$, where nearest-neighbor edges are occupied with probability $p$. Let $p_c(n)$ be the value of $p$ for which the expected cluster size of a fixed vertex attains the value $λ2^{n/3}$, where $λ$ is a small positive constant. Let $ε=n(p-p_c(n))$. In two previous papers, we showed that the largest cluster inside a scaling window given by $|ε|=Θ(2^{-n/3})$ is of size $Θ(2^{2n/3})$, below this scaling window it is at most $2(\log2) nε^{-2}$, and above this scaling window it is at most $O(ε2^n)$. In this paper, we prove that for $p - p_c(n) \geq e^…
We consider the parabolic Anderson model $\frac{\partial}{\partial t} v_n=κΔ_n v_n + ξ_n v_n$ on the $n$-dimensional hypercube $\{-1,+1\}^n$ with random i.i.d. potential $ξ_n$. We parametrize time by volume and study $v_n$ at the location of the $k$-th largest potential, $x_{k,2^n}$. Our main result is that, for a certain class of potential distributions, the solution exhibits a phase transition: for short time scales $v_n(t_n,x_{k,2^n})$ behaves like a system without diffusion and grows as $\exp\big\{(ξ_n(x_{k,2^n}) - κ)t_n\big\}$, whereas, for long time scales the growth is dictated by the p…
Decoupling of clusters in independent sets in a percolated hypercube
本文研究边渗流超立方体中独立集的团簇行为，通过引入新的概率框架，对所有p>0.465的情形给出了独立集数量的高概率精确近似和采样算法，并表明p=1/2并非该问题的自然相变障碍。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。