University of Cambridge > Talks.cam > Probability > Rounding Markov Chains and Iterative Load-Balancing Schemes

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Rounding Markov Chains and Iterative Load-Balancing Schemes

Download to your calendar using vCal

If you have a question about this talk, please contact .

Iterative Load-Balancing Schemes allow nodes to balance its load with their neighbors in each iteration. Under the assumption that load can be divided arbitrarily often (continuous case), it is well-known that such schemes correspond to Markov chains whose convergence is characterised by the spectral gap of the transition matrix. In this talk we focus on the discrete case where load is integral. We show that by employing randomised rounding, the system converges to a state where all nodes have the same load up to an additive constant within the same number of steps that are needed in the continuous case.

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Departmetn of Genetics Office of Scholary Communication Online - "meet.google.com/epi-proa-bxu":URL

Other talks

Title TBC Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Talk TBC Title to be confirmed Title to be confirmed Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity