RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS

DOI10.1112/JLMS/S2-30.1.171MaRDI QIDQ3660650zbMATH OpenOpenAlexFDO

Authors G. 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

branching processcritical valuerandom electrical networkrandom graph

Mathematics Subject Classification ID

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

Cited in

(14)

• Functional central limit theorem for a random walk in a random environment
• Dimensions of random trees.
• Level-set percolation for the Gaussian free field on a transient tree
• Resistance growth of branching random networks
• Random walks on the random graph
• Weak disorder in the stochastic mean-field model of distance. II
• Random walk on barely supercritical branching random walk
• scientific article; zbMATH DE number 3903724 (Why is no real title available?)
• Potential distribution on random electrical networks
• Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
• Phase transition of disordered random networks on quasi-transitive graphs
• On the return probability of the simple random walk on Galton-Watson trees
• The speed of the tagged particle in the exclusion process on Galton-Watson trees
• Anomalous electrical and frictionless flow conductance in complex networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3660650)