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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
G
Google Developers Blog
B
Blog RSS Feed
A
About on SuperTechFans
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
V2EX
Stack Overflow Blog
Stack Overflow Blog
C
Check Point Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Engineering at Meta
Engineering at Meta
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 司徒正美
D
Docker
F
Fortinet All Blogs
Hugging Face - Blog
Hugging Face - Blog
Last Week in AI
Last Week in AI
H
Help Net Security
WordPress大学
WordPress大学
MyScale Blog
MyScale Blog
博客园 - Franky
人人都是产品经理
人人都是产品经理
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Blog — PlanetScale
Blog — PlanetScale
L
LangChain Blog

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}}$
Spectral large deviations of sparse random matrices
Shirshendu Ganguly, Ella Hiesmayr, Kyeongsik Nam · 2022-06-15 · via math.CO updates on arXiv.org

Eigenvalues of Wigner matrices has been a major topic of investigation. A particularly important subclass of such random matrices is formed by the adjacency matrix of an Erdős-Rényi graph $\mathcal{G}_{n,p}$ equipped with i.i.d. edge-weights. An observable of particular interest is the largest eigenvalue. In this paper, we study the large deviations behavior of the largest eigenvalue of such matrices, a topic that has received considerable attention over the years. We focus on the case $p = \frac{d}{n}$, where most known techniques break down. So far, results were known only for $\mathcal{G}_{n,\frac{d}{n}}$ without edge-weights (Krivelevich and Sudakov, '03), (Bhattacharya, Bhattacharya, and Ganguly, '21) and with Gaussian edge-weights (Ganguly and Nam, '21). In the present article, we consider the effect of general weight distributions. More specifically, we consider the entries whose tail probabilities decay at rate $e^{-t^α}$ with $α>0$, where the regimes $0<α<2$ and $α>2$ correspond to tails heavier and lighter than the Gaussian tail respectively. While in many natural settings the large deviations behavior is expected to depend crucially on the entry distribution, we establish a surprising and rare universal behavior showing that this is not the case when $α> 2.$ In contrast, in the $α< 2$ case, the large deviation rate function is no longer universal and is given by the solution to a variational problem, the description of which involves a generalization of the Motzkin-Straus theorem, a classical result from spectral graph theory. As a byproduct of our large deviation results, we also establish new law of large numbers results for the largest eigenvalue. In particular, we show that the typical value of the largest eigenvalue exhibits a phase transition at $α= 2$, i.e. the Gaussian distribution.