Log in

Relevant bibliographies by topics / Clustering coefficient / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Clustering coefficient.

Dissertations / Theses on the topic 'Clustering coefficient'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 39 dissertations / theses for your research on the topic 'Clustering coefficient.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Parikh, Nidhi Kiranbhai. "Generating Random Graphs with Tunable Clustering Coefficient." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/31591.

Full text

Abstract:

Most real-world networks exhibit a high clustering coefficientâ the probability that two neighbors of a node are also neighbors of each other. We propose four algorithms CONF-1, CONF-2, THROW-1, and THROW-2 which are based on the configuration model and that take triangle degree sequence (representing the number of triangles/corners at a node) and single-edge degree sequence (representing the number of single-edges/stubs at a node) as input and generate a random graph with a tunable clustering coefficient. We analyze them theoretically and empirically for the case of a regular graph. CONF-1 a

APA, Harvard, Vancouver, ISO, and other styles

2

Jäger, Simon [Verfasser]. "Exponential domination, exponential independence, and the clustering coefficient / Simon Jäger." Ulm : Universität Ulm, 2017. http://d-nb.info/114748449X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Heinrich, Irene [Verfasser]. "On Graph Decomposition: Hajós' Conjecture, the Clustering Coefficient and Dominating Sets / Irene Heinrich." München : Verlag Dr. Hut, 2020. http://d-nb.info/1219606197/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Oppong, Augustine. "Clustering Mixed Data: An Extension of the Gower Coefficient with Weighted L2 Distance." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3463.

Full text

Abstract:

Sorting out data into partitions is increasing becoming complex as the constituents of data is growing outward everyday. Mixed data comprises continuous, categorical, directional functional and other types of variables. Clustering mixed data is based on special dissimilarities of the variables. Some data types may influence the clustering solution. Assigning appropriate weight to the functional data may improve the performance of the clustering algorithm. In this paper we use the extension of the Gower coefficient with judciously chosen weight for the L2 to cluster mixed data.The benefits of w

APA, Harvard, Vancouver, ISO, and other styles

5

Nascimento, Mariá Cristina Vasconcelos. "Metaheurísticas para o problema de agrupamento de dados em grafo." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17052010-155334/.

Full text

Abstract:

O problema de agrupamento de dados em grafos consiste em encontrar clusters de nós em um dado grafo, ou seja, encontrar subgrafos com alta conectividade. Esse problema pode receber outras nomenclaturas, algumas delas são: problema de particionamento de grafos e problema de detecção de comunidades. Para modelar esse problema, existem diversas formulações matemáticas, cada qual com suas vantagens e desvantagens. A maioria dessas formulações tem como desvantagem a necessidade da definição prévia do número de grupos que se deseja obter. Entretanto, esse tipo de informação não está contida em dados

APA, Harvard, Vancouver, ISO, and other styles

6

Koomson, Obed. "Performance Assessment of The Extended Gower Coefficient on Mixed Data with Varying Types of Functional Data." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3512.

Full text

Abstract:

Clustering is a widely used technique in data mining applications to source, manage, analyze and extract vital information from large amounts of data. Most clustering procedures are limited in their performance when it comes to data with mixed attributes. In recent times, mixed data have evolved to include directional and functional data. In this study, we will give an introduction to clustering with an eye towards the application of the extended Gower coefficient by Hendrickson (2014). We will conduct a simulation study to assess the performance of this coefficient on mixed data whose functio

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Han. "Statistical Modeling and Analysis of Bivariate Spatial-Temporal Data with the Application to Stream Temperature Study." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/70862.

Full text

Abstract:

Water temperature is a critical factor for the quality and biological condition of streams. Among various factors affecting stream water temperature, air temperature is one of the most important factors related to water temperature. To appropriately quantify the relationship between water and air temperatures over a large geographic region, it is important to accommodate the spatial and temporal information of the steam temperature. In this dissertation, I devote effort to several statistical modeling techniques for analyzing bivariate spatial-temporal data in a stream temperature study. I

APA, Harvard, Vancouver, ISO, and other styles

8

Stephens, Skylar Nicholas. "Analytical and Computational Micromechanics Analysis of the Effects of Interphase Regions, Orientation, and Clustering on the Effective Coefficient of Thermal Expansion of Carbon Nanotube-Polymer Nanocomposites." Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/23216.

Full text

Abstract:

Analytic and computational micromechanics techniques based on the composite cylinders method and the finite element method, respectively, have been used to determine the effective coefficient of thermal expansion (CTE) of carbon nanotube-epoxy nanocomposites containing aligned nanotubes. Both techniques have been used in a parametric study of the influence of interphase stiffness and interphase CTE on the effective CTE of the nanocomposites. For both the axial and transverse CTE of aligned nanotube nanocomposites with and without interphase regions, the computational and analytic micromechani

APA, Harvard, Vancouver, ISO, and other styles

9

Dhanasetty, Abhishek. "Enumerating Approximate Maximal Cliques in a Distributed Framework." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1617104719399743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, James H. "A pollination network of Cornus florida." VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3615.

Full text

Abstract:

From the agent-based, correlated random walk model presented, we observe the effects of varying the parameter values of maximum insect turning area, 𝛿max, density of trees, ω, maximum pollen carryover, 𝜅max, and probability of fertilization, P𝜅, on the distribution of pollen within a population of Cornus florida (flowering dogwood). We see that varying 𝛿max and 𝜅max changes the dispersal distance of pollen, which greatly affects many measures of connectivity. The clustering coefficient of fathers is maximized when 𝛿max is between 60° and 90°. Varying ω does not have a major effect on the clust

APA, Harvard, Vancouver, ISO, and other styles

11

Stewart, Craig R. "An Evolutionary Analysis of the Internet Autonomous System Network." Kent State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=kent1276550359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Brooks, Josh Daniel. "Nested (2,r)-regular graphs and their network properties." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1471.

Full text

Abstract:

A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph G is (2, r)-regular where p, s, and m are positive integers, and m ≥ 2, then when n is sufficiently large, then G is isomorphic to G = Ks+mKp, where 2(p-1)+s = r. A nested (2,r)-regular graph is constructed by replacing selected cliques with a (2,r)-regular graph and joining the vertices of the peripheral cliques. For example, in a nested 's' graph when n = s + mp, we obtain n = s1+m1p1+mp. The nested 's' graph is now of the form Gs = Ks1+m1Kp1+mKp. We ex

APA, Harvard, Vancouver, ISO, and other styles

13

Er, Chiangkai. "Speech recognition by clustering wavelet and PLP coefficients." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42742.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Ribeiro, Filho Napoleão Póvoa. "Melhorando o desempenho da técnica de clusterização hierárquica single linkage utilizando a metaheurística GRASP." Universidade Federal do Tocantins, 2016. http://hdl.handle.net/11612/974.

Full text

Abstract:

O problema de clusterização (agrupamento) consiste em, a partir de uma base de dados, agrupar os elementos de modo que os mais similares fiquem no mesmo cluster (grupo), e os elementos menos similares fiquem em clusters distintos. Há várias maneiras de se realizar esses agrupamentos. Uma das mais populares é a hierárquica, onde é criada uma hierarquia de relacionamentos entre os elementos. Há vários métodos de se analisar a similaridade entre elementos no problema de clusterização. O mais utilizado entre eles é o método single linkage, que agrupa os elementos que apresentarem menor distâ

APA, Harvard, Vancouver, ISO, and other styles

15

Zhuang, Yuwen. "Metric Based Automatic Event Segmentation and Network Properties Of Experience Graphs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1337372416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Lin, Kaisheng. "Motif counts, clustering coefficients and vertex degrees in models of random networks." Thesis, University of Oxford, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Luo, Hongwei, and Hongwei luo@rmit edu au. "Modelling and simulation of large-scale complex networks." RMIT University. Mathematical and Geospatial Sciences, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080506.142224.

Full text

Abstract:

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 tw

APA, Harvard, Vancouver, ISO, and other styles

18

Montilla, Michaela. "Vliv parcelačního atlasu na kvalitu klasifikace pacientů s neurodegenerativním onemocněním." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-378150.

Full text

Abstract:

The aim of the thesis is to define the dependency of the classification of patients affected by neurodegenerative diseases on the choice of the parcellation atlas. Part of this thesis is the application of the functional connectivity analysis and the calculation of graph metrics according to the method published by Olaf Sporns and Mikail Rubinov [1] on fMRI data measured at CEITEC MU. The application is preceded by the theoretical research of parcellation atlases for brain segmentation from fMRI frames and the research of mathematical methods for classification as well as classifiers of neurod

APA, Harvard, Vancouver, ISO, and other styles

19

Martinho, Maria. "Spatial analysis of exposure coefficients with applications to stomach cancer." Thesis, University of Oxford, 2007. http://ora.ox.ac.uk/objects/uuid:427fe13e-39b1-4bfd-a3a8-be957120cf44.

Full text

Abstract:

Earlier ecological studies on the relation between H. pylori infection and stomach cancer have considered that the relation between these two variables, as estimated by the exposure coefficient, is constant. However, there is evidence to suggest that this relation changes geographically due to differences in strains of H. pylori. Since the prevalence of H. pylori varies with socio-economic status, the association between the latter and stomach cancer mortality may also vary geographically. This thesis studies stomach cancer by taking into account the geographical variability of the exposure co

APA, Harvard, Vancouver, ISO, and other styles

20

COSTANTINI, GIULIO. "Network analysis: a new perspective on personality psychology." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2015. http://hdl.handle.net/10281/75269.

Full text

Abstract:

A new conception of personality based on network analysis has been recently proposed to overcome some of the limitations of the latent-variable theory of personality. While the latent-variable theory assumes that the covariation among the thoughts, feelings, and behaviors characterizing a personality domain can be explained by the effect of an unobservable latent variable (e.g., extraversion), the network approach conceives personality as emerging from direct interactions among these thoughts, feelings and behaviors. The network perspective motivates new ways of analyzing personality data and

APA, Harvard, Vancouver, ISO, and other styles

21

Shiping, Liu. "Synthetic notions of curvature and applications in graph theory." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-102197.

Full text

Abstract:

The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that of graphs is a very amazing subject. The study of synthetic curvature notions on graphs adds new contributions to this topic. In this thesis, we mainly study two kinds of synthetic curvature notions: the Ollivier-Ricci cuvature on locally finite graphs and the combinatorial curvature on infinite semiplanar graphs. In the first part, we study the Ollivier-Ricci curvature. As known in Riemannian geometry, a lower Ricci curvature bound prevents geodesics from diverging too fast on average. We tra

APA, Harvard, Vancouver, ISO, and other styles

22

Jaskowiak, Pablo Andretta. "Estudo de coeficientes de correlação para medidas de proximidade em dados de expressão gênica." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05052011-143134/.

Full text

Abstract:

O desenvolvimento da tecnologia de microarray tornou possível a mediçao dos níveis de expressão de centenas ou até mesmo milhares de genes simultaneamente para diversas condições experimentais. A grande quantidade de dados disponível gerou a demanda por métodos computacionais que permitam sua análise de forma eficiente e automatizada. Em muitos dos métodos computacionais empregados durante a análise de dados de expressão gênica é necessária a escolha de uma medida de proximidade apropriada entre genes ou amostras. Dentre as medidas de proximidade disponíveis, coeficientes de correlação têm sid

APA, Harvard, Vancouver, ISO, and other styles

23

Blini, Elvio A. "Biases in Visuo-Spatial Attention: from Assessment to Experimental Induction." Doctoral thesis, Università degli studi di Padova, 2016. http://hdl.handle.net/11577/3424480.

Full text

Abstract:

In this work I present several studies, which might appear rather heterogeneous for both experimental questions and methodological approaches, and yet are linked by a common leitmotiv: spatial attention. I will address issues related to the assessment of attentional asymmetries, in the healthy individual as in patients with neurological disorders, their role in various aspects of human cognition, and their neural underpinning, driven by the deep belief that spatial attention plays an important role in various mental processes that are not necessarily confined to perception. What follows is or

APA, Harvard, Vancouver, ISO, and other styles

24

Chou, Chin-Hou, and 周金侯. "The Relationship between Clustering Coefficient and Network Congestion." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/42881159196246437382.

Full text

Abstract:

碩士<br>淡江大學<br>資訊工程學系資訊網路與通訊碩士班<br>98<br>The Internet has been grows vigorously in recent years. The users and the data that will transmission by the network are increasing every year, but the network transmission technology and resource are not enough to deal with so much data. It triggers the network congestion phenomenon. Now, to reduce the network congestion phenomenon becomes an important topic. In this paper, we used the local link switching technology which will improve the network clustering coefficient and maintain the size of the network to adjust the network structure. Then we study

APA, Harvard, Vancouver, ISO, and other styles

25

Zhi-Hao, Zhong, and 鍾志豪. "An Analysis of Library Readers Using Clustering Coefficient." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/21454621440635594698.

Full text

Abstract:

碩士<br>東南科技大學<br>電機工程研究所<br>101<br>In recent years, the quantity of data explodes. Under this circumstance, automated library system records reader’s information in the database. A lot of information is hidden in the data. Data mining is to discover the data and to turn it into information which can be used. 　Data mining has been used in many areas such as marketing and customer relationship management (CRM). Based on the result of data mining, the owners can change merchandise display and understand customers’ life style and habits in order to increase the volume of sales. To use data mining

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Kuan-Chi, and 陳冠奇. "Combine Fuzzy Clustering and Correlation Coefficient for Medical Image Analysis." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/20086993754837383229.

Full text

Abstract:

碩士<br>龍華科技大學<br>資訊管理系碩士班<br>102<br>Automatic visual detection techniques have been widely applied in the medical field in recent years. The advancement of image analysis technology has allowed medical images to provide more accurate references for physicians to use while making diagnoses. However, despite the rapid development of image analysis technology, as body structure, organ size and position differs among patients, the image information may cause misjudgments due to human negligence and noise. This study applied image analysis and detection to CT images of patients with heart disease. I

APA, Harvard, Vancouver, ISO, and other styles

27

Yao, Chen-Han, and 姚成翰. "Reliable Local Recovery Routing Protocol with Clustering Coefficient for Ad Hoc Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/21964992404323705393.

Full text

Abstract:

博士<br>淡江大學<br>資訊工程學系博士班<br>100<br>Nodes in mobile ad hoc network communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing protocol to find the path. In on-demand routing protocols, the source starts a route discovery to find the route leading to the destination. Route discovery is typically performed via flooding, which consumes a lot of control packets. Because of node mobility, the network topology change frequently and cause the route broken. Traditional routing protocols restart a route discovery when link failure. I

APA, Harvard, Vancouver, ISO, and other styles

28

Hwang, Yuan Shiou, and 黃圓修. "Applications of fuzzy clustering method in robust correlation coefficient and robust regression analysis." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/89598475804190416513.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Tsai, Kai-Siang, and 蔡凱翔. "Using local link switching algorithm to control directed and weight network clustering coefficient." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/94797731947635120347.

Full text

Abstract:

碩士<br>淡江大學<br>資訊工程學系碩士班<br>98<br>Over the past decade the studies of complex networks have been analyzed and researched. In analyzing Clustering coefficient is a important concept Clustering coefficient characterizes the relative tightness of a network and is a defining network statistics that appears in many “real-world” network data. This paper proposed a local link switching algorithm which effectively increases the clustering coefficient of a directed weight network while preserving the network node degree distributions. This link switching algorithm is based on local neighborhood informat

APA, Harvard, Vancouver, ISO, and other styles

30

Arraz, Carlos Fernando da Silva. "Algoritmos de clustering para identificação de subtipos de cancro do estômago, tiroide e pele." Master's thesis, 2021. http://hdl.handle.net/1822/73401.

Full text

Abstract:

Dissertação de mestrado em Matemática e Computação<br>A análise da expressão genética é fundamental para o reconhecimento dos genes mais relevantes durante as interações celulares num organismo, principalmente quando estes genes estão relacionados com doenças. Para a realização de um estudo em larga escala acerca das mudanças na expressão genética é necessário encontrar um método, a fim de que este o faça minimizando a taxa de erro e desvio, num processo de aprendizagem contínua. Podemos dizer que uma das maiores conquistas científicas das últimas décadas em Bioinformática foi a introduç

APA, Harvard, Vancouver, ISO, and other styles

31

Shafi, Shanjeeda. "Machine learning and mixture clustering methods for molecular drug discovery: prediction and characterisation of drugs and druggable targets." Thesis, 2021. http://hdl.handle.net/1959.13/1431097.

Full text

Abstract:

Research Doctorate - Doctor of Philosophy (PhD)<br>In the drug discovery process, approximately five to ten thousand compounds are initially screened but only 1% of these enter the preclinical testing stage that determines whether the compound is safe, efficacious, and feasible to use for a disease state. Owing to regulatory, toxicity, resistance and human health concerns, demand is increasing for refinement of and intensive use of molecular physicochemical properties via effective and robust mathematical methods for drug discovery. Chemoinformatics is now a well-recognised discipline focused

APA, Harvard, Vancouver, ISO, and other styles

32

Γεωργιάδης, Γιώργος. "Η παράμετρος της κεντρικότητας σε ανεξάρτητα κλίμακας μεγάλα δίκτυα". 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/137.

Full text

Abstract:

Ένα φαινόμενο που έκανε την εμφάνισή του τα τελευταία χρόνια είναι η μελέτη μεγάλων δικτύων που εμφανίζουν μια ιεραρχική δομή ανεξαρτήτως κλίμακας (large scale-free networks). Μια παραδοσιακή μέθοδος μοντελοποίησης δικτύων είναι η χρήση γραφημάτων και η χρησιμοποίηση αποτελεσμάτων που προκύπτουν από την Θεωρία Γράφων. Όμως στα κλασικά μοντέλα που έχουν μελετηθεί, δυο κόμβοι του ίδιου γραφήματος έχουν την ίδια πιθανότητα να συνδέονται με οποιουσδήποτε δυο άλλους κόμβους. Αυτός ο τρόπος μοντελοποίησης αποτυγχάνει να περιγράψει πολλά δίκτυα της καθημερινής ζωής, όπως δίκτυα γνωριμιών όπου οι κόμβ

APA, Harvard, Vancouver, ISO, and other styles

33

Liang, Chieh-Hsiang, and 梁捷翔. "Extreme Clustering Coefficients In High Edge Density Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/31972955354085060082.

Full text

Abstract:

碩士<br>淡江大學<br>資訊工程學系資訊網路與通訊碩士班<br>98<br>This paper proposed two models with extreme average clustering coefficients and small path length properties for high edge density network. High density networks are common in the analysis of social networks and biological networks. This paper studies networks with extreme statistical properties, that is, max/min clustering coefficients and short average distances. In addition to those properties, the proposed models indicated that in addition to the existing small-world network model and random network model, there are other network models that may prod

APA, Harvard, Vancouver, ISO, and other styles

34

Lee, Che-Chun, and 李哲均. "Finding Overlapping Communities by Local Clustering Coefficients of Seed Nodes." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/m37pq3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Huang, Shi-Yu, and 黃士育. "Overlapping Community Discovery by Combining Local Clustering Coefficients and Neighbor Relationship Measurements." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/r4tqjq.

Full text

Abstract:

碩士<br>樹德科技大學<br>資訊工程系碩士班<br>105<br>Most users of online social networks play different roles at different times due to the diversity of their interests. Overlapping community discovery studies the complexity involved in interpersonal social networks, using various techniques of Social Network Analysis (SNA). SNA identifies seed nodes of social networks, based on which hidden overlapping communities could be found by gradually merging neighboring seeds to form large groups. In methods that select nodes of high degrees only, close-knit groups consisting of nodes of low degrees are often neglecte

APA, Harvard, Vancouver, ISO, and other styles

36

Li, Zheng-Kuan, and 李政寬. "Applying Regression Coefficients Clustering in Multivariate Time Series Transforming for 3D Convolutional Neural Networks." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/cpv42m.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>107<br>Multivariate time series data is very common in real life. Since most problems not only consider a single variable, but also multiple variables affect the label, how to effectively solve the problem of multivariate time series classification remain a major problem in research. In recent years, with the rapid development of Artificial Intelligence (AI), the deep learning framework has been tried to deal with multivariate time series classification problems. This study proposes a method to solve the problem of MTS classification. The multivariate time series dat

APA, Harvard, Vancouver, ISO, and other styles

37

Shiping, Liu. "Synthetic notions of curvature and applications in graph theory." Doctoral thesis, 2012. https://ul.qucosa.de/id/qucosa%3A11816.

Full text

Abstract:

The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that of graphs is a very amazing subject. The study of synthetic curvature notions on graphs adds new contributions to this topic. In this thesis, we mainly study two kinds of synthetic curvature notions: the Ollivier-Ricci cuvature on locally finite graphs and the combinatorial curvature on infinite semiplanar graphs. In the first part, we study the Ollivier-Ricci curvature. As known in Riemannian geometry, a lower Ricci curvature bound prevents geodesics from diverging too fast on average. We tra

APA, Harvard, Vancouver, ISO, and other styles

38

Δαγκλής, Οδυσσέας. "Ζητήματα μοντελοποίησης και προσέγγισης του χρωματικού αριθμού σε scale-free δίκτυα". Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/2104.

Full text

Abstract:

Δίκτυα που εμφανίζουν μόνιμα μια συγκεκριμένη ιδιότητα ανεξάρτητα από το μέγεθος και την πυκνότητά τους ονομάζονται ανεξάρτητα από την κλίμακα (scale-free). Σε πολλά πραγματικά δίκτυα αυτή η ιδιότητα ταυτίζεται με την κατανομή των βαθμών των κόμβων σύμφωνα με τον νόμο της δύναμης με εκθέτη στο διάστημα [2..4]. Η εργασία παρουσιάζει τρία στατικά μοντέλα κατασκευής scale-free δικτύων με την παραπάνω ιδιότητα, βασισμένα στο δυναμικό μοντέλο Barabási-Albert, και επιχειρεί να προσεγγίσει πειραματικά τον χρωματικό τους αριθμό.<br>Networks that exhibit a certain quality irrespective of their size a

APA, Harvard, Vancouver, ISO, and other styles

39

(10725786), James Michael Amstutz. "Cluster-Based Analysis Of Retinitis Pigmentosa Candidate Modifiers Using Drosophila Eye Size And Gene Expression Data." Thesis, 2021.

Find full text

Abstract:

<p>The goal of this thesis is to algorithmically identify candidate modifiers for <i>retinitis pigmentosa</i> (RP) to help improve therapy and predictions for this genetic disorder that may lead to a complete loss of vision. A current research by (Chow et al., 2016) focused on the genetic contributors to RP by trying to recognize a correlation between genetic modifiers and phenotypic variation in female <i>Drosophila melanogaster</i>, or fruit flies. In comparison to the genome-wide association analysis carried out in Chow et al.’s research, this study proposes using a K-Means clustering algor

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!