Asymptotic behavior of two-terminal series-parallel networks
| dc.creator | Golinelli, O. | |
| dc.date | 1997-07-02 | |
| dc.date.accessioned | 2026-07-07T09:11:53Z | |
| dc.date.available | 2026-07-07T09:11:53Z | |
| dc.description | This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied probability theory as a model for real networks. The number of networks grows asymptotically like R^n/n^alpha, as for some models of statistical physics like self-avoiding walks, lattice animals, meanders, etc. By using a exact recurrence relation, the entropy is numerically estimated at R = 3.5608393095389433(1), and we show that the sub-leading universal exponent alpha is 3/2. | |
| dc.description | 9 pages, revtex, 18 eps figures (uses epsf) | |
| dc.identifier | https://arxiv.org/abs/cond-mat/9707023 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/9707023 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151838 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Asymptotic behavior of two-terminal series-parallel networks | |
| dc.type | text |