Real world systems like biological, social, technological, infrastructural and many others can be modeled as networks. The field of network science aims to study these complex networks and understand their structure and dynamics. A common feature of networks across domains is the distribution of the degree of the nodes according to a power-law (scale invariance). As a consequence of this skewness, the high degree nodes dominate the properties of these networks. The rich-club phenomenon is observed when the high degree or the rich nodes of the network prefer to connect amongst themselves. In the first part, the thesis investigates the rich-club phenomenon in higher order neighborhoods of the network by providing an elegant quantification using a geodesic distance based approach. This quantification helped in identifying networks where the trend and intensity of the rich-club phenomenon is significantly different in higher order neighborhoods compared to the immediate neighbors. The thesis also proposes a quantification of the importance of the non-rich nodes in the communication structure of the rich nodes, and broadly classify networks into core-periphery or cellular. Further a lack of universality is noticed in the structure of the networks belonging to a particular domain. It has been observed in the previous literature that the rich club connectivity dominates assortativity, a measure quantifying the mixing patterns in complex networks. Thus, assortativity is biased. To overcome such drawbacks, in the second part of the thesis proposes a novel measure called regularity. The analytical bounds on regularity and formulation of regularity for different network models are provided. Along with this a measure to quantify the mixing patterns of the neighborhood of a node called local regularity is also defined. The analysis on real-world network based on local regularity and degree distribution shows presence of both type of network, uniformly and non-uniformly mixed across different regions. Further normalized regularity is proposed to quantify the extent of preferential mixing in networks discounting the effect of degree distribution.

The study of how social organizations work, change and develop is central to sociology and to our understanding of the social world and its transformations. At the same time, the underlying principles of organizational dynamics are extremely difficult to investigate. This is partly due to the difficulties of tracking organizations, individuals and their interactions over relatively long periods of time. But it is also due to limitations in the kinds of quantitative methods used to tackle these questions, which are for the most part based on regression analysis. This thesis seeks to improve our understanding of social organizing by using models to explore and describe the logics of the structures and mechanisms underlying organizational change. Particular emphasis is given to the modeling process, the use of new concepts and analogies, and the application of interdisciplinary methods to get new insights into classical sociological questions. The thesis consists of an introductory part and five studies (I-V). Using Swedish longitudinal data on employment in the Stockholm Region, the studies tackle different dimensions of organizational dynamics, from organizational structures and growth processes to labor mobility and employment trajectories. The introductory chapters contextualize the studies by providing an overview of theories, concepts and quantitative methods that are relevant for the modeling of organizational dynamics.  The five studies look into various aspects of organizational dynamics with the help of complementary data representations and non-traditional quantitative methods. Study I analyzes organizational growth statistics for different sectors and industries. The typically observed heavy-tailed statistical patterns for the size and growth rate distributions are broken down into a superposition of interorganizational movements. Study II models interorganizational movements as a labor flow network. Organizations tend to be more tightly linked if they belong to the same ownership sector. Additionally, public organizations have a more stable connection structure. Study III uses a similarity-based method called homogeneity analysis to map out the social space of large organizations in the Stockholm Region. A social distance is then derived within this space, and we find that the interorganizational movements analyzed in Studies I and II take place more often between organizations that are closer in social space and in the same network community. Study IV presents an approach to organizational dynamics based on sequences of employment states. Evidence for a positive feedback mechanism is found for large and highly sequence-diverse public organizations. Finally, Study V features an agent-based model where we simulate a social influence mechanism for organizational membership dynamics. We introduce a parameter analogous to a physical temperature to model contextual influence, and the familiar growth distributions are recovered as an intermediate case between extreme parameter values. The thesis as a whole provides suggestions for a more process-oriented modeling approach to social organizing that gives a more prominent role to the logics of organizational change. Finally, the series of methodological tools discussed can be useful for the analysis of many other social processes and more broadly for the development of quantitative sociological methods. / <p>At the time of the doctoral defense, the following papers were unpublished and had a status as follows: Paper 1: Manuscript. Paper 2: Manuscript. Paper 3: Manuscript. Paper 4: Manuscript.</p><p> </p>

Vom Standpunkt des Physikers aus gesehen, ist die Erde ein dynamisches System von großer Komplexität. Funktionale Netzwerke werden aus Beobachtungs-, und Modelldaten abgeleitet oder aufgrund theoretischer Überlegungen konstruiert. Indem sie statistische Zusammenhänge oder kausale Wirkbeziehungen zwischen der Dynamik gewisser Objekte, z.B. verschiedenen Sphären des Erdsystems, Prozessen oder lokalen Feldvariablen darstellen, bieten funktionale Netzwerke einen natürlichen Ansatz zur Bearbeitung fundamentaler Probleme der Erdsystemanalyse. Dazu gehören Fragen nach dominanten, dynamischen Mustern, Telekonnektionen und Rückkopplungsschleifen in der planetaren Maschinerie, sowie nach kritischen Elementen wie Schwellwerten, sogn. Flaschenhälsen und Schaltern im Erdsystem. Der erste Teil dieser Dissertation behandelt die Theorie komplexer Netzwerke und die netzwerkbasierte Zeitreihenanalyse. Die Beiträge zur Theorie komplexer Netzwerke beinhalten Maße und Modelle zur Analyse der Topologie (i) von Netzwerken wechselwirkender Netzwerke und (ii) Netzwerken mit ungleichen Knotengewichten, sowie (iii) eine analytische Theorie zur Beschreibung von räumlichen Netzwerken. Zur Zeitreihenanalyse werden (i) Rekurrenznetzwerke als eine theoretisch gut begründete, nichtlineare Methode zum Studium multivariater Zeitreihen vorgestellt. (ii) Gekoppelte Klimanetzwerke werden als ein exploratives Werkzeug der Datenanalyse zur quantitativen Charakterisierung der komplexen statistischen Interdependenzstruktur innerhalb und zwischen distinkten Feldern von Zeitreihen eingeführt. Im zweiten Teil der Arbeit werden Anwendungen zur Detektion von dynamischen Übergängen (Kipppunkten) in Zeitreihen, sowie zum Studium von Flaschenhälsen in der atmosphärischen Zirkulationsstruktur vorgestellt. Die Analyse von Paläoklimadaten deutet auf mögliche Zusammenhänge zwischen großskaligen Veränderungen der afrikanischen Klimadynamik während des Plio-Pleistozäns und Ereignissen in der Menschheitsevolution hin. / The Earth, as viewed from a physicist''s perspective, is a dynamical system of great complexity. Functional complex networks are inferred from observational data and model runs or constructed on the basis of theoretical considerations. Representing statistical interdependencies or causal interactions between objects (e.g., Earth system subdomains, processes, or local field variables), functional complex networks are conceptually well-suited for naturally addressing some of the fundamental questions of Earth system analysis concerning, among others, major dynamical patterns, teleconnections, and feedback loops in the planetary machinery, as well as critical elements such as thresholds, bottlenecks, and switches. The first part of this thesis concerns complex network theory and network-based time series analysis. Regarding complex network theory, the novel contributions include consistent frameworks for analyzing the topology of (i) general networks of interacting networks and (ii) networks with vertices of heterogeneously distributed weights, as well as (iii) an analytical theory for describing spatial networks. In the realm of time series analysis, (i) recurrence network analysis is put forward as a theoretically founded, nonlinear technique for the study of single, but possibly multivariate time series. (ii) Coupled climate networks are introduced as an exploratory tool of data analysis for quantitatively characterizing the intricate statistical interdependency structure within and between several fields of time series. The second part presents applications for detecting dynamical transitions (tipping points) in time series and studying bottlenecks in the atmosphere''s general circulation structure. The analysis of paleoclimate data reveals a possible influence of large-scale shifts in Plio-Pleistocene African climate variability on events in human evolution.

L’estimation des matrices origine-destination (OD) est un sujet de recherche important depuis les années 1950. En effet, ces tableaux à deux entrées recensent la demande de transport d'une zone géographique donnée et sont de ce fait un élément clé de l'ingénierie du trafic. Historiquement, les seules données disponibles pour leur estimation par les statistiques étaient les comptages de véhicules par les boucles magnétiques. Ce travail s'inscrit alors dans le contexte de l'installation à Brisbane de plus de 600 détecteurs Bluetooth qui ont la capacité de détecter et d'identifier les appareils électroniques équipés de cette technologie.Dans un premier temps, il explore la possibilité offerte par ces détecteurs pour les applications en ingénierie du transport en caractérisant ces données et leurs bruits. Ce projet aboutit, à l'issue de cette étude, à une méthode de reconstruction des trajectoires des véhicules équipés du Bluetooth à partir de ces seules données. Dans un second temps, en partant de l'hypothèse que l'accès à des échantillons importants de trajectoires va se démocratiser, cette thèse propose d'étendre la notion de matrice OD à celle de matrice OD par lien afin de combiner la description de la demande avec celle de l'utilisation du réseau. Reposant sur les derniers outils méthodologies développés en optimisation convexe, nous proposons une méthode d'estimation de ces matrices à partir des trajectoires inférées par Bluetooth et des comptages routiers.A partir de peu d'hypothèses, il est possible d'inférer ces nouvelles matrices pour l'ensemble des utilisateurs d'un réseau routier (indépendamment de leur équipement en nouvelles technologies). Ce travail se distingue ainsi des méthodes traditionnelles d'estimation qui reposaient sur des étapes successives et indépendantes d'inférence et de modélisation. / Origin Destination matrix estimation is a critical problem of the Transportation field since the fifties. OD matrix is a two-entry table taking census of the zone-to-zone traffic of a geographic area. This traffic description tools is therefore paramount for traffic engineering applications. Traditionally, the OD matrix estimation has solely been based on traffic counts collected by networks of magnetic loops. This thesis takes place in a context with over 600 Bluetooth detectors installed in the City of Brisbane. These detectors permit in-car Bluetooth device detection and thus vehicle identification.This manuscript explores first, the potentialities of Bluetooth detectors for Transport Engineering applications by characterising the data, their noises and biases. This leads to propose a new methodology for Bluetooth equipped vehicle trajectory reconstruction. In a second step, based on the idea that probe trajectories will become more and more available by means of new technologies, this thesis proposes to extend the concept of OD matrix to the one of link dependent origin destination matrix that describes simultaneously both the traffic demand and the usage of the network. The problem of LOD matrix estimation is formulated as a minimisation problem based on probe trajectories and traffic counts and is then solved thanks to the latest advances in nonsmooth convex optimisation.This thesis demonstrates that, with few hypothesis, it is possible to retrieve the LOD matrix for the whole set of users in a road network. It is thus different from traditional OD matrix estimation approaches that relied on successive steps of modelling and of statistical inferences.

擴散權重影像與神經纖維追蹤可以用來探討腦區域之間的連結性，目前透過網路分析方式已經證實腦網路是有小世界的特性，最近也有研究不同受試者或者是病人之間的網路連結量測集中程度，但是擴散權重影像所運算出來的網路參數中間要經過很多步驟，這些中間步驟可能會影響到網路參數。所以有必要對於量測網路參數的受試者間變異性和重複量測重現性進行研究。本研究的目標是利用機率式神經纖維追蹤術量測大腦網路參數的重現性，探討三個會影響計算網路參數的重現性的變因，分別是，路徑定義方式、有無損耗正規化、受試者群體的網路連結篩選機制。變異係數定義（Coefficient of Variance, CV）為標準差除以平均值，分別計算二次量測之間的變異係數（CVwithin），以及受試者之間的變異係數（CVbetween），另外也計算組內相關係數（Intraclass correlation coefficient, ICC）。 掃描30受試者（15男，15女，年齡20~26）。每人掃描二次，並利用機率式神經纖維追蹤術計算網路連結，網路節點則是使用AAL標準模板定義的節點。若使用Wij = 1 – Pij定義長度，三項網路參數（區域效率、全域效率及損耗）重現性皆可接受（CVwithin<1.08%, CVwithin ≤ 10% and ICC > 0.7）。如果使用Wij=1/Pij定義長度，其損耗的CVwithin相較於Wij = 1 – Pij的大。如果長度的全距大，區域效率會不尋常地增加。如果二次掃描分別實施連結篩選，全域效率的CVwithin會較大。 本研究探討不同的網路建構方式將會影響測試內重現度，不同的研究團隊，縱使是採用相同的受試者群體和相同的儀器，所發表出來的網路參數可能會因為纖維追蹤術造成的誤差而不一致，因此實驗必須謹慎的分析資料以及闡述結果。 / Diffusion tensor imaging (DTI) with associate tractography can be used to access the connectivity of cortical regions in brain. Network analysis applied to connectivity matrix has demonstrated that brain has small world property. Recent studies also use network analysis to study the variation of concentricity among different group of subjects and patients. However the estimation of network metrics from DTI takes sophisticated processing steps. These intermediate steps may influence the estimation of network metric. It is therefore needed to investigate the potential variation of estimated network metrics using reproducibility test. The goal is to study the reproducibility of network properties derived from diffusion connectivity matrix constructed using probabilistic tractography. The effects of three factors on the reproducibility of network metrics estimation were studied. They are definition of path lengths of network matrix, path with and without cost normalization, the application of threshold to subjects groups. Coefficient of Variation (CV) defined as standard deviation divided by mean is used to test the intra-session (CVwithin) and inter subject (CVbetween) variability. Intra-class correlation coefficient (ICC) was also calculated. Images were acquired from 30 healthy participants (15 male, 15 female, aged 20-26 years). Each subject was scanned twice, denoted as N1 and N2. Probabilistic tractography was performed to mapping of cortico-cortical anatomical connections between regions defined from an anatomical atlas. All three of the tested network metrics (local efficiency, global efficiency and cost) were identified as acceptable (CVwithin < 1.08%, CVwithin ≤ 10% and ICC > 0.7) using path length defined as Wij = 1 – Pij. When the path length is defined as Wij = 1/Pij, cost showed higher CVwithin compared to Wij = 1 – Pij. It is unusual that local efficiency increase when the range of path length of edges is large. Global efficiency showed higher CVwithin as threshold is applied to N1 and N2 separately compared to both scans together. The present study revealed that different ways to construct cortical network had an effect on intra-session reproducibility. Our study also showed that despite evaluation of identical subjects using the same MRI system, variation of network metrics may be found by different research groups due to the potential errors from tractography. Replication of the experiment need to be carefully analyzed and interpreted.