Advertisement · 728 × 90

Posts by George Cantwell

Claude does not seem able to reliably answer: "how many cathedrals does the Church of England have?" What a weird blind spot.

1 week ago 1 0 0 0

Next week, my course on Networks and Complexity is starting again, which is always taught online. We have some space left for international students.

Lectures will be on mondays and thursdays 16:00-18:00 CEST. Starting 9th. 24 Lectures total.

More info in the reply.

2 weeks ago 10 4 1 1

Journal publishing is bad now, but …this year is the 40th anniversary of my first published paper and the 43rd anniversary of it being accepted for publication.

2 weeks ago 89 7 6 0

I think they get a placebo

4 months ago 2 0 0 0

In triple blind the editors also don’t know. But I’m pretty sure I’ve even had quadruple blind: the reviews don’t know which paper they belong to

4 months ago 0 0 1 0

I think maybe the same, but is British sarcasm/irony can be both subtle and frequent...

4 months ago 1 0 1 0

Can't get over the fact that in the ML literature the act of *sampling* from an inferred model is now called “inference.”

We really are in the worst timeline.

4 months ago 10 2 0 0

We are looking for a PhD student to work with us on network science methods for biomedicine. The student can be enrolled in any graduate program. #NetworkMedicine #ComplexSystems.

4 months ago 7 6 0 0
Preview
The perplexing “connected cluster axiom” – Inverse Complexity Lab Research group on inverse problems in complex systems and network science.

I wrote a blog post about the often stated but never explained assumption that communities in graphs should always be connected.

This is inconsistent with statistical significance and null models that underlie the most widely employed methods.

skewed.de/lab/posts/co...

4 months ago 51 15 4 0

Maybe a partial answer to your question of where this idea comes from: a network is sometimes *defined* to be the largest component, e.g., the internet is the largest component of connected computers. In those cases specifically it could be sensible starting point.

4 months ago 3 0 1 0
Advertisement
Preview
Embedding networks with the random walk first return time distribution We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowin...

A principled graph embedding that also appears to work well in practice: arxiv.org/abs/2512.02694

4 months ago 7 2 0 0
Preview
Multilayer network science: theory, methods, and applications Multilayer network science has emerged as a central framework for analysing interconnected and interdependent complex systems. Its relevance has grown substantially with the increasing availability of...

Our review on multilayer network science is out on the arXiv. Thanks to all collaborators of the AccelNet MultiNet project, great working with you all 🙏 @alexvespi.bsky.social @ymoreno.bsky.social @lordgrilo.bsky.social @anduviera.bsky.social @baronca.bsky.social
arxiv.org/abs/2511.23371

4 months ago 19 9 0 0

Whoever created OpenReview looked at online anonymous forums and thought "yes, this is the platform to foster productive debate"

5 months ago 11 1 0 0

Ah yes, Ramanujan's famous proof that pi^2 is rational

5 months ago 1 0 0 0

Very good post. I very much agree with the overall position.

5 months ago 7 5 0 0

I suspect saying if an array is "really" a vector, or a linear transform, or a photo, or a graph, or ..., is up to us as humans

5 months ago 1 0 0 0

Do you mean like: you have a (d x n) data matrix, hidden representations are, e.g., (4d x n), and the final output is say (2 x n). If so, isn't this the prototypical use case?

5 months ago 1 0 1 0
Video

Excited to introduce Vibes from Meta. Eat your slop, piggies!

6 months ago 7385 2648 111 205

Message passing for epidemiological interventions on networks with loops
https://arxiv.org/abs/2509.21596

6 months ago 6 5 0 0
Advertisement
Post image

Our fall seminar series begins this Thursday, Oct. 2 (4pm UTC+1/11am EDT) with a talk by Elena Candellone. She’ll be speaking about “Mapping extreme users through negative ties in online social interactions”, followed by a discussion on “the joy of planning scientific events”.

6 months ago 10 5 1 4
Preview
Robustness of 'small' networks Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component ...

arXiv alert! 📄🚨
Robustness of small networks
arxiv.org/abs/2509.23670
Great to dust off one of my favorite topics and get to collaborate with the legendary
@aliceschwarze.bsky.social and Peter Mucha

6 months ago 23 6 1 0
Preview
Graduate Program * Complexity Science Hub Courses are offered both by CSH and by our partner universities, one of which will serve as the degree-granting entity. Students will be guided to the

#SpreadtheWord
We are looking for #PhD candidates passionate about using large-scale data analysis, quantitative models, and complexity science to study the complex interactions within #epidemiology, #OneHealth, and #publichealthsystems.
More info: csh.ac.at/education/gr...

6 months ago 4 3 0 0

The Probabilistic Systems, Information, and Inference group at the University of Cambridge is seeking applicants for funded PhD positions.

Anyone who wants to study networks/complex systems/statistical physics/inference can email me at gtc31@cam.ac.uk

7 months ago 9 3 0 0

Right, we solved directly for the stationary state, but one could also integrate for the transient. I'll look into it... thanks!

7 months ago 2 0 1 0

Oh, you have some nice calculations for the cluster expansion! But I think this reinfection counting has the same equilibrium prediction as the regular pair-approx

7 months ago 2 0 1 0
Preview
The threshold and quasi-stationary distribution for the SIS model on networks We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approxima...

We found a nice way to accurately solve the SIS model. Rather than expanding in space with ever larger moment closures (pairs, triples, ...), we expand in time. No more difficult than pair-approximations yet much more accurate.
arxiv.org/abs/2509.11706

7 months ago 25 4 2 0

Strong emergence

7 months ago 52 8 1 0
Johns Hopkins University, Physics and Astronomy Job #AJO30496, Postdoctoral Fellow in Foundations of Physics, Complexity, and Emergence, Physics and Astronomy, Johns Hopkins University, Baltimore, Maryland, US

Postdoc job! I expect to have an opening at Johns Hopkins for a postdoctoral researcher working somewhere in the broad realms of physics, philosophy, and complexity. Apply at Academic Jobs Online:

academicjobsonline.org/ajo/jobs/30496

7 months ago 199 85 17 6
Advertisement

Not sure how many scientists here have tried Claude Code or similar command line coding assistants. I had a complicated family property tax problem that was best solved by a brute force Monte Carlo simulation approach, so I spent a few days coding up and analyzing a model with Claude Code.

8 months ago 352 129 20 46
Post image

Applications are open for SFI's 2026 Complexity Postdoctoral Fellowships

If you’ve recently earned a Ph.D. in any scientific field and want to pursue independent, transdisciplinary research, consider applying.

Deadline: October 1, 2025
Apply here: santafe.edu/sfifellowship

8 months ago 66 69 0 3