Inference in balanced community modulated recursive trees
DOI10.3150/24-BEJ1735MaRDI QIDQ6632613
Anna Ben-Hamou, Vasiliki Velona
Publication date: 5 November 2024
Published in: Bernoulli (Search for Journal in Brave)
clusteringWiener indexcommunity detectionrandom recursive treesparameter testingcombinatorial statisticscommunity modulated recursive treesminimum fair bisection
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scaling limits and influence of the seed graph in preferential attachment trees
- Reconstruction and estimation in the planted partition model
- An Efron-Stein inequality for nonsymmetric statistics
- The jackknife estimate of variance
- Information flow on trees
- A proof of the block model threshold conjecture
- Broadcasting on random recursive trees
- Correlated randomly growing graphs
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- Discrete minimax estimation with trees
- From trees to seeds: on the inference of the seed from large trees in the uniform attachment model
- Basic models and questions in statistical network analysis
- Consistent estimation in general sublinear preferential attachment trees
- Complexity results on restricted instances of a paint shop problem for words
- Distribution of nodes of a tree by degree
- Finding the seed of uniform attachment trees
- Random graphs and complex networks. Volume 1
- Finding Adam in random growing trees
- Random Trees
- Asymptotic degree distribution in random recursive trees
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Inference on the History of a Randomly Growing Tree
- Community Recovery in a Preferential Attachment Graph
- Community detection thresholds and the weak Ramanujan property
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Community modulated recursive trees and population dependent branching processes
- Degree centrality and root finding in growing random networks
- Archaeology of random recursive dags and Cooper-Frieze random networks
This page was built for publication: Inference in balanced community modulated recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632613)