Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Dionigi, Pierfrancesco"'
We analyse the largest eigenvalue of the adjacency matrix of the configuration model with large degrees, where the latter are treated as hard constraints. In particular, we compute the expectation of the largest eigenvalue for degrees that diverge as
Externí odkaz:
http://arxiv.org/abs/2312.07812
Autor:
Dionigi, Pierfrancesco, Garlaschelli, Diego, Hazra, Rajat Subhra, Hollander, Frank den, Mandjes, Michel
Publikováno v:
Journal of Physics: Complexity 4:1, 015008 (2023)
A Chung-Lu random graph is an inhomogeneous Erd\H{o}s-R\'enyi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees,
Externí odkaz:
http://arxiv.org/abs/2207.03531
Publikováno v:
Electron. Commun. Probab. 26: 1-15 (2021)
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft constraint"). It
Externí odkaz:
http://arxiv.org/abs/2009.05155
Publikováno v:
Electronic Communications in Probability, 26, 1-15. INST MATHEMATICAL STATISTICS-IMS
Electronic Communications in Probability, 26:67. Institute of Mathematical Statistics
Electronic Communications in Probability, 26:67. Institute of Mathematical Statistics
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft constraint"). It