MS Mudassir Shabbir
Hello

Graduate Students Orientation · 2026

Dr. MudassirShabbir

Associate Professor of Computer Science
Syed Babar Ali School of Science & Engineering
Lahore University of Management Sciences

Graph machine learningResilient networked systemsDiscrete geometry

Graphs · Algorithms · Control · Learning

Graduate orientation · LUMS · 2026

I remove edges
for a living.*

* Very carefully.

Graph learning, resilient networks, and the mathematics hiding underneath.

My research asks graphs three awkward questions

Less. Lies. Lookalikes.

01

Can it learn with less?

Sparse graphs. Useful features. No signal sacrificed.

02

Can it survive a liar?

Robots cooperate even when one teammate goes rogue.

03

Can it prove who it is?

Different graphs can share the same spectral “sound.”

Less · Graph machine learning

Marie Kondo,
but for graphs.

Keep the connections that spark signal.

raw network 28 edges
zero forcing
learning backbone 11 edges
GraphSAGE
68.7
73.9
+ rank encoding

Lies · Resilient multi-agent systems

One robot lies.
The team still learns.

“Fly left!”Byzantine agent
Consensus: fly right →
corecritical links protected

Byzantine = a teammate who is confidently wrong on purpose.

Lookalikes · Spectral graph theory

Graph A: “I’m unique.”
Graph B: “Sure.”

A
same spectrumsame graph
B
walk matrix
1  0  3  7
0  2  4  9
1  4  8  16
+ arithmetic fingerprint

Your move

Bring me a
messy network.

We’ll find the structure that makes it…

learn with lesssurvive bad actorsprove its identity