Pages that link to "Item:Q2819555"
From MaRDI portal
The following pages link to Faster mixing via average conductance (Q2819555):
Displaying 19 items.
- On the range of a random walk in a torus and random interlacements (Q400572) (← links)
- Mixing time of near-critical random graphs (Q428137) (← links)
- Recent progress on the random conductance model (Q431513) (← links)
- Faster mixing and small bottlenecks (Q863483) (← links)
- Random walks on the random graph (Q1747756) (← links)
- Mixing time bounds via bottleneck sequences (Q1756546) (← links)
- A sharp log-Sobolev inequality for the multislice (Q2077186) (← links)
- Log-Sobolev inequality for the multislice, with applications (Q2119683) (← links)
- Approximating a sequence of observations by a simple process (Q2388342) (← links)
- Evolving sets, mixing and heat kernel bounds (Q2571014) (← links)
- The evolution of the mixing rate of a simple random walk on the giant component of a random graph (Q3522830) (← links)
- Vertex and edge expansion properties for rapid mixing (Q4667856) (← links)
- Improved bounds for sampling contingency tables (Q4803313) (← links)
- (Q4969156) (← links)
- Multidimensional Binary Search for Contextual Decision-Making (Q4971566) (← links)
- (Q5090410) (← links)
- (Q5091254) (← links)
- Blocking Conductance and Mixing in Random Walks (Q5295401) (← links)
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q5737813) (← links)