Pages that link to "Item:Q3192382"
From MaRDI portal
The following pages link to Invariant Gaussian processes and independent sets on regular graphs of large girth (Q3192382):
Displaying 22 items.
- Percolation with small clusters on random graphs (Q293653) (← links)
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- Independence ratio and random eigenvectors in transitive graphs (Q888543) (← links)
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs (Q1700413) (← links)
- Cubic graphs with small independence ratio (Q1733918) (← links)
- Entropy and expansion (Q2028943) (← links)
- Ising model on trees and factors of IID (Q2071790) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Entropy inequalities for factors of IID (Q2319838) (← links)
- On the almost eigenvectors of random regular graphs (Q2421826) (← links)
- Improved replica bounds for the independence ratio of random regular graphs (Q2687694) (← links)
- Correlation Bounds for Distant Parts of Factor of IID Processes (Q4601049) (← links)
- Mutual information decay for factors of i.i.d. (Q5235118) (← links)
- Factor of IID Percolation on Trees (Q5298168) (← links)
- Factors of IID on Trees (Q5366945) (← links)
- The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731) (← links)
- On the minimum bisection of random 3-regular graphs (Q6106297) (← links)
- Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. (Q6126971) (← links)
- Greedy maximal independent sets via local limits (Q6541390) (← links)
- Colouring strong products (Q6612523) (← links)
