惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

罗磊的独立博客
I
InfoQ
雷峰网
雷峰网
Hugging Face - Blog
Hugging Face - Blog
IT之家
IT之家
云风的 BLOG
云风的 BLOG
有赞技术团队
有赞技术团队
Martin Fowler
Martin Fowler
MyScale Blog
MyScale Blog
The GitHub Blog
The GitHub Blog
博客园_首页
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
G
Google Developers Blog
WordPress大学
WordPress大学
B
Blog
人人都是产品经理
人人都是产品经理
小众软件
小众软件
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
量子位
Apple Machine Learning Research
Apple Machine Learning Research
N
Netflix TechBlog - Medium
Last Week in AI
Last Week in AI
博客园 - 聂微东
Jina AI
Jina AI

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Upper tail of the spectral radius of sparse Erdős-Rényi g...
Anirban Basak · 2021-09-14 · via math.CO updates on arXiv.org

We consider an Erdős-Rényi graph $\mathbb{G}(n,p)$ on $n$ vertices with edge probability $p$ such that \[ \sqrt{\frac{\log n}{\log \log n}} \ll np \le n^{1/2-o(1)}, \label{eq:abs} \tag{$\dagger$} \] and derive the upper tail large deviations of $λ(\mathbb{G}(n,p))$, the largest eigenvalue of its adjacency matrix. Within this regime we show that, for $p \gg n^{-2/3}$ the $\log$-probability of the upper tail event of $λ(\mathbb{G}(n,p))$ equals to that of planting a clique of an appropriate size (upon ignoring smaller order terms), while for $p \ll n^{-2/3}$ the same is given by that of the existence of a high degree vertex. This, in particular, shows an emergence of {\em non-planted localized structure} in the latter regime. We also confirm that in the entire regime \eqref{eq:abs} the large deviation probability is asymptotically approximated by the solution of the mean-field variational problem, and further identify the typical structure of $\mathbb{G}(n,p)$ conditioned on the upper tail event of $λ(\mathbb{G}(n,p))$ in a certain sub-regime of $p$. For $p$ such that $\log(np) \gtrsim \log n$ the large deviations of $λ(\mathbb{G}(n,p))$ is deduced from those of ${\rm Hom}(C_{2t}, \mathbb{G}(n,p))$, the homomorphism counts of cycle of length $2t$, for $t \ge 3$ and $p$ such that $n^{1/2-o(1)} \ge np \gg n^{1/t}$. In this latter regime the typical structure of $\mathbb{G}(n,p)$ conditioned on the upper tail of ${\rm Hom}(C_{2t}, \mathbb{G}(n,p))$ is identified and asymptotic tightness of the mean-field approximation is also established.