subject:(Small world graphs)

University of Gothenburg / Göteborgs Universitet

1. Sandberg, Oskar 1980-. The Structure and Dynamics of Navigable Networks.

Degree: 2007, University of Gothenburg / Göteborgs Universitet

URL: http://hdl.handle.net/2077/17180

Subjects/Keywords: random graphs; small-world; navigable; networks; routing; clustering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sandberg, O. 1. (2007). The Structure and Dynamics of Navigable Networks. (Thesis). University of Gothenburg / Göteborgs Universitet. Retrieved from http://hdl.handle.net/2077/17180

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sandberg, Oskar 1980-. “The Structure and Dynamics of Navigable Networks.” 2007. Thesis, University of Gothenburg / Göteborgs Universitet. Accessed March 01, 2021. http://hdl.handle.net/2077/17180.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sandberg, Oskar 1980-. “The Structure and Dynamics of Navigable Networks.” 2007. Web. 01 Mar 2021.

Vancouver:

Sandberg O1. The Structure and Dynamics of Navigable Networks. [Internet] [Thesis]. University of Gothenburg / Göteborgs Universitet; 2007. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/2077/17180.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sandberg O1. The Structure and Dynamics of Navigable Networks. [Thesis]. University of Gothenburg / Göteborgs Universitet; 2007. Available from: http://hdl.handle.net/2077/17180

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Lima, Max Willian Soares. Efficient indoor localization using graphs.

Degree: 2019, Universidade Federal do Amazonas

URL: https://tede.ufam.edu.br/handle/tede/7308

►

The main goal of an Indoor Positioning System (IPS) is to estimate the position of mobile devices in indoor environments. For this, the primary source… (more)

▼

The main goal of an Indoor Positioning System (IPS) is to estimate the position of mobile devices in indoor environments. For this, the primary source of information is the signal strength of packets received by a set of routers. The fingerprint technique is one of the most used techniques for IPSs. By using supervised machine learning techniques, it trains a model with the received signal intensity information so it can be used to estimate the positions of the devices later in an online phase. Although the k-Nearest Neighbors (kNN) is one of the most widely used classification methods due to its accuracy, it has no scalability since a sample we need to classify must be compared to all other samples in the training database. In this work, we use a novel hierarchical navigable small world graph technique to build a search structure so the location of a sample can be efficiently found, allowing the IPSs to be used in large scale scenarios or run on devices with limited resources. To carry out our performance evaluation, we proposed a synthetic IPS dataset generator as well as implemented a complete real-world, high scale IPS testbed. We compared the performance of our graph-based solution with other known kNN variants, such as Kd-Tree and Ball-Tree. Our results clearly show the performance gains of the proposed solution at 96% when compared to the classic kNN and at least 77% when compared to the tree-based approaches.

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

Advisors/Committee Members: Moura, Edleno Silva de, 407487582-91, http://lattes.cnpq.br/4737852130924504, Oliveira, Horácio Antonio Braga Fernandes de, http://lattes.cnpq.br/9314744999783676, Balico, Leandro Nelinho, http://lattes.cnpq.br/7704628402527376, [email protected].

Subjects/Keywords: Sistemas de posicionamento indoor (localização sem fio); CIÊNCIAS EXATAS E DA TERRA: CIÊNCIA DA COMPUTAÇÃO; Small world graphs; Indoor positioning systems; Nearest neighborsc

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lima, M. W. S. (2019). Efficient indoor localization using graphs. (Masters Thesis). Universidade Federal do Amazonas. Retrieved from https://tede.ufam.edu.br/handle/tede/7308

Chicago Manual of Style (16^th Edition):

Lima, Max Willian Soares. “Efficient indoor localization using graphs.” 2019. Masters Thesis, Universidade Federal do Amazonas. Accessed March 01, 2021. https://tede.ufam.edu.br/handle/tede/7308.

MLA Handbook (7^th Edition):

Lima, Max Willian Soares. “Efficient indoor localization using graphs.” 2019. Web. 01 Mar 2021.

Vancouver:

Lima MWS. Efficient indoor localization using graphs. [Internet] [Masters thesis]. Universidade Federal do Amazonas; 2019. [cited 2021 Mar 01]. Available from: https://tede.ufam.edu.br/handle/tede/7308.

Council of Science Editors:

Lima MWS. Efficient indoor localization using graphs. [Masters Thesis]. Universidade Federal do Amazonas; 2019. Available from: https://tede.ufam.edu.br/handle/tede/7308

3. Castro, Paulo Alexandre de. Rede complexa e criticalidade auto-organizada: modelos e aplicações.

Degree: PhD, Física Básica, 2007, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/76/76131/tde-14012008-165356/ ;

►

Modelos e teorias científicas surgem da necessidade do homem entender melhor o funcionamento do mundo em que vive. Constantemente, novos modelos e técnicas são criados… (more)

▼

Modelos e teorias científicas surgem da necessidade do homem entender melhor o funcionamento do mundo em que vive. Constantemente, novos modelos e técnicas são criados com esse objetivo. Uma dessas teorias recentemente desenvolvida é a da Criticalidade Auto-Organizada. No Capítulo 2 desta tese, apresentamos uma breve introdução a Criticalidade Auto-Organizada. Tendo a criticalidade auto-organizada como pano de fundo, no Capítulo 3, estudamos a dinâmica Bak-Sneppen (e diversas variantes) e a comparamos com alguns algoritmos de otimização. Apresentamos no Capítulo 4, uma revisão histórica e conceitual das redes complexas. Revisamos alguns importantes modelos tais como: Erdös-Rényi, Watts-Strogatz, de configuração e Barabási-Albert. No Capítulo 5, estudamos o modelo Barabási-Albert não-linear. Para este modelo, obtivemos uma expressão analítica para a distribuição de conectividades P(k), válida para amplo espectro do espaço de parâmetros. Propusemos também uma forma analítica para o coeficiente de agrupamento, que foi corroborada por nossas simulações numéricas. Verificamos que a rede Barabási-Albert não-linear pode ser assortativa ou desassortativa e que, somente no caso da rede Barabási-Albert linear, ela é não assortativa. No Capítulo 6, utilizando dados coletados do CD-ROM da revista Placar, construímos uma rede bastante peculiar – a rede do futebol brasileiro. Primeiramente analisamos a rede bipartida formada por jogadores e clubes. Verificamos que a probabilidade de que um jogador tenha participado de M partidas decai exponencialmente com M, ao passo que a probabilidade de que um jogador tenha marcado G gols segue uma lei de potência. A partir da rede bipartida, construímos a rede unipartida de jogadores, que batizamos de rede de jogadores do futebol brasileiro. Nessa rede, determinamos várias grandezas: o comprimento médio do menor caminho e os coeficientes de agrupamento e de assortatividade. A rede de jogadores de futebol brasileiro nos permitiu analisar a evolução temporal dessas grandezas, uma oportunidade rara em se tratando de redes reais.

Models and scientific theories arise from the necessity of the human being to better understand how the world works. Driven by this purpose new models and techniques have been created. For instance, one of these theories recently developed is the Self-Organized Criticality, which is shortly introduced in the Chapter 2 of this thesis. In the framework of the Self-Organized Criticality theory, we investigate the standard Bak-Sneppen dynamics as well some variants of it and compare them with optimization algorithms (Chapter 3). We present a historical and conceptual review of complex networks in the Chapter 4. Some important models like: Erdös-Rényi, Watts-Strogatz, configuration model and Barabási-Albert are revised. In the Chapter 5, we analyze the nonlinear Barabási-Albert model. For this model, we got an analytical expression for the connectivity distribution P(k), which is valid for a wide range of the space parameters. We also proposed an exact analytical…

Advisors/Committee Members: Onody, Roberto Nicolau.

Subjects/Keywords: Brasilian football; Complex networks; Criticalidade auto-organizada; Efeito mundo pequeno; Erdos-Renyi model; Futebol brasileiro; Grafos aleatórios; Modelo watts-strogratz; Modelo Erdos-Rényi; Random graphs; Redes complexas; Self-organized criticality; Small world effect; Watts-Strogratz model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Castro, P. A. d. (2007). Rede complexa e criticalidade auto-organizada: modelos e aplicações. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/76/76131/tde-14012008-165356/ ;

Chicago Manual of Style (16^th Edition):

Castro, Paulo Alexandre de. “Rede complexa e criticalidade auto-organizada: modelos e aplicações.” 2007. Doctoral Dissertation, University of São Paulo. Accessed March 01, 2021. http://www.teses.usp.br/teses/disponiveis/76/76131/tde-14012008-165356/ ;.

MLA Handbook (7^th Edition):

Castro, Paulo Alexandre de. “Rede complexa e criticalidade auto-organizada: modelos e aplicações.” 2007. Web. 01 Mar 2021.

Vancouver:

Castro PAd. Rede complexa e criticalidade auto-organizada: modelos e aplicações. [Internet] [Doctoral dissertation]. University of São Paulo; 2007. [cited 2021 Mar 01]. Available from: http://www.teses.usp.br/teses/disponiveis/76/76131/tde-14012008-165356/ ;.

Council of Science Editors:

Castro PAd. Rede complexa e criticalidade auto-organizada: modelos e aplicações. [Doctoral Dissertation]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/76/76131/tde-14012008-165356/ ;

4. Dion, Dominique. Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010.

Degree: Docteur es, Sociétés, Politique, Santé publique. Sciences cognitives et Ergonomie. Sciences cognitives, 2012, Université de Bordeaux Segalen

URL: http://www.theses.fr/2012BOR22005

►

Ces dix dernières années, l'étude des réseaux petits-mondes a montré une grande stabilité de certaines métriques issues de la théorie des graphes formels. Elle porte… (more)

▼

Ces dix dernières années, l'étude des réseaux petits-mondes a montré une grande stabilité de certaines métriques issues de la théorie des graphes formels. Elle porte sur l'analyse de réseaux traduisant des activités de l'homme : réseaux d'échanges téléphoniques, de connexions aériennes, de navigation sur le Web, de structure des lexiques linguistiques, mais également de réseaux de diffusion des épidémies ou de réseaux de relations sociales. En revanche, peu d'études ont porté sur l'analyse de la dynamique de ces graphes et leur évolution au cours du temps. C'est cette approche que nous développons dans ce document. Nous nous intéressons ici à des graphes obtenus à partir de comptes rendus professionnels de travailleurs sociaux. Ces graphes modélisent les cooccurrences des mots au sein des phrases. Notre analyse porte sur un lexique professionnel et sur l'évolution de son usage sur une période de près de 40 ans. Après avoir constitué notre matériel à partir des textes écrits (environ 1500 pages dactylographiées), ce corpus d'étude a été quantifié, vérifié, homogénéisé et traité orthographiquement sur un mode semi-automatique. Puis ce corpus normalisé a donné lieu à la constitution d'un graphe global pour la période complète, et d'une quarantaine de graphes pour chacune des sous-périodes étudiées. C'est sur ceux-ci que porte l'analyse de la dynamique d'évolution de graphe issu d'un lexique professionnel. Au final, notre travail permet de pointer le paradoxe existant, entre d'une part la contrainte d'écriture liée à un objet qui ne change que très peu dans la nature de sa mission (le travail d'un éducateur de rue) et d'autre part la permissivité du langage oral qui ne cesse d'évoluer (le langage professionnel). Par ailleurs notre approche propose une certaine automatisation pour dégager l'essentiel d'un "dire professionnel" dans un corpus de comptes rendus.

These last ten years, the study of small-world networks indicated a great stability of certain metrics from the theory of informal graphs. It is about the analysis of networks illustrating man's activities : networks of phone conversations, air connections, web browsing, linguistic vocabularies structure, but also epidemics' spreading or social relations networks. However, few studies focused on the analysis of these graphs' dynamics and their evolution over time. It is this approach that we develop in this document. We will take an interest in graphs obtained from professional reports of social workers. These graphs model the cooccurrences of words within sentences. Our analysis focuses on a professional vocabulary and on the evolution of its use in a period of time of almost 40 years. After our material was produced out of written texts (around 1500 typewritten pages), this corpus of studies has been quantified, checked, homogenized and orthographically dealt with on a semi-automatic mode. Then, this normalized corpus led to the formation of a global graph for the entire period, and of around forty graphs for each of the subperiod under study. Thus the analysis…

Advisors/Committee Members: Le Blanc, Benoît (thesis director).

Subjects/Keywords: Graphes lexicaux; Réseaux petit-monde; Comptes rendus de travail social; Éducation spécialisée; Cooccurrences séquentielles; Evolution d'un vocabulaire professionnel; Lexical graphs; Small-world networks; Social work reports; Specialized education; Sequential cooccurrences; Professional vocabulary evolution

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dion, D. (2012). Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010. (Doctoral Dissertation). Université de Bordeaux Segalen. Retrieved from http://www.theses.fr/2012BOR22005

Chicago Manual of Style (16^th Edition):

Dion, Dominique. “Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010.” 2012. Doctoral Dissertation, Université de Bordeaux Segalen. Accessed March 01, 2021. http://www.theses.fr/2012BOR22005.

MLA Handbook (7^th Edition):

Dion, Dominique. “Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010.” 2012. Web. 01 Mar 2021.

Vancouver:

Dion D. Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010. [Internet] [Doctoral dissertation]. Université de Bordeaux Segalen; 2012. [cited 2021 Mar 01]. Available from: http://www.theses.fr/2012BOR22005.

Council of Science Editors:

Dion D. Dynamique d'évolution de graphes de cooccurrences lexicales : application à l'analyse de comptes rendus en prévention spécialisée entre 1972 et 2010 : Dynamic changes of lexical coocurrences graphs : application to the analysis of reports in specialized prevention between 1972 and 2010. [Doctoral Dissertation]. Université de Bordeaux Segalen; 2012. Available from: http://www.theses.fr/2012BOR22005

5. Mehrabian, Abbas. Diameter and Rumour Spreading in Real-World Network Models.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9241

► The so-called 'small-world phenomenon', observed in many real-world networks, is that there is a short path between any two nodes of a network, whose length… (more)

▼ The so-called 'small-world phenomenon', observed in many real-world networks, is that there is a short path between any two nodes of a network, whose length is much smaller that the network's size, typically growing as a logarithmic function. Several mathematical models have been defined for social networks, the WWW, etc., and this phenomenon translates to proving that such models have a small diameter. In the first part of this thesis, we rigorously analyze the diameters of several random graph classes that are introduced specifically to model complex networks, verifying whether this phenomenon occurs in them. In Chapter 3 we develop a versatile technique for proving upper bounds for diameters of evolving random graph models, which is based on defining a coupling between these models and variants of random recursive trees. Using this technique we prove, for the first time, logarithmic upper bounds for the diameters of seven well known models. This technique gives unified simple proofs for known results, provides lots of new ones, and will help in proving many of the forthcoming network models are small-world. Perhaps, for any given model, one can come up with an ad hoc argument that the diameter is O(log n), but it is interesting that a unified technique works for such a wide variety of models, and our first major contribution is introducing such a technique. In Chapter 4 we estimate the diameter of random Apollonian networks, a class of random planar graphs. We also give lower and upper bounds for the length of their longest paths. In Chapter 5 we study the diameter of another random graph model, called the random surfer Web-graph model. We find logarithmic upper bounds for the diameter, which are almost tight in the special case when the growing graph is a tree. Although the two models are quite different, surprisingly the same engine is used for proving these results, namely the powerful technique of Broutin and Devroye (Large deviations for the weighted height of an extended class of trees, Algorithmica 2006) for analyzing weighted heights of random trees, which we have adapted and applied to the two random graph models. Our second major contribution is demonstrating the flexibility of this technique via providing two significant applications. In the second part of the thesis, we study rumour spreading in networks. Suppose that initially a node has a piece of information and wants to spread it to all nodes in a network quickly. The problem of designing an efficient protocol performing this task is a fundamental one in distributed computing and has applications in maintenance of replicated databases, broadcasting algorithms, analyzing news propagation is social networks and the spread of viruses on the Internet. Given a rumour spreading protocol, its spread time is the time it takes for the rumour to spread in the whole graph. In Chapter 6 we prove several tight lower and upper bounds for the spread times of two well known randomized rumour spreading protocols, namely the…

Subjects/Keywords: complex networks; random graphs; small-world phenomenon; rumour spreading; probability; graph theory; stochastic processes; distributed computing

…coefficients of graphs. Also, we do not discuss the algorithmic aspects of the small-world phenomenon… …logarithmically. We believe this is the primary reason that most real-world graphs are small-world… …1.1 The small-world phenomenon ‘Small-world phenomenon’ refers to a striking pattern… …observed in many real-world graphs: most pairs of vertices are connected by a path whose length… …Another fascinating observation on many real-world graphs is that their degree sequences are…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mehrabian, A. (2015). Diameter and Rumour Spreading in Real-World Network Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9241

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mehrabian, Abbas. “Diameter and Rumour Spreading in Real-World Network Models.” 2015. Thesis, University of Waterloo. Accessed March 01, 2021. http://hdl.handle.net/10012/9241.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mehrabian, Abbas. “Diameter and Rumour Spreading in Real-World Network Models.” 2015. Web. 01 Mar 2021.

Vancouver:

Mehrabian A. Diameter and Rumour Spreading in Real-World Network Models. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/10012/9241.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mehrabian A. Diameter and Rumour Spreading in Real-World Network Models. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9241

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Zhuang, Yuwen. Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs.

Degree: MS, Computer Science and Engineering, 2012, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416

► Lifelogging, as a growing interest, is a term referring to people digitally capturing all the information produced by them in daily life. Lifelog is… (more)

▼ Lifelogging, as a growing interest, is a term referring to people digitally capturing all the information produced by them in daily life. Lifelog is a data collection of records of an individual's daily activities in one or more media forms. In this thesis, we collect lifelog data by using a mobile phone or a Microsoft Research SenseCam worn around subjects' necks during their daily life. We then propose a way to organize the lifelog data - a metric based model for event segmentation. Further more, we analyse the data properties through constructing the experience graphs from the recorded images. This thesis involves two parts, the details are as follows: Firstly, we describe a metric-based model for event segmentation of sensor data recorded by a mobile phone worn around subjects' necks during their daily life. More specifically, we aim at detecting human daily event boundaries by analysing the recorded triaxial accelerometer signals and images sequence (lifelog data). In the experiments, different signal representations and three boundary detection models are evaluated on a corpus of 2 subjects over total 24 days. The contribution of this work is three-fold. First, we find that using accelerometer signals can provide much more reliable and significantly better performance than using image signals with MPEG-7 low level features. Second, the models using the accelerometer data based on the world's coordinates system can provide equally or even much better performance than using the accelerometer data based on the device's coordinates system. Finally, our proposed model has a better performance than the state of the art system. Secondly, we investigate data obtained from subjects wearing a Microsoft Research SenseCam as they engaged in their every day activities. We construct experience graphs for each subject from their corresponding images by using two different image representation methods - color histogram and color correlogram. The statistical analyses of these graphs show that they have a small world structure which is characterized by high proximity ratios and sparse connectivity, independent of the representation used. However, the degree distribution analyses show that they are not scale-free, broad-scale or even single-scale. Furthermore, we also find that the graphs constructed based on the color correlogram representation, which is better than the color histogram in many content-based image retrieval systems, have shorter average path lengths and higher global clustering coefficients than the graphs constructed based on the color histogram representation. Advisors/Committee Members: Belkin, Mikhail (Advisor).

Subjects/Keywords: Computer Science; Triaxial accelerometer; Event segmentation; Lifelog data; Microsoft Research Sensecam; Experience Graphs; Color Histogram; Color Correlogram; Small World; Proximity Ratio; Scale-Free; Global Clustering Coefficient

…3.2.2 Small-World Topology . . . . . . . . . . . . . . . . 3.2.3 Random Graphs… …that the experience graphs have a small-world structure which is characterized by high… …of Graph Theory and Small-World Topology 3.2.1 Terminology of Graph Theory… …3.2.4 Testing for a Small-World Topology . . . . . . . . . 3.3 Experience Graph Construction… …48] with a small world topology. In this table, the “film actors” corresponds to a…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhuang, Y. (2012). Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416

Chicago Manual of Style (16^th Edition):

Zhuang, Yuwen. “Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs.” 2012. Masters Thesis, The Ohio State University. Accessed March 01, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416.

MLA Handbook (7^th Edition):

Zhuang, Yuwen. “Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs.” 2012. Web. 01 Mar 2021.

Vancouver:

Zhuang Y. Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs. [Internet] [Masters thesis]. The Ohio State University; 2012. [cited 2021 Mar 01]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416.

Council of Science Editors:

Zhuang Y. Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs. [Masters Thesis]. The Ohio State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416

RMIT University

7. Luo, H. Modelling and simulation of large-scale complex networks.

Degree: 2007, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:161738

► Real-world large-scale complex networks such as the Internet, social networks and biological networks have increasingly attracted the interest of researchers from many areas. Accurate modelling… (more)

▼ Real-world large-scale complex networks such as the Internet, social networks and biological networks have increasingly attracted the interest of researchers from many areas. Accurate modelling of the statistical regularities of these large-scale networks is critical to understand their global evolving structures and local dynamical patterns. Traditionally, the Erdos and Renyi random graph model has helped the investigation of various homogeneous networks. During the past decade, a special computational methodology has emerged to study complex networks, the outcome of which is identified by two models: the Watts and Strogatz small-world model and the Barabasi-Albert scale-free model. At the core of the complex network modelling process is the extraction of characteristics of real-world networks. I have developed computer simulation algorithms for study of the properties of current theoretical models as well as for the measurement of two real-world complex networks, which lead to the isolation of three complex network modelling essentials. The main contribution of the thesis is the introduction and study of a new General Two-Stage growth model (GTS Model), which aims to describe and analyze many common-featured real-world complex networks. The tools we use to create the model and later perform many measurements on it consist of computer simulations, numerical analysis and mathematical derivations. In particular, two major cases of this GTS model have been studied. One is named the U-P model, which employs a new functional form of the network growth rule: a linear combination of preferential attachment and uniform attachment. The degree distribution of the model is first studied by computer simulation, while the exact solution is also obtained analytically. Two other important properties of complex networks: the characteristic path length and the clustering coefficient are also extensively investigated, obtaining either analytically derived solutions or numerical results by computer simulations. Furthermore, I demonstrate that the hub-hub interaction behaves in effect as the link between a network's topology and resilience property. The other is called the Hybrid model, which incorporates two stages of growth and studies the transition behaviour between the Erdos and Renyi random graph model and the Barabasi-Albert scale-free model. The Hybrid model is measured by extensive numerical simulations focusing on its degree distribution, characteristic path length and clustering coefficient. Although either of the two cases serves as a new approach to modelling real-world large-scale complex networks, perhaps more importantly, the general two-stage model provides a new theoretical framework for complex network modelling, which can be extended in many ways besides the two studied in this thesis.

Subjects/Keywords: Fields of Research; Scale-free; complex network; small-world; preferential attachment; uniform attachment; random graphs; clustering coefficient; network resilience; hub-hub; general two-stage model; GTS model; U-P model; Hybrid model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Luo, H. (2007). Modelling and simulation of large-scale complex networks. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:161738

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Luo, H. “Modelling and simulation of large-scale complex networks.” 2007. Thesis, RMIT University. Accessed March 01, 2021. http://researchbank.rmit.edu.au/view/rmit:161738.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Luo, H. “Modelling and simulation of large-scale complex networks.” 2007. Web. 01 Mar 2021.

Vancouver:

Luo H. Modelling and simulation of large-scale complex networks. [Internet] [Thesis]. RMIT University; 2007. [cited 2021 Mar 01]. Available from: http://researchbank.rmit.edu.au/view/rmit:161738.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Luo H. Modelling and simulation of large-scale complex networks. [Thesis]. RMIT University; 2007. Available from: http://researchbank.rmit.edu.au/view/rmit:161738

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations