- About our group
- How to contact us
- Computational Neuroscience Projects
- Complex Systems Projects
- Past projects
- EURESIST - Project
- ICEA - Modelling goal-directed navigation of the rat
- Hippocampal oscillations
- Study of sensory systems
- Software package for complex network analysis
- Dynamics of evolving networks
- A populational model of hippocampus CA3 region slices
- Development of hippocampal place fields
- Hippocampal coding and dynamics
- Location dependent differences between somatic and dendritic IPSPs
- Olfaction and its underlying stochastic phenomena
- The role of self-excitation in the development of topographic order
- CNS '15 Host Proposal
- IJCNN 11 Workshop
- Past events
- Minisymposium on Computational Aspects of Neurological and Psychatric Diseases
- Workshop on large scale random graphs
- Workshop on Cortico- Hippocampal dynamics: Navigation and Neuromodulation
- Joint Workshop on Neural Autonomous Robots
- Workshop on System Neuroscience
- Neuronhálózatok strukturális kérdései
- 7th Tamagawa Dynamic Brain Forum 2002
- Minisymposium on Computational Neuroscience
- Számítógepes neurológia konferencia, Problemák - Adatok - Modellek
- Budapest - Tampere Minisymposium on Computational Neurolgy
- Education / Oktatás
- Lectures and News
Organisation of signal flow in directed networks
Complex data and systems can often be represented as directed graphs. Many of such systems implement some sort of signal processing. In this project we address the question that how does the structure of the network influence the signal processing properties. To do so, we introduced a novel edge-based measure to describe the convergence or divergence of the information on a given edge based on the shortest paths passing through it. This measure, the convergence degree, provides additional information to the traditional measures, such as the clustering coefficient or degree distribution, so it is useful to differentiate real-world networks or random graph models with different information processing properties.
An important problem in network theory is the problem of representation. We would like to map the graphs to a space where isomorphic graphs are identical and graphs with similar structural properties are close to each other. The convergence degree is applicable to implement such a space if we map the edge convergences to the vertices. This representation allows us to examine the roles of specific vertices in the information processing of the network, and also can be useful in the comparison of different networks. The main application of these tools in this project is the analysis of the large-scale cortical network of brain areas.
The methods described above help us to describe the geometry of the graph as a space where dynamic processes can take place. The next step of the research is to model these processes by defining the appropriate differential operators for directed networks. If we had the reaction-diffusion equation specified, we could build dynamic models of real world processes, e.g. information processing of cortical areas, that can be fitted to experimental data.
People working on this project
Publications related to this project
Négyessy, L., Bányai, M., Bazsó F. What makes the prefrontal cortex so appealing in the era of brain imaging? A network analytical perspective. ACTA BIOLOGICA HUNGARICA, accepted for publication, 2011.
Bányai, M., Négyessy, L., Bazsó F., Organisation of signal flow in directed networks. Journal of Statistical Mechanics: theory and experiment, P06001, 2011. doi: 10.1088/1742-5468/2011/06/P06001
M. Bányai, T. Nepusz, L. Négyessy, F. Bazsó Convergence properties of some random networks, 7-th International Symposium on Intelligent Systems and Informatics 241-245, DOI: 10.1109/SISY.2009.5291157 , 2009. SISY 2009. Subotica, Serbia.
Négyessy L, Nepusz T, Zalányi L, Bazsó F.: Convergence and divergence are mostly reciprocated properties of the connections in the network of cortical areas. Proceedings of the Royal Society B
Nepusz T., Négyessy L., Tusnády G., Bazsó F.: Reconstructing cortical networks: case of directed graphs with high level of reciprocity. Chapter 8 in Handbook of Large-Scale Random Networks, eds.: Béla Bollobás, Róbert Kozma, Dezső Miklós. Springer-Verlag
Nepusz T, Bazsó F: Likelihood-based clustering of directed graphs. Proceedings of the IEEE 3rd International Symposium on Computational Intelligence and Intelligent Informatics, pp. 189-194
Négyessy L, Nepusz T, Kocsis L and Bazsó F: Prediction of the main cortical areas and connections involved in the tactile function of the visual cortex by network analysis. European Journal of Neuroscience 23(7) (2006) 1919-1930.