Pages that link to "Item:Q2571014"

The following pages link to Evolving sets, mixing and heat kernel bounds (Q2571014):

Displaying 50 items.

• Invariance principle for Mott variable range hopping and other walks on point processes (Q372560) (← links)
• On the range of a random walk in a torus and random interlacements (Q400572) (← links)
• Recent progress on the random conductance model (Q431513) (← links)
• Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings (Q471527) (← links)
• Convergence of discrete Green functions with Neumann boundary conditions (Q526994) (← links)
• Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities (Q533753) (← links)
• Anomalous heat-kernel decay for random walk among bounded random conductances (Q731675) (← links)
• Faster mixing and small bottlenecks (Q863483) (← links)
• Quenched invariance principle for simple random walk on percolation clusters (Q866943) (← links)
• Orthogonality and probability: mixing times (Q967701) (← links)
• A little statistical mechanics for the graph theorist (Q973134) (← links)
• The mixing time for simple exclusion (Q997944) (← links)
• Quenched central limit theorem for random walks in doubly stochastic random environment (Q1621449) (← links)
• On sensitivity of uniform mixing times (Q1635969) (← links)
• Dynamical freezing in a spin glass system with logarithmic correlations (Q1663881) (← links)
• On sensitivity of mixing times and cutoff (Q1748929) (← links)
• Mixing time bounds via bottleneck sequences (Q1756546) (← links)
• Bounds on lifting continuous-state Markov chains to speed up mixing (Q1800950) (← links)
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk (Q1951693) (← links)
• Approximate and exact solutions of intertwining equations through random spanning forests (Q1983041) (← links)
• Comparing with octopi (Q2028952) (← links)
• The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set (Q2087389) (← links)
• Mixing time for random walk on supercritical dynamical percolation (Q2174662) (← links)
• On the construction of measure-valued dual processes (Q2184626) (← links)
• A comparison principle for random walk on dynamical percolation (Q2212614) (← links)
• The exclusion process mixes (almost) faster than independent particles (Q2212617) (← links)
• Random walk in changing environment (Q2229693) (← links)
• Heat-kernel estimates for random walk among random conductances with heavy tail (Q2267545) (← links)
• On random walk on growing graphs (Q2320398) (← links)
• Mixing times for a constrained Ising process on the two-dimensional torus at low density (Q2337837) (← links)
• Random walks on discrete point processes (Q2346193) (← links)
• A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities (Q2413244) (← links)
• Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels (Q2461043) (← links)
• Isoperimetric inequalities and mixing time for a random walk on a random point process (Q2475038) (← links)
• Existence of phase transition for percolation using the Gaussian free field (Q2657466) (← links)
• Cutoff for permuted Markov chains (Q2686612) (← links)
• The mixing time of the giant component of a random graph (Q2930052) (← links)
• ISOPERIMETRIC PROFILES ON THE PRE-FRACTAL SIERPINSKI CARPET (Q3084725) (← links)
• Furstenberg entropy of intersectional invariant random subgroups (Q3121270) (← links)
• Commuting probabilities of infinite groups (Q3304715) (← links)
• Evolving sets and mixing (Q3581297) (← links)
• (Q4969156) (← links)
• The generalized distance spectrum of a graph and applications (Q5038134) (← links)
• (Q5053269) (← links)
• Full groups and soficity (Q5179377) (← links)
• Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains (Q5495677) (← links)
• Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile (Q5737813) (← links)
• Random walks on regular trees can not be slowed down (Q6126948) (← links)
• Random interlacement is a factor of i.i.d. (Q6165199) (← links)
• Transience of simple random walks with linear entropy growth (Q6178793) (← links)