Szabolcs Horvát

Currently I am a postdocotral researcher at the Stem-cell and Brain Research Institute (Inserm U1208) in Lyon, France. I am working in the Cortical Architecture, Coding and Plasticity group lead by Henry Kennedy.

Previously I worked at the Department of Physics and iCeNSA, University of Notre Dame, with Zoltán Toroczkai.

Contact me at:

By popular demand, how to pronounce my name?


Networks of the brain

Anatomical connectivity of the macaque brain (artistic visualization based on real data).

The lengths of individual axons (\(d\)) running between different functional areas of the cerebral cortex follow an exponential distribution: \(p(d) = e^{-\lambda d}\). This property is referred to as the Exponenital Distance Rule (EDR). The EDR was originally shown using retrograde tracing experiments in the macaque monkey and later confirmed with higher accuracy in the mouse brain.

The EDR expresses the fact that there are many more short connections than long connections in the brain. The relationship between connectivity and distance was usually studied using a very direct approach where it is the probability or the strength of an interareal connection (made up of many axons) that is being measured. However, when looked at this way, the data is very noisy: for any given connection length, the observed connection strengths span several orders of magnitude. This makes it difficult to establish a simple mathematical relationship between strength and distance with any confidence. In contrast, the EDR refers to the distribution of individual axonal lengths, and expresses a relationship that can be verified to much higher accuracy.

Using the EDR, we can also build a random graph model, which is able to reproduce many observed global network properties of brain networks (“connectomes”). Thus it serves as a starting point for analysing connectome structure.

While the EDR holds very well when including axons lengths from throughout the cortex in the distribution, it is important to note that it is a global, average property. If looking at axons projecting into one speific area, we can observe consistent fluctuations around a perfect exponential decay. These are not random, but consistent across several individual brains, and may be related to the particular function of that area.

Using these observations we have compared the macaque and mouse connectomes using a common framework. The axonal length distribution has a steeper decay (relative to brain size) in the macaque brain than in the mouse. The larger macaque brain is also observed to have fewer long-range connections which are also weaker. This lends to the prediction that long connections may be even weaker in the still larger human brain, which could explain why humans are susceptible to certain mental illnesses such as schizophrenia and Alzheimer disease.

Sampling networks with constrains – Maximum Entropy models

While working on problems related to sampling random graphs (networks) with arbitrary constraints, we have developed a solution for the so-called degeneracy problem of Exponential Random Graph (ERG) models (see below), which greatly extends their practical applicability. Illustration of degeneracy in ERGs

The simplest type of sampling constraint is a sharp constraint where the value of certain graph measures (quantities) is strictly prescribed: e.g. choose any graph that has precisely \(m\) edges with equal probablity. There are no generally applicable methods for working with arbitrary sharp constraints.

An average constraint is more relaxed: sample from a graph distribution where only the average of certain graph measures is fixed. There are many distributions with the same mean, and the principle of maximum entropy (E.T. Jaynes, 1957) selects the one which contains the least bias other than the constraint. Applying average constraints to graphs distributions leads to ERG models.

ERG models have become a popular network analysis tool, but unfortunately they may suffer (depending on the particular constraints) from a significant drawback termed degeneracy: e.g. when the edge count of a graph is constrained in average, the sampled graphs may all be either very sparse or very dense, but none represent the average edge count. This precludes most practical applications which assume a unimodal distribution concentrated around the average.

We have developed a practical solution for reducing degeneracy that relies on carefully chosen transformations of the constrained measures.

Analysing a novel synchronization model

Spontaneous synchronization occurs in many places in nature (fireflies flashing together, rhythmic applause, mechanically coupled metronomes, etc.) and has been widely studied. Most synchronization models fall into two main categories: phase-coupled oscillators (e.g. the Kuramoto model) or pulse-coupled oscillators (e.g. integrate and fire model). An entirely different model (described by Nikitin et al., PRL 87, (2001)) uses oscillators that periodically output some signal: let’s imagine flashing lights for an intuitive picture. The oscillators are bimodal, being able to flash either quickly or slowly. A surprising result is that if each individual unit switches between the fast and slow modes in an attempt to keep the momentary total light intensity in the system at a fixed level, their flashing may become synchronized. This model is remarkable because synchronization emerges as a non-obvious side effect of an interaction aimed at optimizing an entirely different property of the system. I worked with Prof. Zoltán Néda on understanding the behaviour and mapping the phase space of this model family.

Synchronization model phase space

Curriculum Vitae

GPG Public Key