A fedezetlen bankközi forintpiac hálózati dinamikájának vizsgálata a likviditási válság előtt és után (Examination of the network dynamics of the uncovered interbank forint markel before the liquidity crisis and after)

A cikkben a magyar fedezetlen bankközi forintpiac hálózatának időbeli alakulását vizsgáljuk 2002 decemberétől 2009 márciusáig. Bemutatjuk a piac általános jellemzőit (forgalom, kamatláb, koncentráció stb.) és az alapvető hálózati mutatókat. Azt tapasztaljuk, hogy az időszak első felében ezek a jellemzők lényegében stabilak voltak. 2006-2007-től kezdve azonban a mutatók egy része kezdett jelentősen megváltozni: a hitelfelvevők koncentrációja nőtt, az átlagos közelség és az átlagos fokszám csökkent, továbbá a hálózat magjának mérete is csökkent. Ezek a jelek arra utalhatnak, hogy a bankok már a válság kitörése előtt érzékelték a növekvő hitelkockázatot, és egyre inkább megválogatták, hogy kinek adnak hitelt. Figyelemre méltó, hogy mindeközben az általános piaci mutatók (forgalom, kamatláb, illetve ezek volatilitása) semmiféle változásra utaló jelet nem tükröztek egészen 2008 októberéig, de ekkor hirtelen minden mutatóban egyértelművé vált a rezsimváltás. Végül részletesen elemezzük az egyes szereplők viselkedését, és megmutatjuk, hogy válságban az egyes szerepek drasztikusan megváltoztak (például forrásokból nyelők lettek, és fordítva). / === / The article examines the changes in the network of Hungary's uncovered interbank forint market over the period Decembcr 2000 to March 2009. It presents the general features of the market (volume, interest rates, concentration etc.) and its basic network. It is found that the features were largely stable in the first half of the period, but some of the indicators began to change significantly in 2006-7: the concentration of borrowers incrcased, average distance and average degree declined, as did the size of the core of the network. These signs pointed to the fact that the banks had sensed an increase in credit risk even before the crisis broke and were becoming increasingly choosy selective in their lending. Meanwhile, however. there aerc no indications of change in the general market indicators (volume, interest rates, or volatility of these) right up to October 2008, when the change of regime was clear in all indicators. Finally, the authors analyse in detail the behaviour of each participant and show that thc roles of some altered drastically with the crisis (e.g. sources became consumers and vice versa).

Predictive compensation for variable network delays and packet losses in networked control systems

Networked control systems (NCSs) offer many advantages over conventional control; however, they also demonstrate challenging problems such as network-induced delay and packet losses. This paper proposes an approach of predictive compensation for simultaneous network-induced delays and packet losses. Different from the majority of existing NCS control methods, the proposed approach addresses co-design of both network and controller. It also alleviates the requirements of precise process models and full understanding of NCS network dynamics. For a series of possible sensor-to-actuator delays, the controller computes a series of corresponding redundant control values. Then, it sends out those control values in a single packet to the actuator. Once receiving the control packet, the actuator measures the actual sensor-to-actuator delay and computes the control signals from the control packet. When packet dropout occurs, the actuator utilizes past control packets to generate an appropriate control signal. The effectiveness of the approach is demonstrated through examples.

Glassy behavior in neural network models of associative memory

Neural network models of associative memory exhibit a large number of spurious attractors of the network dynamics which are not correlated with any memory state. These spurious attractors, analogous to "glassy" local minima of the energy or free energy of a system of particles, degrade the performance of the network by trapping trajectories starting from states that are not close to one of the memory states. Different methods for reducing the adverse effects of spurious attractors are examined with emphasis on the role of synaptic asymmetry. (C) 2002 Elsevier Science B.V. All rights reserved.

The design algorithm of an associative memory neural network

A design algorithm of an associative memory neural network is proposed. The benefit of this design algorithm is to make the designed associative memory model can implement the hoped situation. On the one hand, the designed model has realized the nonlinear association of infinite value pattern from n dimension space to m dimension space. The result has improved the ones of some old associative memory neural network. On the other hand, the memory samples are in the centers of the fault-tolerant. In average significance the radius of the memory sample fault-tolerant field is maximum.

Phase transitions and nonlinear phenomena in neuronal network models

Communication and cooperation between billions of neurons underlie the power of the brain. How do complex functions of the brain arise from its cellular constituents? How do groups of neurons self-organize into patterns of activity? These are crucial questions in neuroscience. In order to answer them, it is necessary to have solid theoretical understanding of how single neurons communicate at the microscopic level, and how cooperative activity emerges. In this thesis we aim to understand how complex collective phenomena can arise in a simple model of neuronal networks. We use a model with balanced excitation and inhibition and complex network architecture, and we develop analytical and numerical methods for describing its neuronal dynamics. We study how interaction between neurons generates various collective phenomena, such as spontaneous appearance of network oscillations and seizures, and early warnings of these transitions in neuronal networks. Within our model, we show that phase transitions separate various dynamical regimes, and we investigate the corresponding bifurcations and critical phenomena. It permits us to suggest a qualitative explanation of the Berger effect, and to investigate phenomena such as avalanches, band-pass filter, and stochastic resonance. The role of modular structure in the detection of weak signals is also discussed. Moreover, we find nonlinear excitations that can describe paroxysmal spikes observed in electroencephalograms from epileptic brains. It allows us to propose a method to predict epileptic seizures. Memory and learning are key functions of the brain. There are evidences that these processes result from dynamical changes in the structure of the brain. At the microscopic level, synaptic connections are plastic and are modified according to the dynamics of neurons. Thus, we generalize our cortical model to take into account synaptic plasticity and we show that the repertoire of dynamical regimes becomes richer. In particular, we find mixed-mode oscillations and a chaotic regime in neuronal network dynamics.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

Modeling connectivity in terms of network activity

A new complex network model is proposed which is founded on growth, with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert static model. By using several topological measurements, as well as optimal multivariate methods (canonical analysis and maximum likelihood decision), we show that this new model provides, among several other theoretical kinds of networks including Watts-Strogatz small-world networks, the greatest compatibility with three real-world cortical networks.

A comparative tunnelling network approach to assess interspecific competition effects in termites

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Collaborative Change: Environmental Jolt, Network (Re)Design and Firm Performance

Motivated by the need to understand which are the underlying forces that trigger network evolution, we develop a multilevel theoretical and empirically testable model to examine the relationship between changes in the external environment and network change. We refer to network change as the dissolution or replacement of an interorganizational tie, adding also the case of the formation of new ties with new or preexisting partners. Previous research has paid scant attention to the organizational consequences of quantum change enveloping entire industries in favor of an emphasis on continuous change. To highlight radical change we introduce the concept of environmental jolt. The September 11 terrorist attacks provide us with a natural experiment to test our hypotheses on the antecedents and the consequences of network change. Since network change can be explained at multiple levels, we incorporate firm-level variables as moderators. The empirical setting is the global airline industry, which can be regarded as a constantly changing network of alliances. The study reveals that firms react to environmental jolts by forming homophilous ties and transitive triads as opposed to the non jolt periods. Moreover, we find that, all else being equal, firms that adopt a brokerage posture will have positive returns. However, we find that in the face of an environmental jolt brokerage relates negatively to firm performance. Furthermore, we find that the negative relationship between brokerage and performance during an environmental jolt is more significant for larger firms. Our findings suggest that jolts are an important predictor of network change, that they significantly affect operational returns and should be thus incorporated in studies of network dynamics.

Memory from the dynamics of intrinsic membrane currents

Almost all theoretical and experimental studies of the mechanisms underlying learning and memory focus on synaptic efficacy and make the implicit assumption that changes in synaptic efficacy are both necessary and sufficient to account for learning and memory. However, network dynamics depends on the complex interaction between intrinsic membrane properties and synaptic strengths and time courses. Furthermore, neuronal activity itself modifies not only synaptic efficacy but also the intrinsic membrane properties of neurons. This paper presents examples demonstrating that neurons with complex temporal dynamics can provide short-term “memory” mechanisms that rely solely on intrinsic neuronal properties. Additionally, we discuss the potential role that activity may play in long-term modification of intrinsic neuronal properties. While not replacing synaptic plasticity as a powerful learning mechanism, these examples suggest that memory in networks results from an ongoing interplay between changes in synaptic efficacy and intrinsic membrane properties.

Multidimensionality of Actors in Business Networks: The Influence of Social Action in Pharmacy Networks in Finland

In the markets-as-networks approach business networks are conceived as dynamic actor structures, giving focus to exchange relationships and actors’ capabilities to control and co-ordinate activities and resources. Researchers have shared an understanding that actors’ actions are crucial for the development of business networks and for network dynamics. However, researchers have mainly studied firms as business actors and excluded individuals, although both firms and individuals can be seen as business actors. This focus on firms as business actors has resulted in a paucity of research on human action and the exchange of intangible resources in business networks, e.g. social exchange between individuals in social networks. Consequently, the current conception of business networks fails to appreciate the richness of business actors, the human character of business action and the import of social action in business networks. The central assumption in this study is that business actors are multidimensional and that their specific constitution in any given situation is determined by human interaction in social networks. Multidimensionality is presented as a concept for exploring how business actors act in different situations and how actors simultaneously manage multiple identities: individual, organisational, professional, business and network identities. The study presents a model that describes the multidimensionality of actors in business networks and conceptualises the connection between social exchange and human action in business networks. Empirically the study explores the change that has taken place in pharmaceutical retailing in Finland during recent years. The phenomenon of emerging pharmacy networks is highly contemporary in the Nordic countries, where the traditional license-based pharmacy business is changing. The study analyses the development of two Finnish pharmacy chains, one integrated and one voluntary chain, and the network structures and dynamics in them. Social Network Analysis is applied to explore the social structures within the pharmacy networks. The study shows that emerging pharmacy networks are multifaceted phenomena where political, economic, social, cultural, and historical elements together contribute to the observed changes. Individuals have always been strongly present in the pharmacy business and the development of pharmacy networks provides an interesting example of human actors’ influence in the development of business networks. The dynamics or forces driving the network development can be linked to actors’ own economic and social motives for developing the business. The study highlights the central role of individuals and social networks in the development of the two studied pharmacy networks. The relation between individuals and social networks is reciprocal. The social context of every individual enables multidimensional business actors. The mix of various identities, both individual and collective identities, is an important part of network dynamics. Social networks in pharmacy networks create a platform for exchange and social action, and social networks enable and support business network development.

Viability Conditions for a Compartmentalized Protometabolic System: A Semi-Empirical Approach

In this work we attempt to find out the extent to which realistic prebiotic compartments, such as fatty acid vesicles, would constrain the chemical network dynamics that could have sustained a minimal form of metabolism. We combine experimental and simulation results to establish the conditions under which a reaction network with a catalytically closed organization (more specifically, an (M, R)-system) would overcome the potential problem of self-suffocation that arises from the limited accessibility of nutrients to its internal reaction domain. The relationship between the permeability of the membrane, the lifetime of the key catalysts and their efficiency (reaction rate enhancement) turns out to be critical. In particular, we show how permeability values constrain the characteristic time scale of the bounded protometabolic processes. From this concrete and illustrative example we finally extend the discussion to a wider evolutionary context.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Optimal recall from bounded metaplastic synapses: predicting functional adaptations in hippocampal area CA3.

A venerable history of classical work on autoassociative memory has significantly shaped our understanding of several features of the hippocampus, and most prominently of its CA3 area, in relation to memory storage and retrieval. However, existing theories of hippocampal memory processing ignore a key biological constraint affecting memory storage in neural circuits: the bounded dynamical range of synapses. Recent treatments based on the notion of metaplasticity provide a powerful model for individual bounded synapses; however, their implications for the ability of the hippocampus to retrieve memories well and the dynamics of neurons associated with that retrieval are both unknown. Here, we develop a theoretical framework for memory storage and recall with bounded synapses. We formulate the recall of a previously stored pattern from a noisy recall cue and limited-capacity (and therefore lossy) synapses as a probabilistic inference problem, and derive neural dynamics that implement approximate inference algorithms to solve this problem efficiently. In particular, for binary synapses with metaplastic states, we demonstrate for the first time that memories can be efficiently read out with biologically plausible network dynamics that are completely constrained by the synaptic plasticity rule, and the statistics of the stored patterns and of the recall cue. Our theory organises into a coherent framework a wide range of existing data about the regulation of excitability, feedback inhibition, and network oscillations in area CA3, and makes novel and directly testable predictions that can guide future experiments.