Image de couverture de livre

Estimating the history of a random recursive tree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Briend, Simon, Giraud, Christophe, Lugosi, Gábor, Sulem, Déborah
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Broadcasting in random recursive dags
par: Briend, Simon, et autres
Publié: (2023)

On the quality of randomized approximations of Tukey's depth
par: Briend, Simon, et autres
Publié: (2023)

Inductive inference of gradient-boosted decision trees on graphs for insurance fraud detection
par: Vandervorst, Félix, et autres
Publié: (2025)

Embedding networks with the random walk first return time distribution
par: Thapar, Vedanta, et autres
Publié: (2025)

Leaf Stripping on Uniform Attachment Trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Detecting LGBTQ+ Instances of Cyberbullying
par: Arslan, Muhammad, et autres
Publié: (2024)

Estimating mixed memberships in multi-layer networks
par: Qing, Huan
Publié: (2024)

Influence Strength Estimation in Hyperbolic Space for Social Influence Maximization
par: Qiao, Hongliang, et autres
Publié: (2025)

Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs
par: Zhu, Alan, et autres
Publié: (2025)

Uncertainty Estimation for Heterophilic Graphs Through the Lens of Information Theory
par: Fuchsgruber, Dominik, et autres
Publié: (2025)

Communication-Constrained Private Decentralized Online Personalized Mean Estimation
par: Yakimenka, Yauhen, et autres
Publié: (2025)

Scalable Continuous-time Diffusion Framework for Network Inference and Influence Estimation
par: Huang, Keke, et autres
Publié: (2024)

Parameter Estimation in DAGs from Incomplete Data via Optimal Transport
par: Vo, Vy, et autres
Publié: (2023)

Pure Message Passing Can Estimate Common Neighbor for Link Prediction
par: Dong, Kaiwen, et autres
Publié: (2023)

Silent Abandonment in Contact Centers: Estimating Customer Patience from Uncertain Data
par: Castellanos, Antonio, et autres
Publié: (2023)

Graph Generation with $K^2$-trees
par: Jang, Yunhui, et autres
Publié: (2023)

Stationary distribution of node2vec random walks on household models
par: Schroeder, Lars, et autres
Publié: (2025)

What Drives Online Popularity: Author, Content or Sharers? Estimating Spread Dynamics with Bayesian Mixture Hawkes
par: Calderon, Pio, et autres
Publié: (2024)

Network classification through random walks
par: Travieso, Gonzalo, et autres
Publié: (2025)

Estimating Causal Effects in Networks with Cluster-Based Bandits
par: Faruk, Ahmed Sayeed, et autres
Publié: (2025)

A Simple Model to Estimate Sharing Effects in Social Networks
par: Jeunen, Olivier
Publié: (2024)

Graph Machine Learning based Doubly Robust Estimator for Network Causal Effects
par: Khatami, Seyedeh Baharan, et autres
Publié: (2024)

Symmetry-driven embedding of networks in hyperbolic space
par: Lizotte, Simon, et autres
Publié: (2024)

Estimating Network Models using Neural Networks
par: Mele, Angelo
Publié: (2025)

Sparse graphs using exchangeable random measures
par: Caron, François, et autres
Publié: (2014)

Estimation of partial rankings from sparse, noisy comparisons
par: Morel-Balbi, Sebastian, et autres
Publié: (2025)

Observational Learning with a Budget
par: Wu, Shuo, et autres
Publié: (2025)

Label Informed Contrastive Pretraining for Node Importance Estimation on Knowledge Graphs
par: Zhang, Tianyu, et autres
Publié: (2024)

Scalable Multitask Learning Using Gradient-based Estimation of Task Affinity
par: Li, Dongyue, et autres
Publié: (2024)

Predicting Cascading Failures with a Hyperparametric Diffusion Model
par: Xiang, Bin, et autres
Publié: (2024)

Training a Label-Noise-Resistant GNN with Reduced Complexity
par: Zhao, Rui, et autres
Publié: (2024)

Reconstructing Graph Diffusion History from a Single Snapshot
par: Qiu, Ruizhong, et autres
Publié: (2023)

Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models
par: Zhang, Ning, et autres
Publié: (2024)

Normalized mutual information is a biased measure for classification and community detection
par: Jerdee, Maximilian, et autres
Publié: (2023)

Efficient Learning on Large Graphs using a Densifying Regularity Lemma
par: Kouchly, Jonathan, et autres
Publié: (2025)

Longitudinal Modularity, a Modularity for Link Streams
par: Brabant, Victor, et autres
Publié: (2024)

Mapping the Russian Internet Troll Network on Twitter using a Predictive Model
par: Dassanayaka, Sachith, et autres
Publié: (2024)

PACIFIER: Pacing Opinion Depolarization via a Unified Graph Learning Framework
par: Liao, Mingkai
Publié: (2026)

When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark
par: Lin, Junhong, et autres
Publié: (2024)

UTG: Towards a Unified View of Snapshot and Event Based Models for Temporal Graphs
par: Huang, Shenyang, et autres
Publié: (2024)