Tree and forest weights and their application to nonuniform random graphs

DOI10.1214/AOAP/1029962602zbMATH Open0930.05031OpenAlexW2068381506MaRDI QIDQ1296594FDOQ1296594

Brian D. Jones, Boris Pittel, Joseph Verducci

Publication date: 9 February 2000

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1029962602

zbMATH Keywords

spanning treeseigenvaluesMaxwell's rulespectral graphKirchhoff matrixrandom rooted forestsparse random graph modeltotal weighttree polynomialtree-weight function

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Graphs
• Theory of monomer-dimer systems
• The birth of the giant component
• Inequalities: theory of majorization and its applications
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• Matching behaviour is asymptotically normal
• Stirling Behavior is Asymptotically Normal
• A normal law for matchings
• On colouring random graphs
• Cliques in random graphs
• An upper bound for the number of spanning trees of a graph
• Poisson convergence and random graphs
• Exponential models for directional data
• A bound for the complexity of a simple graph
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• A combinatorial Laplacian with vertex weights
• Monotonicity of permanents of doubly stochastic matrices
• On tree census and the giant component in sparse random graphs
• Combinatorial Algebra and Random Graphs
• Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees

Cited In (6)

• Loop-erased partitioning via parametric spanning trees: monotonicities \& 1D-scaling
• Forest matrices around the Laplacian matrix
• A version of the random directed forest and its convergence to the Brownian web
• Weights of uniform spanning forests on nonunimodular transitive graphs
• On the total variation regularized estimator over a class of tree graphs
• Perfect sampling methods for random forests

This page was built for publication: Tree and forest weights and their application to nonuniform random graphs

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