On Sidorenko's conjecture for determinants and Gaussian Markov random fields
From MaRDI portal
Publication:6074867
DOI10.1002/rsa.21112zbMath1525.05132arXiv1801.08425WikidataQ114234626 ScholiaQ114234626MaRDI QIDQ6074867
Péter Csikvári, Balázs Szegedy
Publication date: 19 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08425
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Other Dirichlet series and zeta functions (11M41) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
On the local approach to Sidorenko's conjecture, Gaussian Markov random fields and totally positive matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- The real positive semidefinite completion problem for series-parallel graphs
- M-matrices as covariance matrices of multinormal distributions
- Positive definite completions of partial Hermitian matrices
- Limits of dense graph sequences
- Spanning trees in regular graphs
- Gaussian Markov distributions over finite graphs
- Multi-dimensional multivariate Gaussian Markov random fields with application to image processing
- Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions
- The real positive definite completion problem for a simple cycle
- The sandwich theorem
- Zeta functions of finite graphs and coverings
- Maximum likelihood estimation in Gaussian models under total positivity
- A correlation inequality for bipartite graphs
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- Two approaches to Sidorenko’s conjecture
- Statistical Distributions
- On the Shannon capacity of a graph
- On weighted graph homomorphisms
- Gaussian Markov Random Fields
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- The real positive definite completion problem: cycle completability
- Cover times, blanket times, and majorizing measures
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Graph norms and Sidorenko's conjecture