Shape Measures of Random Increasing k-trees

DOI10.1017/S0963548316000018zbMath1372.60009OpenAlexW2244603106MaRDI QIDQ5366914

Michèle Soria, Hsien-Kuei Hwang, Alexis Darrasse

Publication date: 10 October 2017

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

Full work available at URL: https://doi.org/10.1017/s0963548316000018

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Martingales and profile of binary search trees
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• The degree distribution of random \(k\)-trees
• Some families of increasing planar maps
• On a connection between the existence of k-trees and the toughness of a graph
• Depth-first K-trees and critical path analysis
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• Stronger \(K\)-tree relaxations for the vehicle routing problem
• On monotone functions of tree structures
• Transitional behaviors of the average cost of quicksort with median-of-\((2t+1)\)
• On simple characterizations of k-trees
• Asymptotic expansions for the Stirling numbers of the first kind
• Complex networks: structure and dynamics
• Long and short paths in uniform random recursive dags
• A functional limit theorem for the profile of search trees
• Detection, understanding, and prevention of traceroute measurement artifacts
• An improved approximation algorithm for multicast \(k\)-tree routing
• The degree sequence of a scale-free random graph process
• Phase changes in randomm-ary search trees and generalized quicksort
• On Certain Properties of Random Apollonian Networks
• Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model
• Emergence of Scaling in Random Networks
• High-dimensional Apollonian networks
• Profiles of random trees: Plane-oriented recursive trees
• Singularity Analysis of Generating Functions
• Random Trees
• Profiles of Tries
• Limiting Distribution for Distances in k-Trees
• Complexity of Finding Embeddings in a k-Tree
• On the Altitude of Nodes in Random Trees
• On the Expected Depth of Random Circuits
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• On the profile of random trees
• The Structure and Function of Complex Networks
• The Ideal Determined by the Unsymmetric Game
• On the structure of random plane‐oriented recursive trees and their branches
• An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
• The connectivity-profile of random increasing k-trees
• Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
• The number of labeled k-dimensional trees
• On the Number of Plane 2-Trees

This page was built for publication: Shape Measures of Random Increasing k-trees