The following pages link to Prasad Tetali (Q247100):
Displaying 50 items.
- (Q168578) (redirect page) (← links)
- Inverse expander mixing for hypergraphs (Q281623) (← links)
- Decay of correlations for the hardcore model on the \(d\)-regular random graph (Q287695) (← links)
- Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities (Q288752) (← links)
- On sharp transitions in making squares (Q431647) (← links)
- Displacement convexity of entropy and related inequalities on graphs (Q466893) (← links)
- The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph (Q518178) (← links)
- Ricci curvature bounds for weakly interacting Markov chains (Q524227) (← links)
- On randomizing two derandomized greedy algorithms (Q547862) (← links)
- Isoperimetric invariants for product Markov chains and graph products (Q558240) (← links)
- A family of switch equivalent graphs (Q704278) (← links)
- Random walks and the effective resistance of networks (Q756281) (← links)
- Mixing time bounds via the spectral profile (Q850392) (← links)
- Modified logarithmic Sobolev inequalities in discrete settings (Q867071) (← links)
- \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Matchings and independent sets of a fixed size in regular graphs (Q1040835) (← links)
- A note on expected hitting times for birth and death chains (Q1126106) (← links)
- Covering with Latin transversals (Q1345959) (← links)
- A characterization of unique tournaments (Q1386429) (← links)
- Characterization of a class of weak transport-entropy inequalities on the line (Q1621719) (← links)
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains (Q1769410) (← links)
- The number of linear extensions of the Boolean lattice (Q1771251) (← links)
- Approximating min sum set cover (Q1884768) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- Improved mixing condition on the grid for counting and sampling independent sets (Q1955841) (← links)
- Optimal linear arrangement of a rectangular grid (Q1970706) (← links)
- On the bipartiteness constant and expansion of Cayley graphs (Q2122675) (← links)
- On the number of independent sets in uniform, regular, linear hypergraphs (Q2237850) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Kantorovich duality for general transport costs and applications (Q2407214) (← links)
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point (Q2428505) (← links)
- Analysis of top-swap shuffling for genome rearrangements (Q2467609) (← links)
- The sub-Gaussian constant and concentration inequalities (Q2472751) (← links)
- (Q2722655) (← links)
- Analyzing Glauber dynamics by comparison of Markov chains (Q2737887) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Sampling and Counting 3-Orientations of Planar Triangulations (Q2804991) (← links)
- The Distribution of Second Degrees in the Buckley–Osthus Random Graph Model (Q2808831) (← links)
- Discrete Curvature and Abelian Groups (Q2810698) (← links)
- Stochastic Matching with Commitment (Q2843305) (← links)
- Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2 (Q2851872) (← links)
- Approximations for the isoperimetric and spectral profile of graphs and related parameters (Q2875190) (← links)
- Entropy and set cardinality inequalities for partition-determined functions (Q2904591) (← links)
- (Q2920875) (← links)
- (Q2959978) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- Reconstruction and Clustering in Random Constraint Satisfaction Problems (Q3094944) (← links)
- The Multistate Hard Core Model on a Regular Tree (Q3094949) (← links)
- (Q3128901) (← links)