Comparing Graphs of Different Sizes

DOI10.1017/S096354831700013XzbMath1371.05065arXiv1602.06995OpenAlexW2963097342MaRDI QIDQ5366968

Russell Lyons

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.06995

zbMATH Keywords

independent setsspanning treesreturn probabilities of random walks

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random walks on graphs (05C81)

Related Items (2)

Monotonicity for continuous-time random walks ⋮ Monotonicity of average return probabilities for random walks in random environments

Cites Work

• Unnamed Item
• Unnamed Item
• On symmetric random walks with random conductances on \(\mathbb Z^d\)
• Jensen's inequality for spectral order and submajorization
• Some intersection theorems for ordered sets and graphs
• Return probabilities of a simple random walk on percolation clusters
• Über monotone Matrixfunktionen
• Processes on unimodular random networks
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• Identities and Inequalities for Tree Entropy
• Building uniformly random subtrees
• Unimodular random trees
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Comparing Graphs of Different Sizes