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

Language: English

You searched for subject:(regular AND random wave forces). Showing records 1 – 6 of 6 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


ETH Zürich

1. 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

2. Bettinelli, Jérémie. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.

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

Au cours de ce travail, nous nous intéressons aux limites d'échelle de deux classes de cartes. Dans un premier temps, nous regardons les quadrangulations biparties… (more)

Subjects/Keywords: Cartes aléatoires; Arbres aléatoires; Limite d'échelle; Processus conditionnés; Convergence régulière; Topologie de Gromov; Dimension de Hausdorff; Arbre continu brownien; Espaces métriques aléatoires; Random maps; Random trees; Scaling limits; Conditioned processes; Regular convergence; Gromov topology; Hausdorff dimension; Brownian CRT; Random metric spaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bettinelli, J. (2011). Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112213

Chicago Manual of Style (16th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed July 14, 2020. http://www.theses.fr/2011PA112213.

MLA Handbook (7th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Web. 14 Jul 2020.

Vancouver:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2011PA112213.

Council of Science Editors:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112213

3. Banna, Marwa. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.

Degree: Docteur es, Mathématiques, 2015, Université Paris-Est

Cette thèse porte essentiellement sur l'étude de la distribution spectrale limite de grandes matrices aléatoires dont les entrées sont corrélées et traite également d'inégalités de… (more)

Subjects/Keywords: Matrices Aléatoires; Matrices de covariance empirique; Distribution spectrale limite; Processus absolument régulier; Inégalités de déviation; Random Matrices; Sample covariance matrices; Limiting spectral distribution; Absolutely regular processes; Deviiation inequalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Banna, M. (2015). Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1107

Chicago Manual of Style (16th Edition):

Banna, Marwa. “Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed July 14, 2020. http://www.theses.fr/2015PESC1107.

MLA Handbook (7th Edition):

Banna, Marwa. “Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.” 2015. Web. 14 Jul 2020.

Vancouver:

Banna M. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2015PESC1107.

Council of Science Editors:

Banna M. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1107

4. 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

5. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the… (more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

…Decompositions of Random Regular Graphs As Barát and Thomassen [11] note, decompositions of… …translate this structural problem to the setting of random d-regular graphs: Theorem 3.1.8. A… …random 4-regular graph on n vertices has an orientation with out-degrees 0 or 3 asymptotically… …investigation is extending classical results to the so-called “sparse random setting”. If fn,m (H… …the sparse random setting. As demonstrated in this thesis for permutations and vector spaces… 

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):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

Chicago Manual of Style (16th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 14 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669

6. Sharma, Abhishek. High throughput path selection for unstructured data center networks.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

 The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work… (more)

Subjects/Keywords: Data Center; Multipath Transmission Control Protocol (MPTCP); Jellyfish; Shortest Paths; Disjoint Paths; Throughput; Random Regular Graph (RRG); Random Permutation Matrix; Switches; Servers; Ports; Network Density

…are all conducted on the Jellyfish topology. The topology is essentially a random regular… …computed once the random regular graph and traffic matrix has been constructed. We tested and… …random permutation traffic i.e. each source server randomly selects a destination server to… …from random permutation traffic. 3.4 Throughput computation In our experiments, we have… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharma, A. (2013). High throughput path selection for unstructured data center networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45451

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):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/45451.

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

MLA Handbook (7th Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Web. 14 Jul 2020.

Vancouver:

Sharma A. High throughput path selection for unstructured data center networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/45451.

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

Council of Science Editors:

Sharma A. High throughput path selection for unstructured data center networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45451

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

.