Search

This thesis discusses three problems that arise from routing flow through networks that exhibit some interaction of flow on links. This interaction manifests itself in delay from congestion or benefit from sharing. We develop a polynomial-time algorithm for two undirected disjoint shortest paths. Further, we address the computation of dynamic equilibria under the fluid queuing model. For cost-sharing network games, we investigate the computational complexity of Nash equilibria and the price of stability., Diese Arbeit beschäftigt sich mit Flüssen in Netzwerken, welche sich durch die Wechselwirkung von Fluss auf den Kanten auszeichnen. Diese äußert sich als Verzögerung durch Überlastung oder als Vergünstigung durch Kostenteilung. Ein polynomieller Algorithmus für zwei ungerichtete disjunkte kürzeste Wege wird entwickelt. Außerdem wird die Berechnung von dynamischen Equilibrien im Fluid Queuing Model erörtert. Für Cost-Sharing Network Games wird die Komplexität von Nash Equilibrien sowie der Price of Stability untersucht.

Motivation: Agent-based modeling is an indispensable tool for studying complex biological systems. However, existing simulation platforms do not always take full advantage of modern hardware and often have a field-specific software design. Results: We present a novel simulation platform called BioDynaMo that alleviates both of these problems. BioDynaMo features a modular and high-performance simulation engine. We demonstrate that BioDynaMo can be used to simulate use cases in: neuroscience, oncology and epidemiology. For each use case, we validate our findings with experimental data or an analytical solution. Our performance results show that BioDynaMo performs up to three orders of magnitude faster than the state-of-the-art baselines. This improvement makes it feasible to simulate each use case with one billion agents on a single server, showcasing the potential BioDynaMo has for computational biology research., Computer Engineering

During brain development, billions of axons must navigate over multiple spatial scales to reach specific neuronal targets, and so build the processing circuits that generate the intelligent behavior of animals. However, the limited information capacity of the zygotic genome puts a strong constraint on how, and which, axonal routes can be encoded. We propose and validate a mechanism of development that can provide an efficient encoding of this global wiring task. The key principle, confirmed through simulation, is that basic constraints on mitoses of neural stem cells—that mitotic daughters have similar gene expression to their parent and do not stray far from one another—induce a global hierarchical map of nested regions, each marked by the expression profile of its common progenitor population. Thus, a traversal of the lineal hierarchy generates a systematic sequence of expression profiles that traces a staged route, which growth cones can follow to their remote targets. We have analyzed gene expression data of developing and adult mouse brains published by the Allen Institute for Brain Science, and found them consistent with our simulations: gene expression indeed partitions the brain into a global spatial hierarchy of nested contiguous regions that is stable at least from embryonic day 11.5 to postnatal day 56. We use this experimental data to demonstrate that our axonal guidance algorithm is able to robustly extend arbors over long distances to specific targets, and that these connections result in a qualitatively plausible connectome. We conclude that, paradoxically, cell division may be the key to uniting the neurons of the brain.

Going beyond correlations, the understanding and identification of causal relationships in observational time series, an important subfield of Causal Discovery, poses a major challenge. The lack of access to a well-defined ground truth for real-world data creates the need to rely on synthetic data for the evaluation of these methods. Existing benchmarks are limited in their scope, as they either are restricted to a "static" selection of data sets, or do not allow for a granular assessment of the methods' performance when commonly made assumptions are violated. We propose a flexible and simple to use framework for generating time series data, which is aimed at developing, evaluating, and benchmarking time series causal discovery methods. In particular, the framework can be used to fine tune novel methods on vast amounts of data, without "overfitting" them to a benchmark, but rather so they perform well in real-world use cases. Using our framework, we evaluate prominent time series causal discovery methods and demonstrate a notable degradation in performance when their assumptions are invalidated and their sensitivity to choice of hyperparameters. Finally, we propose future research directions and how our framework can support both researchers and practitioners., Comment: 17 pages, 9 figures, for associated code and data sets, see https://github.com/causalens/cdml-neurips2020

Causal Discovery methods aim to identify a DAG structure that represents causal relationships from observational data. In this article, we stress that it is important to test such methods for robustness in practical settings. As our main example, we analyze the NOTEARS method, for which we demonstrate a lack of scale-invariance. We show that NOTEARS is a method that aims to identify a parsimonious DAG from the data that explains the residual variance. We conclude that NOTEARS is not suitable for identifying truly causal relationships from the data., Comment: 6 pages, 4 figures

Motivation: Agent-based modeling is an indispensable tool for studying complex biological systems. However, existing simulators do not always take full advantage of modern hardware and often have a field-specific software design. Results: We present a novel simulation platform called BioDynaMo that alleviates both of these problems. BioDynaMo features a general-purpose and high-performance simulation engine. We demonstrate that BioDynaMo can be used to simulate use cases in: neuroscience, oncology, and epidemiology. For each use case we validate our findings with experimental data or an analytical solution. Our performance results show that BioDynaMo performs up to three orders of magnitude faster than the state-of-the-art baseline. This improvement makes it feasible to simulate each use case with one billion agents on a single server, showcasing the potential BioDynaMo has for computational biology research. Availability: BioDynaMo is an open-source project under the Apache 2.0 license and is available at www.biodynamo.org. Instructions to reproduce the results are available in supplementary information. Contact: lukas.breitwieser@inf.ethz.ch, a.s.hesam@tudelft.nl, omutlu@ethz.ch, r.bauer@surrey.ac.uk Supplementary information: Available at https://doi.org/10.5281/zenodo.4501515, Comment: 8 pages, 6 figures

We consider dynamic equilibria for flows over time under the fluid queuing model. In this model, queues on the links of a network take care of flow propagation. Flow enters the network at a single source and leaves at a single sink. In a dynamic equilibrium, every infinitesimally small flow particle reaches the sink as early as possible given the pattern of the rest of the flow. While this model has been examined for many decades, progress has been relatively recent. In particular, the derivatives of dynamic equilibria have been characterized as thin flows with resetting, which allowed for more structural results. Our two main results are based on the formulation of thin flows with resetting as linear complementarity problem and its analysis. We present a constructive proof of existence for dynamic equilibria if the inflow rate is right-monotone. The complexity of computing thin flows with resetting, which occurs as a subproblem in this method, is still open. We settle it for the class of two-terminal series-parallel networks by giving a recursive algorithm that solves the problem for all flow values simultaneously in polynomial time.

This project aims to model the behavior of celestial objects through code written in MATLAB and Julia. The software developed by this project is intended to be used as a tool in the field of astrodynamics for use in mission planning and future research. Versions of the software are developed in both MATLAB and Julia to assess the accuracy and efficiency of the programs. The final goal is to develop a library of functions in Julia that are computationally faster than MATLAB. Current research will implement Polyhedron Gravitational modeling and Geometric Albedo functions into the Julia and MATLAB programs. The Polyhedron Gravitational modeling is intended to provide an accurate analysis of the gravitational attraction of nonspherical bodies such as asteroids, comets, and small moons. The Geometric Albedo is the ratio of a body’s brightness referenced at a zero phase angle to that of a perfectly reflective and ideally flat disk, and can be used to estimate of the size of a celestial body by analyzing its thermal history. POSTER PRESENTATION IGNITE AWARD

[EN] Introduction: The pathophysiological process of Alzheimer's disease is thought to begin years before clinical decline, with evidence suggesting prion-like spreading processes of neurofibrillary tangles and amyloid plaques. Methods: Using diffusion magnetic resonance imaging data from the Alzheimer's Disease Neuroimaging Initiative database, we first identified relevant features for dementia diagnosis. We then created dynamic models with the Nathan Kline Institute-Rockland Sample database to estimate the earliest detectable stage associated with dementia in the simulated disease progression. Results: A classifier based on centrality measures provides informative predictions. Strength and closeness centralities are the most discriminative features, which are associated with the medial temporal lobe and subcortical regions, together with posterior and occipital brain regions. Our model simulations suggest that changes associated with dementia begin to manifest structurally at early stages. Discussion: Our analyses suggest that diffusion magnetic resonance imaging-based centrality measures can offer a tool for early disease detection before clinical dementia onset.

Population-based evolutionary algorithms have great potential to handle multiobjective optimisation problems. However, these algorithms depends largely on problem characteristics, and there is a need to improve their performance for a wider range of problems. References, which are often specified by the decision maker's preference in different forms, are a very effective method to improve the performance of algorithms but have not been fully explored in literature. This paper proposes a novel framework for effective use of references to strengthen algorithms. This framework considers references as search targets which can be adjusted based on the information collected during the search. The proposed framework is combined with new strategies, such as reference adaptation and adaptive local mating, to solve different types of problems. The proposed algorithm is compared with state of the arts on a wide range of problems with diverse characteristics. The comparison and extensive sensitivity analysis demonstrate that the proposed algorithm is competitive and robust across different types of problems studied in this paper.

Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, \unlhd)$. A job $j \in N$ is available for scheduling, if all jobs $i \in N$ with $i \unlhd j$ are completed. Further, each job $j \in N$ is assigned real valued costs $c_{j}$, which can be negative or positive. A schedule is an ordering $j_{1}, \dots, j_{\vert N \vert}$ of all jobs in $N$. The budget of a schedule is the external investment needed to complete all jobs, i.e., it is $\max_{l \in \{0, \dots, \vert N \vert \} } \sum_{1 \le k \le l} c_{j_{k}}$. The goal is to find a schedule with minimum budget. Rafiey et al. (2015) showed that Budget Minimization is NP-hard following from a reduction from a molecular folding problem. We extend this result and prove that it is NP-hard to $\alpha(N)$-approximate the minimum budget even on bipartite partial orders. We present structural insights that lead to arguably simpler algorithms and extensions of the results by Rafiey et al. (2015). In particular, we show that there always exists an optimal solution that partitions the set of jobs and schedules each subset independently of the other jobs. We use this structural insight to derive polynomial-time algorithms that solve the problem to optimality on series-parallel and convex bipartite partial orders.

Dynamic multiobjective optimisation has gained increasing attention in recent years. Test problems are of great importance in order to facilitate the development of advanced algorithms that can handle dynamic environments well. However, many of existing dynamic multiobjective test problems have not been rigorously constructed and analysed, which may induce some unexpected bias when they are used for algorithmic analysis. In this paper, some of these biases are identified after a review of widely used test problems. These include poor scalability of objectives and, more importantly, problematic overemphasis of static properties rather than dynamics making it difficult to draw accurate conclusion about the strengths and weaknesses of the algorithms studied. A diverse set of dynamics and features is then highlighted that a good test suite should have. We further develop a scalable continuous test suite, which includes a number of dynamics or features that have been rarely considered in literature but frequently occur in real life. It is demonstrated with empirical studies that the proposed test suite is more challenging to the dynamic multiobjective optimisation algorithms found in the literature. The test suite can also test algorithms in ways that existing test suites can not., Comment: 19 pages, 22 figures and 7 tables

In today's society there is a comprehensive health trend in the food industry. New products associated with exercise and health are frequently introduced to the market. One of these products is the “functional drink”. The functional drink is an energy drink made of good and natural ingredients produced for consumers who are well aware of what they consume. Most functional drinks contain basically the same substances, but observations indicate that some brands are consumed more than others. This lead to the study's questions; "What are the main reasons for choosing a specific brand of functional drinks?" And "What impacts the popularity of a popular brand?" Based on the study, conclusions were drawn that some respondents reasoned more and less when choosing a brand. Some had clear needs and expectations while others only consumed a specific brand because of the social environment. The reason of consumption was often that the products gave energy, enhanced the performance during physical training and was seen as a better alternative than soda. Furthermore, the result of the study shows that the decisive factors in the selection were the following: marketing, brand's reasonable price, good flavors that fit the seasons, ease of access, inspirational influencers, associated with fitness and a positive word of mouth.

The $k$ disjoint shortest paths problem ($k$-DSPP) on a graph with $k$ source-sink pairs $(s_i, t_i)$ asks for the existence of $k$ pairwise edge- or vertex-disjoint shortest $s_i$-$t_i$-paths. It is known to be NP-complete if $k$ is part of the input. Restricting to $2$-DSPP with strictly positive lengths, it becomes solvable in polynomial time. We extend this result by allowing zero edge lengths and give a polynomial time algorithm based on dynamic programming for $2$-DSPP on undirected graphs with non-negative edge lengths., Comment: 6 pages, 4 figures

In this European multicenter project REACH-Responsive Engagement of the older adults promoting Activity and Customized Health care (REACH), a sensing-monitoring-intervention system is being developed that can be placed in an unobtrusive manner in various care settings and living environments of the older adults. In order to develop such a complex user-centered system, experts from several professions needed to collaborate in a joint development team. To have a successful development progress, it is essential to perform requirement specification and analysis in the beginning of the project. A description of the targeted end-user including the user environment and an analysis of the entities associated with the user and thus associated with the system is needed. Different methods are used to describe and analyze these important components of the REACH system, such as describing use cases, creating personas, developing experience maps, and defining and analyzing stakeholders. The methods used are described and the findings are reported.

The graph theoretical analysis of structural magnetic resonance imaging (MRI) data has received a great deal of interest in recent years to characterize the organizational principles of brain networks and their alterations in psychiatric disorders, such as schizophrenia. However, the characterization of networks in clinical populations can be challenging, since the comparison of connectivity between groups is influenced by several factors, such as the overall number of connections and the structural abnormalities of the seed regions. To overcome these limitations, the current study employed the whole-brain analysis of connectional fingerprints in diffusion tensor imaging data obtained at 3 T of chronic schizophrenia patients = 16) and healthy, age-matched control participants (n = 17). Probabilistic tractography was performed to quantify the connectivity of 110 brain areas. The connectional fingerprint of a brain area represents the set of relative connection probabilities to all its target areas and is, hence, less affected by overall white and gray matter changes than absolute connectivity measures. After detecting brain regions with abnormal connectional fingerprints through similarity measures, we tested each of its relative connection probability between groups. We found altered connectional fingerprints in schizophrenia patients consistent with a dysconnectivity syndrome. While the medial frontal gyrus showed only reduced connectivity, the connectional fingerprints of the inferior frontal gyrus and the putamen mainly contained relatively increased connection probabilities to areas in the frontal, limbic, and subcortical areas. These findings are in line with previous studies that reported abnormalities in striatal-frontal circuits in the pathophysiology of schizophrenia, highlighting the potential utility of connectional fingerprints for the analysis of anatomical networks in the disorder.

The graph theoretical analysis of structural magnetic resonance imaging (MRI) data has received a great deal of interest in recent years to characterize the organizational principles of brain networks and their alterations in psychiatric disorders, such as schizophrenia. However, the characterization of networks in clinical populations can be challenging, since the comparison of connectivity between groups is influenced by several factors, such as the overall number of connections and the structural abnormalities of the seed regions. To overcome these limitations, the current study employed the whole-brain analysis of connectional fingerprints in diffusion tensor imaging data obtained at 3 T of chronic schizophrenia patients (n = 16) and healthy, age-matched control participants (n = 17). Probabilistic tractography was performed to quantify the connectivity of 110 brain areas. The connectional fingerprint of a brain area represents the set of relative connection probabilities to all its target areas and is, hence, less affected by overall white and gray matter changes than absolute connectivity measures. After detecting brain regions with abnormal connectional fingerprints through similarity measures, we tested each of its relative connection probability between groups. We found altered connectional fingerprints in schizophrenia patients consistent with a dysconnectivity syndrome. While the medial frontal gyrus showed only reduced connectivity, the connectional fingerprints of the inferior frontal gyrus and the putamen mainly contained relatively increased connection probabilities to areas in the frontal, limbic, and subcortical areas. These findings are in line with previous studies that reported abnormalities in striatal–frontal circuits in the pathophysiology of schizophrenia, highlighting the potential utility of connectional fingerprints for the analysis of anatomical networks in the disorder.

Computer simulations have become a very powerful tool for scientific research. In order to facilitate research in computational biology, the BioDynaMo project aims at a general platform for biological computer simulations, which should be executable on hybrid cloud computing systems. This paper describes challenges and lessons learnt during the early stages of the software development process, in the context of implementation issues and the international nature of the collaboration., Comment: 4th Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE4), 2016

Computer simulations have become a very powerful tool for scientific research. Given the vast complexity that comes with many open scientific questions, a purely analytical or experimental approach is often not viable. For example, biological systems (such as the human brain) comprise an extremely complex organization and heterogeneous interactions across different spatial and temporal scales. In order to facilitate research on such problems, the BioDynaMo project (\url{https://biodynamo.web.cern.ch/}) aims at a general platform for computer simulations for biological research. Since the scientific investigations require extensive computer resources, this platform should be executable on hybrid cloud computing systems, allowing for the efficient use of state-of-the-art computing technology. This paper describes challenges during the early stages of the software development process. In particular, we describe issues regarding the implementation and the highly interdisciplinary as well as international nature of the collaboration. Moreover, we explain the methodologies, the approach, and the lessons learnt by the team during these first stages.

Evidence from anatomical and functional imaging studies have highlighted major modifications of cortical circuits during adolescence. These include reductions of gray matter (GM), increases in the myelination of cortico-cortical connections and changes in the architecture of large-scale cortical networks. It is currently unclear, however, how the ongoing developmental processes impact upon the folding of the cerebral cortex and how changes in gyrification relate to maturation of GM/WM-volume, thickness and surface area. In the current study, we acquired high-resolution (3 Tesla) magnetic resonance imaging (MRI) data from 79 healthy subjects (34 males and 45 females) between the ages of 12 and 23 years and performed whole brain analysis of cortical folding patterns with the gyrification index (GI). In addition to GI-values, we obtained estimates of cortical thickness, surface area, GM and white matter (WM) volume which permitted correlations with changes in gyrification. Our data show pronounced and widespread reductions in GI-values during adolescence in several cortical regions which include precentral, temporal and frontal areas. Decreases in gyrification overlap only partially with changes in the thickness, volume and surface of GM and were characterized overall by a linear developmental trajectory. Our data suggest that the observed reductions in GI-values represent an additional, important modification of the cerebral cortex during late brain maturation which may be related to cognitive development.

Local field potentials (LFPs) sampled with extracellular electrodes are frequently used as a measure of population neuronal activity. However, relating such measurements to underlying neuronal behaviour and connectivity is non-trivial. To help study this link, we developed the Virtual Electrode Recording Tool for EXtracellular potentials (VERTEX). We first identified a reduced neuron model that retained the spatial and frequency filtering characteristics of extracellular potentials from neocortical neurons. We then developed VERTEX as an easy-to-use Matlab tool for simulating LFPs from large populations (>100 000 neurons). A VERTEX-based simulation successfully reproduced features of the LFPs from an in vitro multi-electrode array recording of macaque neocortical tissue. Our model, with virtual electrodes placed anywhere in 3D, allows direct comparisons with the in vitro recording setup. We envisage that VERTEX will stimulate experimentalists, clinicians, and computational neuroscientists to use models to understand the mechanisms underlying measured brain dynamics in health and disease., Comment: appears in Brain Struct Funct 2014

Disease spreading through human travel networks has been a topic of great interest in recent years, as witnessed during outbreaks of influenza A (H1N1) or SARS pandemics. One way to stop spreading over the airline network are travel restrictions for major airports or network hubs based on the total number of passengers of an airport. Here, we test alternative strategies using edge removal, cancelling targeted flight connections rather than restricting traffic for network hubs, for controlling spreading over the airline network. We employ a SEIR metapopulation model that takes into account the population of cities, simulates infection within cities and across the network of the top 500 airports, and tests different flight cancellation methods for limiting the course of infection. The time required to spread an infection globally, as simulated by a stochastic global spreading model was used to rank the candidate control strategies. The model includes both local spreading dynamics at the level of populations and long-range connectivity obtained from real global airline travel data. Simulated spreading in this network showed that spreading infected 37% less individuals after cancelling a quarter of flight connections between cities, as selected by betweenness centrality. The alternative strategy of closing down whole airports causing the same number of cancelled connections only reduced infections by 18%. In conclusion, selecting highly ranked single connections between cities for cancellation was more effective, resulting in fewer individuals infected with influenza, compared to shutting down whole airports. It is also a more efficient strategy, affecting fewer passengers while producing the same reduction in infections. The network of connections between the top 500 airports is available under the resources link on our website http://www.biological-networks.org., Comment: The network of connections between the top 500 airports is available under the resources link on our website http://www.biological-networks.org. Flight connections for the top 500 airports, based on total passenger volume, worldwide. The existence of flight connections between airports is based on flights within one year from 1 July 2007 to 30 June 2008

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks., Comment: 16 pages (4 figures) plus supporting information 8 pages (5 figures)

High-throughput methods for yielding the set of connections in a neural system, the connectome, are now being developed. This tutorial describes ways to analyze the topological and spatial organization of the connectome at the macroscopic level of connectivity between brain regions as well as the microscopic level of connectivity between neurons. We will describe topological features at three different levels: the local scale of individual nodes, the regional scale of sets of nodes, and the global scale of the complete set of nodes in a network. Such features can be used to characterize components of a network and to compare different networks, e.g. the connectome of patients and control subjects for clinical studies. At the global scale, different types of networks can be distinguished and we will describe Erd\"os-R\'enyi random, scale-free, small-world, modular, and hierarchical archetypes of networks. Finally, the connectome also has a spatial organization and we describe methods for analyzing wiring lengths of neural systems. As an introduction for new researchers in the field of connectome analysis, we discuss the benefits and limitations of each analysis approach., Comment: Neuroimage, in press

Fifty years ago, John von Neumann compared the architecture of the brain with that of computers that he invented and which is still in use today. In those days, the organisation of computers was based on concepts of brain organisation. Here, we give an update on current results on the global organisation of neural systems. For neural systems, we outline how the spatial and topological architecture of neuronal and cortical networks facilitates robustness against failures, fast processing, and balanced network activation. Finally, we discuss mechanisms of self-organization for such architectures. After all, the organization of the brain might again inspire computer architecture.

Network science provides a general framework for analysing the large-scale brain networks that naturally arise from modern neuroimaging studies, and a key goal in theoretical neuroscience is to understand the extent to which these neural architectures influence the dynamical processes they sustain. To date, brain network modelling has largely been conducted at the macroscale level (\emph{i.e.} white-matter tracts), despite growing evidence of the role that local grey matter architecture plays in a variety of brain disorders. Here, we present a new model of intrinsic grey matter connectivity of the human connectome. Importantly, the new model incorporates detailed information on cortical geometry to construct `shortcuts' through the thickness of the cortex, thus enabling spatially distant brain regions, as measured along the cortical surface, to communicate. Our study indicates that structures based on human brain surface information differ significantly, both in terms of their topological network characteristics and activity propagation properties, when compared against a variety of alternative geometries and generative algorithms. In particular, this might help explain histological patterns of grey matter connectivity, highlighting that observed connection distances may have arisen to maximise information processing ability, and that such gains are consistent with (and enhanced by) the presence of short-cut connections.

The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical studies bear little relation to the spatial embedding or connectivity of the neural networks that they attempt to replicate. Here, we employ detailed neuroimaging data to define a network whose spatial embedding represents accurately the folded structure of the cortical surface of a rat and investigate the propagation of activity over this network under simple spreading and connectivity rules. By comparison with standard network models with the same coarse statistics, we show that the cortical geometry influences profoundly the speed propagation of activation through the network. Our conclusions are of high relevance to the theoretical modelling of epileptic seizure events, and indicate that such studies which omit physiological network structure risk simplifying the dynamics in a potentially significant way.

Network science provides a general framework for analysing the large-scale brain networks that naturally arise from modern neuroimaging studies, and a key goal in theoretical neuroscience is to understand the extent to which these neural architectures influence the dynamical processes they sustain. To date, brain network modelling has largely been conducted at the macroscale level (\emph{i.e.} white-matter tracts), despite growing evidence of the role that local grey matter architecture plays in a variety of brain disorders. Here, we present a new model of intrinsic grey matter connectivity of the human connectome. Importantly, the new model incorporates detailed information on cortical geometry to construct `shortcuts' through the thickness of the cortex, thus enabling spatially distant brain regions, as measured along the cortical surface, to communicate. Our study indicates that structures based on human brain surface information differ significantly, both in terms of their topological network characteristics and activity propagation properties, when compared against a variety of alternative geometries and generative algorithms. In particular, this might help explain histological patterns of grey matter connectivity, highlighting that observed connection distances may have arisen to maximise information processing ability, and that such gains are consistent with (and enhanced by) the presence of short-cut connections.

The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical studies bear little relation to the spatial embedding or connectivity of the neural networks that they attempt to replicate. Here, we employ detailed neuroimaging data to define a network whose spatial embedding represents accurately the folded structure of the cortical surface of a rat and investigate the propagation of activity over this network under simple spreading and connectivity rules. By comparison with standard network models with the same coarse statistics, we show that the cortical geometry influences profoundly the speed propagation of activation through the network. Our conclusions are of high relevance to the theoretical modelling of epileptic seizure events, and indicate that such studies which omit physiological network structure risk simplifying the dynamics in a potentially significant way.

Dynamic multiobjective optimization (DMO) has gained increasing attention in recent years. Test problems are of great importance in order to facilitate the development of advanced algorithms that can handle dynamic environments well. However, many of the existing dynamic multiobjective test problems have not been rigorously constructed and analyzed, which may induce some unexpected bias when they are used for algorithmic analysis. In this paper, some of these biases are identified after a review of widely used test problems. These include poor scalability of objectives and, more importantly, problematic overemphasis of static properties rather than dynamics making it difficult to draw accurate conclusion about the strengths and weaknesses of the algorithms studied. A diverse set of dynamics and features are then highlighted that a good test suite should have. We further develop a scalable continuous test suite, which includes a number of dynamics or features that have been rarely considered in literature but frequently occur in real life. It is demonstrated with empirical studies that the proposed test suite are more challenging to the DMO algorithms found in the literature. The test suite can also test algorithms in ways that existing test suites cannot.

Network science provides a general framework for analysing the large-scale brain networks that naturally arise from modern neuroimaging studies, and a key goal in theoretical neuroscience is to understand the extent to which these neural architectures influence the dynamical processes they sustain. To date, brain network modelling has largely been conducted at the macroscale level (\emph{i.e.} white-matter tracts), despite growing evidence of the role that local grey matter architecture plays in a variety of brain disorders. Here, we present a new model of intrinsic grey matter connectivity of the human connectome. Importantly, the new model incorporates detailed information on cortical geometry to construct `shortcuts' through the thickness of the cortex, thus enabling spatially distant brain regions, as measured along the cortical surface, to communicate. Our study indicates that structures based on human brain surface information differ significantly, both in terms of their topological network characteristics and activity propagation properties, when compared against a variety of alternative geometries and generative algorithms. In particular, this might help explain histological patterns of grey matter connectivity, highlighting that observed connection distances may have arisen to maximise information processing ability, and that such gains are consistent with (and enhanced by) the presence of short-cut connections.

The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical studies bear little relation to the spatial embedding or connectivity of the neural networks that they attempt to replicate. Here, we employ detailed neuroimaging data to define a network whose spatial embedding represents accurately the folded structure of the cortical surface of a rat and investigate the propagation of activity over this network under simple spreading and connectivity rules. By comparison with standard network models with the same coarse statistics, we show that the cortical geometry influences profoundly the speed propagation of activation through the network. Our conclusions are of high relevance to the theoretical modelling of epileptic seizure events, and indicate that such studies which omit physiological network structure risk simplifying the dynamics in a potentially significant way.

Network science provides a general framework for analysing the large-scale brain networks that naturally arise from modern neuroimaging studies, and a key goal in theoretical neuroscience is to understand the extent to which these neural architectures influence the dynamical processes they sustain. To date, brain network modelling has largely been conducted at the macroscale level (\emph{i.e.} white-matter tracts), despite growing evidence of the role that local grey matter architecture plays in a variety of brain disorders. Here, we present a new model of intrinsic grey matter connectivity of the human connectome. Importantly, the new model incorporates detailed information on cortical geometry to construct `shortcuts' through the thickness of the cortex, thus enabling spatially distant brain regions, as measured along the cortical surface, to communicate. Our study indicates that structures based on human brain surface information differ significantly, both in terms of their topological network characteristics and activity propagation properties, when compared against a variety of alternative geometries and generative algorithms. In particular, this might help explain histological patterns of grey matter connectivity, highlighting that observed connection distances may have arisen to maximise information processing ability, and that such gains are consistent with (and enhanced by) the presence of short-cut connections.

The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical studies bear little relation to the spatial embedding or connectivity of the neural networks that they attempt to replicate. Here, we employ detailed neuroimaging data to define a network whose spatial embedding represents accurately the folded structure of the cortical surface of a rat and investigate the propagation of activity over this network under simple spreading and connectivity rules. By comparison with standard network models with the same coarse statistics, we show that the cortical geometry influences profoundly the speed propagation of activation through the network. Our conclusions are of high relevance to the theoretical modelling of epileptic seizure events, and indicate that such studies which omit physiological network structure risk simplifying the dynamics in a potentially significant way.

Network science provides a general framework for analysing the large-scale brain networks that naturally arise from modern neuroimaging studies, and a key goal in theoretical neuroscience is to understand the extent to which these neural architectures influence the dynamical processes they sustain. To date, brain network modelling has largely been conducted at the macroscale level (\emph{i.e.} white-matter tracts), despite growing evidence of the role that local grey matter architecture plays in a variety of brain disorders. Here, we present a new model of intrinsic grey matter connectivity of the human connectome. Importantly, the new model incorporates detailed information on cortical geometry to construct `shortcuts' through the thickness of the cortex, thus enabling spatially distant brain regions, as measured along the cortical surface, to communicate. Our study indicates that structures based on human brain surface information differ significantly, both in terms of their topological network characteristics and activity propagation properties, when compared against a variety of alternative geometries and generative algorithms. In particular, this might help explain histological patterns of grey matter connectivity, highlighting that observed connection distances may have arisen to maximise information processing ability, and that such gains are consistent with (and enhanced by) the presence of short-cut connections.

The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical studies bear little relation to the spatial embedding or connectivity of the neural networks that they attempt to replicate. Here, we employ detailed neuroimaging data to define a network whose spatial embedding represents accurately the folded structure of the cortical surface of a rat and investigate the propagation of activity over this network under simple spreading and connectivity rules. By comparison with standard network models with the same coarse statistics, we show that the cortical geometry influences profoundly the speed propagation of activation through the network. Our conclusions are of high relevance to the theoretical modelling of epileptic seizure events, and indicate that such studies which omit physiological network structure risk simplifying the dynamics in a potentially significant way.