No description available.

No description available.

We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a (sub-)linear function of the indegree of the older vertex at that time. We provide a limit theorem with rates of convergence for the distribution of a vertex, chosen uniformly at random, as the number of vertices tends to infinity. To do so, we develop Stein's method for a new class of limting distributions including power-laws. Similar, but slightly weaker results are shown to be deducible using coupling techniques. Concentrating on a specific preferential attachment model we also show that the outdegree distribution asymptotically follows a Poisson law. In addition, we deduce a central limit theorem for the number of isolated vertices. We thereto construct a size-bias coupling which in combination with Stein’s method also yields bounds on the distributional distance.

Measuring the research performance of a university is important to the universities themselves, governments, and students alike. Among other metrics, the number of publications is easy to obtain, and due to the large number of publications each university produces during one year, it suggests to be one accurate metric. However, the number of publications depends largely on the size of the institution, suggesting, if not addressed, that larger universities are better. Thus, one might intuitively try to normalize by size and use publications per researcher instead. A better institution would allow individual researchers to have more publications each year. However, publications, like many other things, might follow a power-law distribution, where most researchers have few, and only a few researchers have very many publications. These power-law distributions violate the assumptions the central limit the orem makes, for example, having a well-defined mean or variance. Specifically, one can not normalize or use averages from power-law distributed data, making the comparison of university publications impossible if they indeed follow a power-law distribution. While it has been shown that some scientific domains or universities show this power-law distribution, it is not known if Swedish universities also show this phenomenon. Thus, here we collect publication data for Swedish universities and determine whether or not, they are power-law distributed. Interestingly, if they are, one might use the slope of the power-law distribution as a proxy to determine research output. If the slope is steep, it suggests that the ratio between highly published authors and those with few publications is small. Where as a flatter slope suggests that a university has more highly published authors than a university with a steeper slope. Thus, the second objective here is to assess if the slope of the distribution can be determined or to which extent this is possible. This study will show that eight of the fifteen Swedish universities considered follow a power-law distribution (Kolmogorov-Smirnov statistic<0.05), while the remaining seven do not. The key determinant is the total number of publications. The difficulty here is that often the total number of publications is so small that one can not reject a power-law distribution, and it is also impossible to determine the slope of the distribution with any accuracy in those cases. While this study suggests that in principle, the slopes of the power-law distributions can be used as a comparative metric, it also showed that for half of Sweden’s universities, the data is insufficient for this type of analysis.

Due to great effort from mathematicians, physicists and computer scientists, network science has attained rapid development during the past decades. However, because of the complexity, most researches in this area are conducted only based upon experiments and simulations, it is critical to do research based on theoretical results so as to gain more insight on how the structure of a network affects the security. This dissertation introduces some stochastic and statistical models on certain networks and uses a k-out-of-n tolerant structure to characterize both logically and physically the behavior of nodes. Based upon these models, we draw several illuminating results in the following two aspects, which are consistent with what computer scientists have observed in either practical situations or experimental studies. Suppose that the node in a P2P network loses the designed function or service when some of its neighbors are disconnected. By studying the isolation probability and the durable time of a single user, we prove that the network with the user's lifetime having more NWUE-ness is more resilient in the sense of having a smaller probability to be isolated by neighbors and longer time to be online without being interrupted. Meanwhile, some preservation properties are also studied for the durable time of a network. Additionally, in order to apply the model in practice, both graphical and nonparametric statistical methods are developed and are employed to a real data set. On the other hand, a stochastic model is introduced to investigate the security of network systems based on their vulnerability graph abstractions. A node loses its designed function when certain number of its neighbors are compromised in the sense of being taken over by the malicious codes or the hacker. The attack compromises some nodes, and the victimized nodes become accomplices. We derived an equation to solve the probability for a node to be compromised in a network. Since this equation has no explicit solution, we also established new lower and upper bounds for the probability. The two models proposed herewith generalize existing models in the literature, the corresponding theoretical results effectively improve those known results and hence carry an insight on designing a more secure system and enhancing the security of an existing system.

Many complex systems arising from nature and human society can be described as complex networks. In this dissertation, on the basis of complex network theory, we pay attention to the topological structure of complex network and the dynamics on it. We established models to investigate the influences of the structure on the dynamics of networks and to shed light on some peculiar properties of complex systems. This dissertation includes four parts. In the first part, the empirical properties (degree distribution, clustering coefficient, diameter, and characteristic path length) of urban road network of Le Mans city in France are studied. The degree distribution shows a double power-law which we studied in detail. In the second part, we propose two models to investigate the possible mechanisms leading to the deviation from simple power law. In the first model, probabilistic addition of nodes and links, and rewiring of links are considered; in the second one, only random and preferential link growth is included. The simulation results of the modelling are compared with the real data. In the third part,the probabilistic uncertainty behavior of double power law distribution is investigated. The network optimization and optimal design of scale free network to random failures are discussed from the viewpoint of entropy maximization. We defined equilibrium network ensemble as stationary ensembles of graphs by using some thermodynamics like notions such as "energy", "temperature", "free energy" for network. In the forth part, an union-division model is established to investigate the time evolution of certain networks like cultural or economical networks. In this model, the nodes represent, for example, the cultures. Several quantities such as richness, age, identity, ingredient etc. are used to parameterize the probabilistic evolution of the network. The model offers a long term view on the apparently periodic dynamics of an ensemble of cultural or economic entities in interaction.

Made available in DSpace on 2015-03-03T15:15:26Z (GMT). No. of bitstreams: 1 EliangelaPB_DISSERT.pdf: 614353 bytes, checksum: 050737d0ef158e6082d81254619adac0 (MD5) Previous issue date: 2011-09-19 / Conselho Nacional de Desenvolvimento Cient?fico e Tecnol?gico / Considering a non-relativistic ideal gas, the standard foundations of kinetic theory are investigated in the context of non-gaussian statistical mechanics introduced by Kaniadakis. The new formalism is based on the generalization of the Boltzmann H-theorem and the deduction of Maxwells statistical distribution. The calculated power law distribution is parameterized through a parameter measuring the degree of non-gaussianity. In the limit = 0, the theory of gaussian Maxwell-Boltzmann distribution is recovered. Two physical applications of the non-gaussian effects have been considered. The first one, the -Doppler broadening of spectral lines from an excited gas is obtained from analytical expressions. The second one, a mathematical relationship between the entropic index and the stellar polytropic index is shown by using the thermodynamic formulation for self-gravitational systems / Considerando um g?s ideal n?o relativ?stico, os fundamentos da teoria cin?tica padr?o s?o investigados no contexto da mec?nica estat?stica n?o-gaussiana introduzida por Kaniadakis. O novo formalismo ? baseado na generaliza??o do teorema-H de Boltzmann e na dedu??o de Maxwell da distribui??o estat?stica. A distribui??o lei de pot?ncia calculada ? parametrizada por um par?metro medindo o grau de n?o-gaussianidade do sistema. No limite = 0, a teoria gaussiana de Maxwell-Boltzmann ? recuperada. Duas aplica??es dos efeitos n?o-gaussiano s?o estudados. Na primeira, o -alargamento Doppler das linhas espectrais de um g?s excitado ? obtido a partir das express?es anal?ticas. Na segunda, uma rela??o matem?tica entre o ?ndice entr?pico e o ?ndice politr?pico estelar ? mostrada usando uma formula??o termodin?mica para sistemas autogravitantes

De nombreux systèmes complexes provenant de phénomènes naturels ou de la société humaine peuvent être décrits comme des réseaux complexes. Dans cette thèse, sur la base de la théorie des réseaux complexes, nous allons nous pencher sur la structure topologique de ces réseaux complexes et leurs dynamiques. Nous avons créé des modèles pour étudier les influences de la structure sur la dynamique des réseaux et mis en évidence quelques propriétés particulières des systèmes complexes. Cette thèse comporte quatre parties. Dans la première partie, les propriétés empiriques (degré de distribution, coefficient d’agrégation, diamètre, longueur caractéristique de parcours) des réseaux de routes urbaines de la ville du Mans en France sont étudiées. Dans la seconde partie, nous proposons deux modèles pour étudier le mécanisme éventuel conduisant à s’écarter de la loi de puissance simple. Dans le premier modèle, la probabilité d’addition de noeuds et de liens, la création de liens est étudiée ; dans le second modèle, seule la croissance aléatoire et préférentielle de liens est ajoutée. Les résultats de la simulation de ce modèle sont comparés aux données réelles. Dans la troisième partie, les propriétés probabilistes incertaines de la loi de distribution en double puissance sont étudiées. L’optimisation du réseau et l’étude optimale du réseau sans échelle vers l’échec aléatoire sont étudiées en se servant du principe de maximisation de l’entropie. Nous avons défini l’ensemble du réseau à l’équilibre comme des ensembles stationnaires de graphes en utilisant des notions thermodynamiques telle que ”énergie”, ”température”, ” énergie libre” pour les réseaux. Dans la quatrième partie, un modèle d’union-division est mis au point pour étudier l’évolution temporelle de certains réseaux culturels ou économiques. Dans ce modèle, les noeuds représentent les cultures. Plusieurs grandeurs telles que la richesse, l’âge, identité, contenu etc. sont utilisées pour paramétrer l’évolution probable du réseau. Le modèle offre une vision à long terme sur une dynamique apparemment périodique d’ensemble de grandeurs culturelles ou économiques en interaction. / Many complex systems arising from nature and human society can be described as complex networks. In this dissertation, on the basis of complex network theory, we pay attention to the topological structure of complex network and the dynamics on it. We established models to investigate the influences of the structure on the dynamics of networks and to shed light on some peculiar properties of complex systems. This dissertation includes four parts. In the first part, the empirical properties (degree distribution, clustering coefficient, diameter, and characteristic path length) of urban road network of Le Mans city in France are studied. The degree distribution shows a double power-law which we studied in detail. In the second part, we propose two models to investigate the possible mechanisms leading to the deviation from simple power law. In the first model, probabilistic addition of nodes and links, and rewiring of links are considered; in the second one, only random and preferential link growth is included. The simulation results of the modelling are compared with the real data. In the third part,the probabilistic uncertainty behavior of double power law distribution is investigated. The network optimization and optimal design of scale free network to random failures are discussed from the viewpoint of entropy maximization. We defined equilibrium network ensemble as stationary ensembles of graphs by using some thermodynamics like notions such as ”energy”, ”temperature”, ”free energy” for network. In the forth part, an union-division model is established to investigate the time evolution of certain networks like cultural or economical networks. In this model, the nodes represent, for example, the cultures. Several quantities such as richness, age, identity, ingredient etc. are used to parameterize the probabilistic evolution of the network. The model offers a long term view on the apparently periodic dynamics of an ensemble of cultural or economic entities in interaction.