RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS

DOI10.1112/jlms/s2-30.1.171zbMath0514.60097OpenAlexW2152445934MaRDI QIDQ3660650

Geoffrey R. Grimmett, Harry Kesten

Publication date: 1984

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-30.1.171

zbMATH Keywords

critical valuebranching processrandom graphrandom electrical network

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (12)

Level-set percolation for the Gaussian free field on a transient tree ⋮ Anomalous electrical and frictionless flow conductance in complex networks ⋮ Resistance growth of branching random networks ⋮ Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure ⋮ Random walk on barely supercritical branching random walk ⋮ Weak disorder in the stochastic mean-field model of distance. II ⋮ Dimensions of random trees. ⋮ Potential distribution on random electrical networks ⋮ Random walks on the random graph ⋮ Unnamed Item ⋮ The speed of the tagged particle in the exclusion process on Galton-Watson trees ⋮ Functional central limit theorem for a random walk in a random environment

This page was built for publication: RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS