Log in

Relevant bibliographies by topics / Random graphs / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Random graphs.

Dissertations / Theses on the topic 'Random graphs'

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 50 dissertations / theses for your research on the topic 'Random graphs.'

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

Ramos, Garrido Lander. "Graph enumeration and random graphs." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.

Full text

Abstract:

In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical behaviour of an element of fixed size chosen uniformly at random, when the size tends to infinity (random graphs). The problems concern graphs subject to global conditions, such as being planar and/or with restrictions on the degrees of the verti

APA, Harvard, Vancouver, ISO, and other styles

2

Seierstad, Taral Guldahl. "The phase transition in random graphs and random graph processes." Doctoral thesis, [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985760044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Engström, Stefan. "Random acyclicorientations of graphs." Thesis, KTH, Matematik (Avd.), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-116500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Heckel, Annika. "Colourings of random graphs." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875.

Full text

Abstract:

We study graph parameters arising from different types of colourings of random graphs, defined broadly as an assignment of colours to either the vertices or the edges of a graph. The chromatic number X(G) of a graph is the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. Determining the chromatic number is one of the classic challenges in random graph theory. In Chapter 3, we give new upper and lower bounds for the chromatic number of the dense random graph G(n,p)) where p ∈ (0,1) is constant. These bounds are the first to mat

APA, Harvard, Vancouver, ISO, and other styles

5

Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical netw

APA, Harvard, Vancouver, ISO, and other styles

6

Bienvenu, François. "Random graphs in evolution." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS180.

Full text

Abstract:

Cette thèse est composée de cinq projets de recherche indépendants, tous en lien soit avec les graphes aléatoires, soit avec la biologie évolutive - mais pour la plupart à l'interface de ces deux disciplines. Dans les Chapitres 2 et 3, nous introduisons deux modèles de graphes aléatoires correspondant à la distribution stationnaire d'une chaîne de Markov. Le premier de ces modèles, que nous appelons le graphe "split-and-drift", décrit la structure et la dynamique des réseaux d'interfécondité; le second est une forêt aléatoire inspirée du modèle de Moran, modèle central de la génétique des popu

APA, Harvard, Vancouver, ISO, and other styles

7

Johansson, Tony. "Random Graphs and Algorithms." Research Showcase @ CMU, 2017. http://repository.cmu.edu/dissertations/938.

Full text

Abstract:

This thesis is concerned with the study of random graphs and random algorithms. There are three overarching themes. One theme is sparse random graphs, i.e. random graphs in which the average degree is bounded with high probability. A second theme is that of finding spanning subsets such as spanning trees, perfect matchings and Hamilton cycles. A third theme is solving optimization problems on graphs with random edge costs.

APA, Harvard, Vancouver, ISO, and other styles

8

Ross, Christopher Jon. "Properties of Random Threshold and Bipartite Graphs." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306296991.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pymar, Richard James. "Random graphs and random transpositions on a circle." Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Crippa, Davide. "q-distributions and random graphs /." [S.l.] : [s.n.], 1994. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10923.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Weissl, Andreas Christian. "Random graphs with structural constraints /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Panagiotou, Konstantinos. "Colorability properties of random graphs /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17740.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Schickinger, Thomas. "Complete subgraphs of random graphs." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=966629353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Weigel, Martin. "Vertex Models on Random Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2004. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-37308.

Full text

Abstract:

Diese Arbeit befaßt sich mit der Koppelung von Vertex-Modellen an die planaren $\phi^4$-Zufallsgraphen des Zugangs zur Quantengravitation über dynamische Polygonifizierungen. Das betrachtete System hat eine doppelte Bedeutung, einerseits als die Koppelung einer konformen Feldtheorie mit zentraler Ladung $C=1$ an zweidimensionale Euklidische Quantengravitation, andererseits als Anwendung von geometrischer, "annealed" Unordnung auf ein prototypisches Modell der statistischen Mechanik. Da das Modell mit Hilfe einer großangelegten Reihe von Monte Carlo Simulationen untersucht wird, müssen entsprec

APA, Harvard, Vancouver, ISO, and other styles

15

Penman, David Binnie. "Random graphs with correlation structure." Thesis, University of Sheffield, 1998. http://etheses.whiterose.ac.uk/14768/.

Full text

Abstract:

In this thesis we consider models of random graphs where, unlike in the classical models G (n, p) the probability of an edge arising can be correlated with that of other edges arising. Attention focuses on graphs whose vertices are each assigned a colour (type) at random and where edges between differently coloured vertices subsequently arise with different probabilities (so-called RRC graphs), especially the special case with two colours. Various properties of these graphs are considered, often by comparing and contrasting them with the classical model with the same probability of each partic

APA, Harvard, Vancouver, ISO, and other styles

16

Dou, Carl C. Z. (Carl Changzhu). "Studies of random walks on groups and random graphs." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/13243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Kang, Mihyun. "Random planar structures and random graph processes." Doctoral thesis, [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985516585.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

White, M. D. "Cycles in edge-coloured graphs and subgraphs of random graphs." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:95ef351e-acb1-442c-adf5-970487e30a4d.

Full text

Abstract:

This thesis will study a variety of problems in graph theory. Initially, the focus will be on finding minimal degree conditions which guarantee the existence of various subgraphs. These subgraphs will all be formed of cycles, and this area of work will fall broadly into two main categories. First to be considered are cycles in edge-coloured graphs and, in particular, two questions of Li, Nikiforov and Schelp. It will be shown that a 2-edge-coloured graph with minimal degree at least 3n/4 either is isomorphic to the complete 4-partite graph with classes of order n/4, or contains monochromatic c

APA, Harvard, Vancouver, ISO, and other styles

19

Weinstein, Lee. "Empirical study of graph properties with particular interest towards random graphs." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/1485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Riordan, Oliver Maxim. "Subgraphs of the discrete torus, random graphs and general graph invariants." Thesis, University of Cambridge, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Bertacchi, D., and Andreas Cap@esi ac at. "Random Walks on Diestel--Leader Graphs." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi1004.ps.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Kurauskas, Valentas. "On two models of random graphs." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2013~D_20131216_081822-36288.

Full text

Abstract:

The dissertation consists of two parts. In the first part several asymptotic properties of random intersection graphs are studied. They include birth thresholds for small complete subgraphs in the binomial random intersection graph, the clique number in sparse random intersection graphs and the chromatic index of random uniform hypergraphs. Several new methods and theoretically and practically relevant algorithms are proposed. Some results are illustrated with data from real-world networks. The second part deals with asymptotic enumeration and properties of graphs from minor-closed classes in

APA, Harvard, Vancouver, ISO, and other styles

23

Broutin, Nicolas. "Random trees, graphs and recursive partitions." Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00842019.

Full text

Abstract:

Je présente dans ce mémoire mes travaux sur les limites d'échelle de grandes structures aléatoires. Il s'agit de décrire les structures combinatoires dans la limite des grandes tailles en prenant un point de vue objectif dans le sens où on cherche des limites des objets, et non pas seulement de paramètres caractéristiques (même si ce n'est pas toujours le cas dans les résultats que je présente). Le cadre général est celui des structures critiques pour lesquelles on a typiquement des distances caractéristiques polynomiales en la taille, et non concentrées. Sauf exception, ces structures ne sont

APA, Harvard, Vancouver, ISO, and other styles

24

Beis, Michail. "Greedy algorithms for random regular graphs." Thesis, University of Liverpool, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.427021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bode, Michel. "Random graphs on the hyperbolic plane." Thesis, University of Birmingham, 2016. http://etheses.bham.ac.uk//id/eprint/6526/.

Full text

Abstract:

In this thesis, we study a recently proposed model of random graphs that exhibit properties which are present in a wide range of networks arising in real world settings. The model creates random geometric graphs on the hyperbolic plane, where vertices are connected if they are within a certain threshold distance. We study typical properties of these graphs. We identify two critical values for one of the parameters that act as sharp thresholds. The three resulting intervals of the parameters that correspond to three possible phases of the random structure: A.a.s., the graph is connected; A.a.s.

APA, Harvard, Vancouver, ISO, and other styles

26

Nyberg, Brodda Carl-Fredrik. "Deterministic and Random Pebbling of Graphs." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-325833.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Fraiman, Nicolás. "Connectivity of random graphs and networks." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=119575.

Full text

Abstract:

In this manuscript we discuss connectivity and distance properties for several models of random graphs. The results we prove generalize well known theorems for the Erdös-Rényi model and percolation on a ﬁnite box. We show that for both Inhomogeneous Random Graphs and Distance Fading Grid Networks there is a sharp transition for connectivity and we ﬁnd the corresponding threshold values. We also provide a bound for the diameter for the Random Connection Model when the underlying space is the torus in d dimensions.<br>Dans cette thèse, on étudie les propriétés de connexité pour plusieurs modèles

APA, Harvard, Vancouver, ISO, and other styles

28

Sylvester, John A. "Random walks, effective resistance and neighbourhood statistics in binomial random graphs." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/106467/.

Full text

Abstract:

The binomial random graph model G(n; p), along with its near-twin sibling G(n; m), were the starting point for the entire study of random graphs and even probabilistic combinatorics as a whole. The key properties of these models are woven into the fabric of the field and their behaviour serves as a benchmark to compare any other model of random structure. In this thesis we contribute to the already rich literature on G(n; p) in a number of directions. Firstly, vertex to vertex hitting times of random walks in G(n; p) are considered via their interpretation as potential differences in an electr

APA, Harvard, Vancouver, ISO, and other styles

29

Wallén, Daniel. "Cover times of random walks on graphs." Thesis, Uppsala University, Department of Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-125278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kakarlapudi, Geetha. "Analysis of beacon triangulation in random graphs." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1447.

Full text

Abstract:

Our research focusses on the problem of finding nearby peers in the Internet. We focus on one particular approach, Beacon Triangulation that is widely used to solve the peer-finding problem. Beacon Triangulation is based on relative distances of nodes to some special nodes called beacons. The scheme gives an error when a new node that wishes to join the network has the same relative distance to two or more nodes. One of the reasons for the error is that two or more nodes have the same distance vectors. As a part of our research work, we derive the conditions to ensure the uniqueness of distanc

APA, Harvard, Vancouver, ISO, and other styles

31

Sbihi, Amine M. (Amine Mohammed). "Covering times for random walks on graphs." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74538.

Full text

Abstract:

This thesis is a contribution to the covering times problems for random walks on graphs. By considering uniform random walks on finite connected graphs, the covering time is defined as the time (number of steps) taken by the random walk to visit every vertex. The motivating problem of this thesis is to find bounds for the expected covering times. We provide explicit bounds that are uniformly valid over all starting points and over large classes of graphs. In some cases the asymptotic distribution of the suitably normalized covering time is given as well.

APA, Harvard, Vancouver, ISO, and other styles

32

MuÌˆller, Tobias. "Random geometric graphs : colouring and related topics." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Dowden, Christopher Thomas. "Uniform random planar graphs with degree constraints." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:f8a9afe3-30ad-4672-9a6c-4fb9ac9af041.

Full text

Abstract:

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph $P_{n}$, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set $ { 1,2, ldots, n }$, are now known, and variations on this standard random graph are also attracting interest. Prominent among the work on $P_{n}$ have been asymptotic results for the probability that $P_{n}$ will be connected or contain given components/ subgraphs. Such progress has been achieved through a combination of counting arguments cite{mcd} and a

APA, Harvard, Vancouver, ISO, and other styles

34

Gao, Rong. "Some colouring problems for Pseudo-Random Graphs." Thesis, University of Essex, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494355.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Fastlund, Niklas. "The subgraph containment problem in random graphs." Thesis, Uppsala universitet, Algebra och geometri, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-260377.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Folz, Matthew Bryan. "Adapted metrics and random walks on graphs." Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/44947.

Full text

Abstract:

This thesis discusses various aspects of continuous-time simple random walks on measure weighted graphs, with a focus on behaviors related to large-scale geometric properties of the underlying graph. In contrast to previous work in this area, the majority of the results presented here are applicable to random walks with unbounded generators. A recurring theme in this research is the use of novel distance functions for graphs known as adapted metrics, which are demonstrated to be a powerful tool for studying random walks on graphs. Chapter 2 provides an overview of the relevant probabilist

APA, Harvard, Vancouver, ISO, and other styles

37

Suen, W. C. S. "Flows, cliques and paths in random graphs." Thesis, University of Bristol, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.354470.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Cerqueira, Andressa. "Statistical inference on random graphs and networks." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-04042018-094802/.

Full text

Abstract:

In this thesis we study two probabilistic models defined on graphs: the Stochastic Block model and the Exponential Random Graph. Therefore, this thesis is divided in two parts. In the first part, we introduce the Krichevsky-Trofimov estimator for the number of communities in the Stochastic Block Model and prove its eventual almost sure convergence to the underlying number of communities, without assuming a known upper bound on that quantity. In the second part of this thesis we address the perfect simulation problem for the Exponential random graph model. We propose an algorithm based on the C

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

Anthapadmanabhan, Nagaraj Prasanth. "Random codes and graphs for secure communication." College Park, Md.: University of Maryland, 2009. http://hdl.handle.net/1903/9293.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2009.<br>Thesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

41

Brody, Justin. "On the model theory of random graphs." College Park, Md. : University of Maryland, 2009. http://hdl.handle.net/1903/9291.

Full text

Abstract:

Thesis (Ph.D.) -- University of Maryland, College Park, 2009.<br>Thesis research directed by: Dept. of Mathematics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

42

Andersson, Evelina. "Random sampling of finite graphs with constraints." Thesis, Uppsala universitet, Algebra och geometri, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-219764.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Hardy, Bradley. "Heuristic methods for colouring dynamic random graphs." Thesis, Cardiff University, 2018. http://orca.cf.ac.uk/109385/.

Full text

Abstract:

Many real-world operational research problems can be reformulated into static graph colouring problems. However, such problems might be better represented as dynamic graphs if their size and/or constraints change over time. In this thesis, we explore heuristics approaches for colouring dynamic random graphs. We consider two di�erent types of dynamic graph: edge dynamic and vertex dynamic. We also consider two di�erent change scenarios for each of these dynamic graph types: without future change information (i. e. random change) and with probabilistic future change information. By considering a

APA, Harvard, Vancouver, ISO, and other styles

44

Xu, Keyulu. "Graph structures, random walks, and all that : learning graphs with jumping knowledge networks." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/121660.

Full text

Abstract:

This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 51-54).<br>Graph representation learning aims to extract high-level features from the graph structures and node features, in order to make predictions about the nodes and the graphs. Applications include predicting chemical prope

APA, Harvard, Vancouver, ISO, and other styles

45

Dartois, Stephane. "Random Tensor models : Combinatorics, Geometry, Quantum Gravity and Integrability." Thesis, Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCD104/document.

Full text

Abstract:

Dans cette thèse nous explorons différentes facettes des modèles de tenseurs aléatoires. Les modèles de tenseurs aléatoires ont été introduits en physique dans le cadre de l'étude de la gravité quantique. En effet les modèles de matrices aléatoires, qui sont un cas particuliers de modèles de tenseurs, en sont une des origines. Ces modèles de matrices sont connus pour leur riche combinatoire et l'incroyable diversité de leurs propriétés qui les font toucher tous les domaines de l'analyse, la géométrie et des probabilités. De plus leur étude par les physiciens ont prouvé leur efficacité en ce qu

APA, Harvard, Vancouver, ISO, and other styles

46

Wang, Yang. "Use of finite random graphs to model packet radio networks." Ohio : Ohio University, 1990. http://www.ohiolink.edu/etd/view.cgi?ohiou1183474696.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kartun-Giles, Alexander Paul. "Connectivity and centrality in dense random geometric graphs." Thesis, University of Bristol, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.720827.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kohayakawa, Yoshiharu. "Extremal combinatorics and the evolution of random graphs." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335739.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Lim, Kim-Huat. "Modelling epidemics via empirical measures and random graphs." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445786.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Atkin, Max R. "Applications of random graphs to 2D quantum gravity." Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.598036.

Full text

Abstract:

The central topic of this thesis is two dimensional Quantum Gravity and its properties. The term Quantum Gravity itself is ambiguous as there are many proposals for its correct formulation and none of them have been verified experimentally. In this thesis we consider a number of closely related approaches to two dimensional quantum gravity that share the property that they may be formulated in terms of random graphs. In one such approach known as Causal Dynamical Triangulations, numerical computations suggest an interesting phenomenon in which the effective spacetime dimension is reduced in t

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!