Asymptotic Enumeration of Spanning Trees
From MaRDI portal
Publication:5696361
DOI10.1017/S096354830500684XzbMath1076.05007arXivmath/0212165OpenAlexW2061309095WikidataQ105583884 ScholiaQ105583884MaRDI QIDQ5696361
Publication date: 18 October 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0212165
Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16)
Related Items
Partial cubes and Archimedean tilings, Enumeration of spanning trees on contact graphs of disk packings, Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models, Fuglede-Kadison determinants and sofic entropy, The local limit of the uniform spanning tree on dense graphs, Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics, Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs, Regularized Laplacian determinants of self-similar fractals, The spectrum and Laplacian spectrum of the dice lattice, A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI, On the phase transition in random simplicial complexes, Limits of dense graph sequences, Random enriched trees with applications to random graphs, Enumeration of spanning trees of 2-separable networks, Resistance distance distribution in large sparse random graphs, Evaluations of Tutte polynomials of regular graphs, The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs, New method for counting the number of spanning trees in a two-tree network, The triangular kagomé lattices revisited, Spanning trees on the Sierpinski gasket, Matchings on infinite graphs, Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network, The energy and spanning trees of the Aztec diamonds, Complexity of graphs generated by wheel graph and their asymptotic limits, On the spectral density function of the Laplacian of a graph, On the number of spanning trees in random regular graphs, Matchings on trees and the adjacency matrix: A determinantal viewpoint, Modeling spatial networks by contact graphs of disk packings, Limits of random tree-like discrete structures, Benjamini-Schramm continuity of root moments of graph polynomials, Random matrices with row constraints and eigenvalue distributions of graph Laplacians, SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS, Sparse expanders have negative curvature, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Geometrically and diagrammatically maximal knots, The number and degree distribution of spanning trees in the Tower of Hanoi graph, Enumeration of spanning trees in the sequence of Dürer graphs, Spanning tree bounds for grid graphs, Enumeration of spanning trees of graphs with rotational symmetry, Random Simplicial Complexes: Around the Phase Transition, Comparing Graphs of Different Sizes, COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS, Asymptotic behavior and distributional limits of preferential attachment graphs, The distribution of sandpile groups of random regular graphs, Limiting entropy of determinantal processes, Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component, Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: solving the Hofstadter-Sierpinski butterfly, The number of spanning trees in Apollonian networks, Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination, The number of spanning trees in self-similar graphs, Weak equivalence to Bernoulli shifts for some algebraic actions, Statistical Matching Theory, On the complexity group of stable curves, Some physical and chemical indices of clique-inserted lattices, Enumeration of spanning trees on Apollonian networks, Distribution of coefficients of rank polynomials for random sparse graphs, Left and right convergence of graphs with bounded degree, Identities and Inequalities for Tree Entropy, On limits of sparse random graphs, Relative entropy and the Pinsker product formula for sofic groups, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Limits of random trees, The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, The asymptotic number of spanning trees in circulant graphs, Full groups and soficity, Uniqueness of maximal entropy measure on essential spanning forests, Harmonic models and spanning forests of residually finite groups, Potts model partition functions on two families of fractal lattices, Matchings in Benjamini–Schramm convergent graph sequences, Sparse graphs: Metrics and random models, Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao, Non-abelian free group actions: Markov processes, the Abramov–Rohlin formula and Yuzvinskii’s formula, Examples of homological torsion and volume growth, The enumeration of spanning tree of weighted graphs, Lehmer's question, graph complexity growth and links, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, A new class of the planar networks with high clustering and high entropy, Graph limits of random graphs from a subset of connected k‐trees, Topological properties of a 3-regular small world network, Number of spanning trees in the sequence of some graphs, The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set, Counting spanning trees in self-similar networks by evaluating determinants, Spanning trees and dimer problem on the Cairo pentagonal lattice, Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\), Weighted enumeration of spanning subgraphs in locally tree-like graphs, Limits of random trees. II, Entropy, determinants, and $L^2$-torsion, Ground states for exponential random graphs, Distributed computation in dynamic networks via random walks, On local weak limit and subgraph counts for sparse random graphs, The formulas for the number of spanning trees in circulant graphs, Spanning trees in random series-parallel graphs, Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L, The densest subgraph problem in sparse random graphs, The average number of spanning trees in sparse graphs with given degrees
