Rigorous results on the threshold network model

Simple item page
dc.creatorKonno, Norio
dc.creatorMasuda, Naoki
dc.creatorRoy, Rahul
dc.creatorSarkar, Anish
dc.date2005-05-31
dc.date.accessioned2026-07-07T06:27:29Z
dc.date.available2026-07-07T06:27:29Z
dc.descriptionWe analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the vertex degree, degree correlation, and the number of prescribed subgraphs. We also generalize some results in the spatially extended cases.
dc.description21 pages, Journal of Physics A, in press
dc.identifierhttps://arxiv.org/abs/math/0505681
dc.identifierhttp://arxiv.org/abs/math/0505681
dc.identifierJ. Phys. A, 38, 6277-6291 (2005)
dc.identifierdoi:10.1088/0305-4470/38/28/002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/97428
dc.subjectProbability
dc.subjectDisordered Systems and Neural Networks
dc.titleRigorous results on the threshold network model
dc.typetext

Files

Collections

arXiv