Graph sequences sampled from Robinson graphons

DOI10.1016/j.ejc.2023.103859arXiv2005.05253OpenAlexW3022921866MaRDI QIDQ6146495

Mahya Ghandehari, Jeannette C. M. Janssen

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.05253

zbMATH Keywords

random graphsinterval graphslinear embeddinggraph limits

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm to recognize Robinsonian dissimilarities
• A structural characterization for certifying Robinsonian matrices
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
• Limits of randomly grown graph sequences
• Limits of dense graph sequences
• Quick approximation to matrices and applications
• Optimal rates of statistical seriation
• The geometry of continuous latent space models for network data
• Linear embeddings of graphs and graph limits
• Threshold Graph Limits and Random Threshold Graphs
• Latent Space Approaches to Social Network Analysis
• Community Detection and Stochastic Block Models
• Monotone Graph Limits and Quasimonotone Graphs
• Seriation and matrix reordering methods: An historical overview
• A Popularity Scaled Latent Space Model for Large-Scale Directed Social Network
• An Optimization Parameter for Seriation of Noisy Data

This page was built for publication: Graph sequences sampled from Robinson graphons