Imagen de Portada

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Skeja, Anda, Olhede, Sofia C.
Formato:	Preprint
Publicado:	2024
Materias:	Statistics Theory Information Theory Combinatorics Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Entropy of Exchangeable Random Graphs
por: Skeja, Anda, et al.
Publicado: (2023)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
por: Bresler, Guy, et al.
Publicado: (2025)

Detecting Arbitrary Planted Subgraphs in Random Graphs
por: Elimelech, Dor, et al.
Publicado: (2025)

Multiplexons: Limits of Multiplex Networks
por: Ganguly, Ankan, et al.
Publicado: (2025)

Hybrid of node and link communities for graphon estimation
por: Verdeyme, Arthur, et al.
Publicado: (2024)

Graph Quasirandomness for Hypothesis Testing of Stochastic Block Models
por: Bangachev, Kiril, et al.
Publicado: (2025)

Detection and Reconstruction of a Random Hypergraph from Noisy Graph Projection
por: Gong, Shuyang, et al.
Publicado: (2025)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
por: Mossel, Elchanan, et al.
Publicado: (2024)

Randomstrasse101: Open Problems of 2024
por: Bandeira, Afonso S., et al.
Publicado: (2025)

The Fundamental Limits of Recovering Planted Subgraphs
por: Lee, Daniel, et al.
Publicado: (2025)

Randomstrasse101: Open Problems of 2025
por: Bandeira, Afonso S., et al.
Publicado: (2026)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
por: Yu, Lei, et al.
Publicado: (2023)

Thresholds for Reconstruction of Random Hypergraphs From Graph Projections
por: Bresler, Guy, et al.
Publicado: (2025)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
por: Bangachev, Kiril, et al.
Publicado: (2024)

Complete Causal Identification from Ancestral Graphs under Selection Bias
por: Chen, Leihao, et al.
Publicado: (2026)

Sparse Hanson-Wright Inequalities with Applications
por: He, Yiyun, et al.
Publicado: (2024)

Large random matrices with given margins
por: Lyu, Hanbaek, et al.
Publicado: (2024)

On the lumpability of tree-valued Markov chains
por: Alves, Rodrigo B., et al.
Publicado: (2024)

Transitivity in Inhomogeneous Random Tournaments
por: Chatterjee, Sayak, et al.
Publicado: (2026)

Explicit Universal Bounds for Cumulants via Moments
por: Zhang, Jiechen
Publicado: (2025)

Extreme singular values of inhomogeneous sparse random rectangular matrices
por: Dumitriu, Ioana, et al.
Publicado: (2022)

Spectra of high-dimensional sparse random geometric graphs
por: Cao, Yifan, et al.
Publicado: (2025)

A phase transition in Erdős-Barak random graphs
por: Blanchard, Gilles, et al.
Publicado: (2025)

Spectral Analysis of Word Statistics
por: Even-Zohar, Chaim, et al.
Publicado: (2020)

Entropy of Soft Random Geometric Graphs in General Geometries
por: Baker, Oliver, et al.
Publicado: (2026)

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
por: Yu, Lei, et al.
Publicado: (2021)

Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks
por: Liu, Suqi, et al.
Publicado: (2024)

Copula Entropy: Theory and Applications
por: Ma, Jian
Publicado: (2025)

Type $1$, $2$, $3$ and $4$ $q$-negative binomial distribution of order $k$
por: Oh, Jungtaek
Publicado: (2022)

Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection
por: Morgan, Alexander, et al.
Publicado: (2026)

A Strict Gap Between Relaxed and Partition-Constrained Spectral Compression in a Six-State Lumpable Markov Chain
por: Kiriukhin, Oleg
Publicado: (2026)

Modularity and partially observed graphs
por: McDiarmid, Colin, et al.
Publicado: (2021)

Estimating Graph Dynamics from Population Observations
por: Braunsteins, Peter, et al.
Publicado: (2026)

Group Testing: An Information Theory Perspective
por: Aldridge, Matthew, et al.
Publicado: (2019)

Estimating stationary mass, frequency by frequency
por: Nakul, Milind, et al.
Publicado: (2025)

Minimum Hellinger Distance Estimators for Complex Survey Designs
por: Kepplinger, David, et al.
Publicado: (2025)

Equal Requests are Asymptotically Hardest for Data Recovery
por: Lember, Jüri, et al.
Publicado: (2024)

Information Inequalities for Joint Distributions, with Interpretations and Applications
por: Madiman, Mokshay, et al.
Publicado: (2008)

Individual testing is optimal for nonadaptive group testing in the linear regime
por: Aldridge, Matthew
Publicado: (2018)

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
por: Bruno, Roberto, et al.
Publicado: (2026)