Models of random subtrees of a graph (Q6183888)

scientific article; zbMATH DE number 7783642

Language	Label	Description	Also known as
English	Models of random subtrees of a graph	scientific article; zbMATH DE number 7783642

Statements

instance of

scholarly article

0 references

title

Models of random subtrees of a graph (English)

0 references

author

Luis Fredes

0 references

Jean-François Marckert

0 references

published in

Probability Surveys

0 references

publication date

4 January 2024

0 references

full work available at URL

https://arxiv.org/abs/2102.12738

0 references

https://projecteuclid.org/journals/probability-surveys/volume-20/issue-none/Models-of-random-subtrees-of-a-graph/10.1214/23-PS22.full

0 references

zbMATH Keywords

random trees

0 references

lattice trees

0 references

spanning trees

0 references

diffusion limited aggregation

0 references

minimal spanning tree

0 references

random generation

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The continuum limit of critical random graphs

0 references

The scaling limit of the minimum spanning tree of the complete graph

0 references

Cutting down trees with a Markov chainsaw

0 references

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

0 references

Asymptotic fringe distributions for general families of random trees

0 references

The standard additive coalescent

0 references

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs

0 references

50 Years of First-Passage Percolation

0 references

Uniform spanning forests

0 references

On the edge capacitated Steiner tree problem

0 references

A characterization of the Tutte polynomial via combinatorial embeddings

0 references

The cut-tree of large Galton-Watson trees and the Brownian CRT

0 references

Q5422499

0 references

Q3998372

0 references

The height of increasing trees

0 references

Asymptotics of trees with a prescribed degree sequence and applications

0 references

A new encoding of coalescent processes: applications to the additive and multiplicative cases

0 references

Reversing the cut tree of the Brownian continuum random tree

0 references

On the roots of the subtree polynomial

0 references

Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph

0 references

Historical lattice trees

0 references

On coding labeled trees

0 references

Matrix tree theorems

0 references

Phase transition for Parking blocks, Brownian excursion and coalescence

0 references

Parking functions, empirical processes, and the width of rooted labeled trees

0 references

Obtaining Optimalk-Cardinality Trees Fast

0 references

Subtrees of graphs

0 references

Unranking and ranking spanning trees of a graph

0 references

Two Algorithms for Unranking Arborescences

0 references

On the Length of a Random Minimum Spanning Tree

0 references

Q3651735

0 references

The scaling limit of lattice trees in high dimensions

0 references

Simulating Size-constrained Galton–Watson Trees

0 references

Q4694085

0 references

Boltzmann Samplers for the Random Generation of Combinatorial Structures

0 references

Q4789939

0 references

Sampling random spanning trees faster than matrix multiplication

0 references

Doob-Martin boundary of Rémy's tree growth chain

0 references

Tree-decorated planar maps

0 references

On the value of a random minimum spanning tree problem

0 references

The scaling limits of the minimal spanning tree and invasion percolation in the plane

0 references

On the History of the Minimum Spanning Tree Problem

0 references

Random spanning tree

0 references

On the upper critical dimension of lattice trees and lattice animals

0 references

Convergence of lattice trees to super-Brownian motion above the critical dimension

0 references

Backbone scaling for critical lattice trees in high dimensions

0 references

Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees

0 references

Simulations of lattice animals and trees

0 references

A reverse Aldous-Broder algorithm

0 references

On the computational complexity of the Jones and Tutte polynomials

0 references

A nonlocal Monte Carlo algorithm for lattice trees

0 references

The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph

0 references

One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights

0 references

Random cutting and records in deterministic and random trees

0 references

Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation

0 references

Enumerations of lattice animals and trees

0 references

Logarithmic fluctuations for internal DLA

0 references

Internal DLA in higher dimensions

0 references

Internal DLA and the Gaussian free field

0 references

Counting trees in a graph is \(\# \text{P}\)-complete

0 references

Random generation of combinatorial structures from a uniform distribution

0 references

The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem

0 references

The Classification of Birth and Death Processes

0 references

Reducibility among Combinatorial Problems

0 references

Faster Generation of Random Spanning Trees

0 references

Subdiffusive behavior of random walk on a random cluster

0 references

On the shortest spanning subtree of a graph and the traveling salesman problem

0 references

Generating random combinatorial objects

0 references

Q4893743

0 references

Internal diffusion limited aggregation

0 references

Conformal invariance of planar loop-erased random walks and uniform spanning trees.

0 references

Building uniformly random subtrees

0 references

Probability on Trees and Networks

0 references

Off-critical lattice models and massive SLEs

0 references

Loop-erased random walks, spanning trees and Hamiltonian cycles

0 references

Q4451047

0 references

Growing random uniform \(d\)-ary trees

0 references

The depth first processes of Galton-Watson trees converge to the same Brownian excursion

0 references

Q3176602

0 references

A new combinatorial representation of the additive coalescent

0 references

Cutting down random trees

0 references

Locally guided randomized elections in trees: The totally fair case

0 references

Fast Generation of Random Spanning Trees and the Effective Resistance Metric

0 references

Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

0 references

Q5818007

0 references

The Multiplicative Process

0 references

Choosing a spanning tree for the integer lattice uniformly

0 references

Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.

0 references

Stationary harmonic measure and DLA in the upper half plane

0 references

Exact sampling with coupled Markov chains and applications to statistical mechanics

0 references

How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph

0 references

Q4208454

0 references

Q3679220

0 references

An almost-linear time algorithm for uniform random spanning tree generation

0 references

Scaling limits of loop-erased random walks and uniform spanning trees

0 references

Q5421712

0 references

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

0 references

The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.

0 references

On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees

0 references

A Contribution to the Theory of Chromatic Polynomials

0 references

Q4873703

0 references

Q3754627

0 references

On the probability that a random subtree is spanning

0 references

Q4704790

0 references

The Potts model and the Tutte polynomial

0 references

Q4228482

0 references

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

0 references

Enumeration of subtrees of trees

0 references

A combinatorial approach to matrix algebra

0 references

Solving the optimum communication spanning tree problem

0 references

Identifiers

zbMATH Open document ID

1527.60010

0 references

arXiv ID

2102.12738

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6183888