Multinationals, technology networks and international takeovers

We formulate a knowlegde--based model of direct investment through mergers and acquisitions. M&As are realized to create comparative advantages by exploiting international synergies and appropriating local technology spillovers requiring geographical proximity, but can also represent a strategic response to the presence of a multinational rival. The takeover fee paid tends to increase with the strength of local spillovers which can thus work against multinationalization. Seller's bargaining power increases the takeover fee, but does not influence the investment decision. We characterize losers and winners from multinationalization, and show that foreign investment stimulates research but could result in a synergy trap reducing multinationals' profits.

Informal care and labour force participation among middle-aged women in Spain

Informal care is today the form of support most commonly used by those who need other peoplein order to carry out certain activities that are considered basic (eating, dressing, taking a shower,etc.), in Spain and in most other countries in the region. The possible labour opportunity costsincurred by these informal carers, the vast majority of whom are middle-aged women, have not asyet been properly quantified in Spain. It is, however, crucially important to know these quantities ata time when public authorities appear to be determined to extend the coverage offered up to nowas regards long-term care.In this context, we use the Spanish subsample of the European Community Household Panel (1994-2001) to estimate a dynamic ordered probit and so attempt to examine the effects of various typesof informal care on labour behaviour. The results obtained indicate the existence of labouropportunity costs for those women who live with the dependent person they care for, but not forthose who care for someone outside the household. Furthermore, whereas caregiving for morethan a year has negative effects on labour force participation, the same cannot be said of those who start caregiving and stop caregiving .

Buffer Capacity Allocation: A method to QoS support on MPLS networks

This paper describes an optimized model to support QoS by mean of Congestion minimization on LSPs (Label Switching Path). In order to perform this model, we start from a CFA (Capacity and Flow Allocation) model. As this model does not consider the buffer size to calculate the capacity cost, our model- named BCA (Buffer Capacity Allocation)- take into account this issue and it improve the CFA performance. To test our proposal, we perform several simulations; results show that BCA model minimizes LSP congestion and uniformly distributes flows on the network

Estudi sobre el perfil de persones grans amb dependència del servei d'ajuda a domicili del Consell Comarcal d'Osona i el tipus de suport formal i informal

The aim of this study is to determine the profile of dependent elderly people users of the home care services (SAD) of the regional council in Osona (Consell Comarcal d´Osona) , and the characteristics of formal and informal types of support they use. Methodology. An observational study of a transversal format has been carried out, with retrospective and descriptive purposes. The target population is 63 people (26 men and 37 women) included in the program of the regional SAD They have a recognized dependence grade approved by the law 39 /2006, December 14th , promoting the individual autonomy and care of elderly people in a dependent situation. The data were collected by social workers of basic social services, first with a home visit and followed by handed out questionnaires, specifically designed for this study, in order to obtain information on socio-demographic characteristics, and the type of support formal and informal. The obtained results on the SAD users are women in a 58.7% and a 41.3 % are men. The 84% of the total sampling are 80 years old and more, being the average age of 85.2 years old. 45% of them are married, 41% are widows and widowers and 14% are single. 54% are rated with severe dependence (grade II), 42.8% with high dependence (grade III). 86% live accompanied. 100% have an informal caregiver and a 95% of the times, the caregiver is a relative who in 73% of the cases the dedication time is permanent. The coverage of the SAD has an average of 4.27 hours per week and per user. The formal services most used are the technical (62%), also the assessment of an occupational therapist at home (57%) and the telecare service in a (56%). Conclusions. The SAD is used primarily for women in an advanced age and severe dependence. The informal assistance structures have an informal caregiver, being a member of the family mostly, living with the dependent, and mainly in a permanent dedication basis. The SAD has a varied intensity in each case. The formal support services complementary to the SAD, are largely used in all cases.

Networks of people in specialty production: family firms in the iron and steel Wire industries in Spain (1870-2000)

Capital intensive industries in specialized niches of production have constituted solid ground for family firms in Spain , as evidenced by the experience of the iron and steel wire industries between 1870 and 2000. The embeddedness of these firms in their local and regional environments have allowed the creation of networks that, together with favourable institutional conditions, significantly explain the dominance of family entrepreneurship in iron and steel wire manufacturing in Spain, until the end of the 20 th century. Dominance of family firms at the regional level has not been not an obstacle for innovation in wire manufacturing in Spain, which has taken place even when institutional conditions blocked innovation and traditional networking. Therefore, economic theories about the difficulties dynastic family firms may have to perform appropriately in science-based industries must be questioned

Communication in networks with hierarchical branching

We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous phase transition between a sparse and a congested regime is observed and accurately described by an order parameter and the power spectra. At the critical point the behavior of the model is totally independent of the number of hierarchical levels. Also scaling properties are observed when the size of the system varies. The presence of noise in the communication is shown to break the transition. The analytical results are a useful guide to forecasting the main features of real networks.

Absence of epidemic threshold in scale free networks with degree correlations

Random scale-free networks have the peculiar property of being prone to the spreading of infections. Here we provide for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing. Degree correlations result therefore irrelevant for the epidemic spreading picture in these scale-free networks. The present result is related to the divergence of the average nearest neighbors degree, enforced by the degree detailed balance condition.

Synchronization reveals topological scales in complex networks

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.

Self-similarity of complex networks and hidden metric spaces

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Percolation and epidemic thresholds in clustered networks

We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus extending this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.

Clustering in complex networks. I. General formalism

We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in that it involves the properties of two¿and not just one¿vertices. The formalism is completed with the definition of a three-vertex correlation function, which is the fundamental quantity describing the properties of clustered networks. The formalism suggests different metrics that are able to thoroughly characterize transitive relations. A rigorous analysis of several real networks, which makes use of this formalism and the metrics, is also provided. It is also found that clustered networks can be classified into two main groups: the weak and the strong transitivity classes. In the first class, edge multiplicity is small, with triangles being disjoint. In the second class, edge multiplicity is high and so triangles share many edges. As we shall see in the following paper, the class a network belongs to has strong implications in its percolation properties.

Generalized percolation in random directed networks

We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edgesthat is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.

Clustering in complex networks. II. Percolation properties

The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.