Skip to content
View aleable's full-sized avatar
🧩
🧩
36 followers · 27 following

Achievements

Achievement: Arctic Code Vault Contributor

Achievements

Achievement: Arctic Code Vault Contributor

Block or report aleable

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
aleable/README.md

Hello!

I am a postdoctoral researcher at the Centre for Complex Systems, within the School of Mathematical Sciences at Queen Mary University of London, where I work with Christian Beck. Previously, I completed my PhD at the Max Planck Institute for Intelligent Systems under the supervision of Caterina De Bacco and supported by the International Max Planck Research School for Intelligent Systems. After my PhD, I also interned at Sony AI. I earned my Master's in Mathematical Engineering and my Bachelor's in Physics at the University of Padova.

More about me can be found on my website: aleable.github.io.

If you would like to get in touch with me, please send an email to: [email protected].

Pinned Loading

  1. McOpt McOpt Public

    McOpt is an algorithm that can efficiently solve multicommodity routing problems on networks

    Jupyter Notebook 14 4

  2. nickruggeri/hypergraph-message-passing nickruggeri/hypergraph-message-passing Public

    Message passing, expectation maximization and sampling on hypergraphs.

    Python 5

  3. BROT BROT Public

    BROT is a self-adaptation algorithm that trade offs traffic mitigation and shortest path length on transportation networks

    Jupyter Notebook 5

  4. MODI MODI Public

    MODI is an algorithm implementing a multicommodity optimal transport-based dynamics for image classification

    Jupyter Notebook 5 1

  5. N-STARK N-STARK Public

    N-STARK is an algorithm that can efficiently solve routing problems with time-dependent loads on networks

    Jupyter Notebook 7 1

  6. cdebacco/MultiOT cdebacco/MultiOT Public

    Optimal transport on Multilayer networks

    Jupyter Notebook 16 3