The asymptotic rank of adjacency matrices of weighted configuration models over arbitrary fields
Preprint
Abstract
We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from an arbitrary field, as long as it is independent of the (multi-)graph. Our main result demonstrates that the asymptotic behavior of the normalized rank of the adjacency matrix neither depends on the fixed edge-weights, nor on which field they are chosen from. Our approach relies on a novel adaptation of the component exploration method of \cite{janson2009new}, which enables the application of combinatorial techniques from \cite{coja2022rank, HofMul25}.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- The rank of sparse symmetric matrices over arbitrary fieldsRandom Structures & Algorithms, 2024
- On the rank, Kernel, and core of sparse random graphsRandom Structures & Algorithms, 2024
- The Satisfiability Threshold For Random Linear EquationsCombinatorica, 2020
- Adjacency matrices of random digraphs: Singularity and anti-concentrationJournal of Mathematical Analysis and Applications, 2017
- On the singularity of adjacency matrices for random regular digraphsProbability Theory and Related Fields, 2015
- Introduction to Random Graphs2015
- Matchings on infinite graphsProbability Theory and Related Fields, 2012
- A new approach to the giant component problemRandom Structures & Algorithms, 2008
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980