Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(random regular graphs). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of South Carolina

1. Clifton, Ann Wells. The Packing Chromatic Number of Random d-regular Graphs.

Degree: MS, Mathematics, 2015, University of South Carolina

  Let G = (V (G),E(G)) be a simple graph of order n and let i be a positive integer. Xi superset V (G) is… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Packing Chromatic Number; Random d-regular Graphs; Configuration model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clifton, A. W. (2015). The Packing Chromatic Number of Random d-regular Graphs. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3697

Chicago Manual of Style (16th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Masters Thesis, University of South Carolina. Accessed July 14, 2020. https://scholarcommons.sc.edu/etd/3697.

MLA Handbook (7th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Web. 14 Jul 2020.

Vancouver:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Internet] [Masters thesis]. University of South Carolina; 2015. [cited 2020 Jul 14]. Available from: https://scholarcommons.sc.edu/etd/3697.

Council of Science Editors:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Masters Thesis]. University of South Carolina; 2015. Available from: https://scholarcommons.sc.edu/etd/3697


ETH Zürich

2. Kamčev, Nina. Colourings of Graphs and Words.

Degree: 2018, ETH Zürich

 Extremal graph theory is concerned with the extreme values of a graph parameter over various classes of graphs. Randomised constructions have played a major role… (more)

Subjects/Keywords: random graphs; Ramsey theory; Graph theory; Random regular graph; Random processes; Hales-Jewett theorem; Local lemma; info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamčev, N. (2018). Colourings of Graphs and Words. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/282692

Chicago Manual of Style (16th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Doctoral Dissertation, ETH Zürich. Accessed July 14, 2020. http://hdl.handle.net/20.500.11850/282692.

MLA Handbook (7th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Web. 14 Jul 2020.

Vancouver:

Kamčev N. Colourings of Graphs and Words. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/20.500.11850/282692.

Council of Science Editors:

Kamčev N. Colourings of Graphs and Words. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/282692


Université Paris-Sud – Paris XI

3. Le Masson, Etienne. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.

Degree: Docteur es, Mathématiques, 2013, Université Paris-Sud – Paris XI

Dans cette thèse, nous étudions les propriétés de concentration des fonctions propres du laplacien discret sur des graphes réguliers de degré fixé dont le nombre… (more)

Subjects/Keywords: Fonctions propres du laplacien; Ergodicité quantique; Analyse semi-classique; Opérateurs pseudo-différentiels; Graphes réguliers; Grands graphes aléatoires; Laplacian eigenfunctions; Quantum ergodicity; Semi-classical analysis; Pseudo-differential operators; Regular graphs; Large random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le Masson, E. (2013). Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112179

Chicago Manual of Style (16th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed July 14, 2020. http://www.theses.fr/2013PA112179.

MLA Handbook (7th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Web. 14 Jul 2020.

Vancouver:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2013PA112179.

Council of Science Editors:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112179

4. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

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

Chicago Manual of Style (16th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 14, 2020. http://hdl.handle.net/10045/98110.

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

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 14 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10045/98110.

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

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

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

5. Johnson, Tobias Lee. Eigenvalue fluctuations for random regular graphs.

Degree: PhD, 2014, University of Washington

 One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe… (more)

Subjects/Keywords: corners process; eigenvalue fluctuations; minors process; Poisson approximation; random regular graphs; Stein's method; Mathematics; mathematics

…for introducing me to research and to random regular graphs. I’m grateful to her for… …method and try to apply it to cycle counts of random regular graphs has shaped my mathematical… …investigating properties of eigenvalues of random regular graphs from the perspective of random matrix… …theory. 1.2 Stein’s method applied to random regular graphs Graph eigenvalues have a close… …exploit this by determining spectral properties of random regular graphs by looking at the… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, T. L. (2014). Eigenvalue fluctuations for random regular graphs. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/26531

Chicago Manual of Style (16th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Doctoral Dissertation, University of Washington. Accessed July 14, 2020. http://hdl.handle.net/1773/26531.

MLA Handbook (7th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Internet] [Doctoral dissertation]. University of Washington; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1773/26531.

Council of Science Editors:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Doctoral Dissertation]. University of Washington; 2014. Available from: http://hdl.handle.net/1773/26531

.