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 graphs). Showing records 1 – 30 of 179 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Rutgers University

1. Baron, Jacob D., 1988-. Two problems on cycles in random graphs.

Degree: PhD, Mathematics, 2016, Rutgers University

We prove three results. First, an old conjecture of Zs. Tuza says that for any graph G, the ratio of the minimum size, τ3(G), of… (more)

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baron, Jacob D., 1. (2016). Two problems on cycles in random graphs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51229/

Chicago Manual of Style (16th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Doctoral Dissertation, Rutgers University. Accessed July 14, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

MLA Handbook (7th Edition):

Baron, Jacob D., 1988-. “Two problems on cycles in random graphs.” 2016. Web. 14 Jul 2020.

Vancouver:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Jul 14]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/.

Council of Science Editors:

Baron, Jacob D. 1. Two problems on cycles in random graphs. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51229/


The Ohio State University

2. Poole, Daniel James. A Study of Random Hypergraphs and Directed Graphs.

Degree: PhD, Mathematics, 2014, The Ohio State University

 We establish and describe the likely structure of random hypergraph and directed graph models, expanding upon classical results that pertain to the likely structure of… (more)

Subjects/Keywords: Mathematics; Random Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Poole, D. J. (2014). A Study of Random Hypergraphs and Directed Graphs. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674

Chicago Manual of Style (16th Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Doctoral Dissertation, The Ohio State University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

MLA Handbook (7th Edition):

Poole, Daniel James. “A Study of Random Hypergraphs and Directed Graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674.

Council of Science Editors:

Poole DJ. A Study of Random Hypergraphs and Directed Graphs. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1397222674


Oregon State University

3. Choi, In-kyeong. On straight line representations of random planar graphs.

Degree: PhD, Mathematics, 1992, Oregon State University

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, I. (1992). On straight line representations of random planar graphs. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/16942

Chicago Manual of Style (16th Edition):

Choi, In-kyeong. “On straight line representations of random planar graphs.” 1992. Doctoral Dissertation, Oregon State University. Accessed July 14, 2020. http://hdl.handle.net/1957/16942.

MLA Handbook (7th Edition):

Choi, In-kyeong. “On straight line representations of random planar graphs.” 1992. Web. 14 Jul 2020.

Vancouver:

Choi I. On straight line representations of random planar graphs. [Internet] [Doctoral dissertation]. Oregon State University; 1992. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1957/16942.

Council of Science Editors:

Choi I. On straight line representations of random planar graphs. [Doctoral Dissertation]. Oregon State University; 1992. Available from: http://hdl.handle.net/1957/16942


Michigan State University

4. Spencer, Joseph J. Probabilistic threshold for collapsibility in random graphs.

Degree: PhD, Department of Mathematics, 1993, Michigan State University

Subjects/Keywords: Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Spencer, J. J. (1993). Probabilistic threshold for collapsibility in random graphs. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:22491

Chicago Manual of Style (16th Edition):

Spencer, Joseph J. “Probabilistic threshold for collapsibility in random graphs.” 1993. Doctoral Dissertation, Michigan State University. Accessed July 14, 2020. http://etd.lib.msu.edu/islandora/object/etd:22491.

MLA Handbook (7th Edition):

Spencer, Joseph J. “Probabilistic threshold for collapsibility in random graphs.” 1993. Web. 14 Jul 2020.

Vancouver:

Spencer JJ. Probabilistic threshold for collapsibility in random graphs. [Internet] [Doctoral dissertation]. Michigan State University; 1993. [cited 2020 Jul 14]. Available from: http://etd.lib.msu.edu/islandora/object/etd:22491.

Council of Science Editors:

Spencer JJ. Probabilistic threshold for collapsibility in random graphs. [Doctoral Dissertation]. Michigan State University; 1993. Available from: http://etd.lib.msu.edu/islandora/object/etd:22491


Indian Institute of Science

5. Francis, Mathew C. Intersection Graphs Of Boxes And Cubes.

Degree: 2009, Indian Institute of Science

 A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such… (more)

Subjects/Keywords: Computer Graphics; Boxicity (Graphs); Cubicity (Graphs); Interval Graphs; Halin Graphs; Planar Graphs; Intersection Graphs; Random Graphs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Francis, M. C. (2009). Intersection Graphs Of Boxes And Cubes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1027

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

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://hdl.handle.net/2005/1027.

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

MLA Handbook (7th Edition):

Francis, Mathew C. “Intersection Graphs Of Boxes And Cubes.” 2009. Web. 14 Jul 2020.

Vancouver:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2005/1027.

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

Council of Science Editors:

Francis MC. Intersection Graphs Of Boxes And Cubes. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/1027

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


Indian Institute of Science

6. Mathew, Rogers. Boxicity And Cubicity : A Study On Special Classes Of Graphs.

Degree: 2012, Indian Institute of Science

 Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping… (more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2320

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

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://hdl.handle.net/2005/2320.

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

MLA Handbook (7th Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2005/2320.

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

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2320

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


Indian Institute of Science

7. Mathew, Rogers. Boxicity And Cubicity : A Study On Special Classes Of Graphs.

Degree: 2012, Indian Institute of Science

 Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping… (more)

Subjects/Keywords: Graphs; Boxicity; Leaf Powers; Random Grpahs; Line Graphs; Chordal Bipartite Graphs; Random Graphs; k-chordal Graphs; Crossing Number; Cubicity; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mathew, R. (2012). Boxicity And Cubicity : A Study On Special Classes Of Graphs. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

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

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf.

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

MLA Handbook (7th Edition):

Mathew, Rogers. “Boxicity And Cubicity : A Study On Special Classes Of Graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2020 Jul 14]. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf.

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

Council of Science Editors:

Mathew R. Boxicity And Cubicity : A Study On Special Classes Of Graphs. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2320 ; http://etd.ncsi.iisc.ernet.in/abstracts/2983/G25263-Abs.pdf

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


Ryerson University

8. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

 In this thesis we address three main problems in clique detection in the area of Graph Theory. i) Most of current methods for clique detection… (more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed July 14, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

MLA Handbook (7th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 14 Jul 2020.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Jul 14]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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


University of Waterloo

9. Sato, Cristiane Maria. Core Structures in Random Graphs and Hypergraphs.

Degree: 2013, University of Waterloo

 The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by… (more)

Subjects/Keywords: combinatorics; graph theory; random graphs; probabilistic; enumeration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sato, C. M. (2013). Core Structures in Random Graphs and Hypergraphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7787

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

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/7787.

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

MLA Handbook (7th Edition):

Sato, Cristiane Maria. “Core Structures in Random Graphs and Hypergraphs.” 2013. Web. 14 Jul 2020.

Vancouver:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/7787.

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

Council of Science Editors:

Sato CM. Core Structures in Random Graphs and Hypergraphs. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7787

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


University of Illinois – Chicago

10. Cole, Samuel. An Iterative Spectral Approach to Recovering Planted Partitions.

Degree: 2018, University of Illinois – Chicago

 In the planted partition problem, the n vertices of a random graph are partitioned into k "clusters," and edges between vertices in the same cluster… (more)

Subjects/Keywords: Planted partition; Clustering; Random graphs; Spectral algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cole, S. (2018). An Iterative Spectral Approach to Recovering Planted Partitions. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22704

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

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Thesis, University of Illinois – Chicago. Accessed July 14, 2020. http://hdl.handle.net/10027/22704.

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

MLA Handbook (7th Edition):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Web. 14 Jul 2020.

Vancouver:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10027/22704.

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

Council of Science Editors:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22704

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


Virginia Tech

11. Parikh, Nidhi Kiranbhai. Generating Random Graphs with Tunable Clustering Coefficient.

Degree: MS, Computer Science, 2011, Virginia Tech

 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… (more)

Subjects/Keywords: Clustering coefficient; complex networks; random graphs; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parikh, N. K. (2011). Generating Random Graphs with Tunable Clustering Coefficient. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31591

Chicago Manual of Style (16th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Masters Thesis, Virginia Tech. Accessed July 14, 2020. http://hdl.handle.net/10919/31591.

MLA Handbook (7th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Web. 14 Jul 2020.

Vancouver:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10919/31591.

Council of Science Editors:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/31591


Delft University of Technology

12. Van Dijk, L.A. (author). On the simplicity of configuration model random graphs.

Degree: 2011, Delft University of Technology

This thesis consits of a literature study and an investigation of a new problem. This new problem involves a generalization of the (random graph) configuration model, the so-called alternative model.

Probability theory

Applied mathematics

Electrical Engineering, Mathematics and Computer Science

Advisors/Committee Members: Hooghiemstra, G. (mentor).

Subjects/Keywords: Random Graphs; Configuration Model; Applied Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Dijk, L. A. (. (2011). On the simplicity of configuration model random graphs. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f

Chicago Manual of Style (16th Edition):

Van Dijk, L A (author). “On the simplicity of configuration model random graphs.” 2011. Masters Thesis, Delft University of Technology. Accessed July 14, 2020. http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f.

MLA Handbook (7th Edition):

Van Dijk, L A (author). “On the simplicity of configuration model random graphs.” 2011. Web. 14 Jul 2020.

Vancouver:

Van Dijk LA(. On the simplicity of configuration model random graphs. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2020 Jul 14]. Available from: http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f.

Council of Science Editors:

Van Dijk LA(. On the simplicity of configuration model random graphs. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:0d28a7a1-3704-40d3-a2af-2760cb7ec33f


Drexel University

13. Wildman, Jeffrey William, II. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.

Degree: 2015, Drexel University

The shared medium of wireless communication networks presents many technical challenges that offer a rich modeling and design space across both physical and scheduling protocol… (more)

Subjects/Keywords: Electrical engineering; Random graphs; Stochastic geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wildman, Jeffrey William, I. (2015). Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/idea:6399

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

Wildman, Jeffrey William, II. “Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.” 2015. Thesis, Drexel University. Accessed July 14, 2020. http://hdl.handle.net/1860/idea:6399.

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

MLA Handbook (7th Edition):

Wildman, Jeffrey William, II. “Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory.” 2015. Web. 14 Jul 2020.

Vancouver:

Wildman, Jeffrey William I. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. [Internet] [Thesis]. Drexel University; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1860/idea:6399.

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

Council of Science Editors:

Wildman, Jeffrey William I. Throughput Characterizations of Wireless Networks via Stochastic Geometry and Random Graph Theory. [Thesis]. Drexel University; 2015. Available from: http://hdl.handle.net/1860/idea:6399

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

14. Asiri, Maha Mohammed. A transfer learning-based feature reduction method to improve classification accuracy.

Degree: 2017, NC Docks

 The need for efficient data use grows in machine learning algorithm for dataset with larger feature sets. Feature selection is the process of selecting minimum… (more)

Subjects/Keywords: Machine learning; Random graphs; Decision trees; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Asiri, M. M. (2017). A transfer learning-based feature reduction method to improve classification accuracy. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf

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

Asiri, Maha Mohammed. “A transfer learning-based feature reduction method to improve classification accuracy.” 2017. Thesis, NC Docks. Accessed July 14, 2020. http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf.

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

MLA Handbook (7th Edition):

Asiri, Maha Mohammed. “A transfer learning-based feature reduction method to improve classification accuracy.” 2017. Web. 14 Jul 2020.

Vancouver:

Asiri MM. A transfer learning-based feature reduction method to improve classification accuracy. [Internet] [Thesis]. NC Docks; 2017. [cited 2020 Jul 14]. Available from: http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf.

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

Council of Science Editors:

Asiri MM. A transfer learning-based feature reduction method to improve classification accuracy. [Thesis]. NC Docks; 2017. Available from: http://libres.uncg.edu/ir/uncg/f/Asiri_uncg_0154M_12397.pdf

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


University of Waterloo

15. Graf, Alessandra. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.

Degree: 2016, University of Waterloo

 A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each pair of vertices u and… (more)

Subjects/Keywords: random graphs; directed graphs; strongly connected components; percolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graf, A. (2016). On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10681

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

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/10681.

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

MLA Handbook (7th Edition):

Graf, Alessandra. “On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences.” 2016. Web. 14 Jul 2020.

Vancouver:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/10681.

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

Council of Science Editors:

Graf A. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10681

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


Harvard University

16. Huang, Jiaoyang. Spectral Statistics of Random d-Regular Graphs.

Degree: PhD, 2019, Harvard University

In this thesis we study the uniform random d-regular graphs on N vertices from a random matrix theory point of view. In the first part… (more)

Subjects/Keywords: sparse random graphs; random matrices; eigenvalue statistics; eigenvector statistics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, J. (2019). Spectral Statistics of Random d-Regular Graphs. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716

Chicago Manual of Style (16th Edition):

Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Doctoral Dissertation, Harvard University. Accessed July 14, 2020. http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.

MLA Handbook (7th Edition):

Huang, Jiaoyang. “Spectral Statistics of Random d-Regular Graphs.” 2019. Web. 14 Jul 2020.

Vancouver:

Huang J. Spectral Statistics of Random d-Regular Graphs. [Internet] [Doctoral dissertation]. Harvard University; 2019. [cited 2020 Jul 14]. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716.

Council of Science Editors:

Huang J. Spectral Statistics of Random d-Regular Graphs. [Doctoral Dissertation]. Harvard University; 2019. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:42029716


University of Bath

17. Rosoman, Thomas. Critical values in continuum and dependent percolation.

Degree: PhD, 2011, University of Bath

 In the first part of this thesis I consider site and bond percolation on a Random Connection Model and prove that for a wide range… (more)

Subjects/Keywords: 519; random sequential adsorption; random geometric graphs; percolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rosoman, T. (2011). Critical values in continuum and dependent percolation. (Doctoral Dissertation). University of Bath. Retrieved from https://researchportal.bath.ac.uk/en/studentthesis/critical-values-in-continuum-and-dependent-percolation(b05185ea-e111-4f5d-9dec-92723099f580).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.545313

Chicago Manual of Style (16th Edition):

Rosoman, Thomas. “Critical values in continuum and dependent percolation.” 2011. Doctoral Dissertation, University of Bath. Accessed July 14, 2020. https://researchportal.bath.ac.uk/en/studentthesis/critical-values-in-continuum-and-dependent-percolation(b05185ea-e111-4f5d-9dec-92723099f580).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.545313.

MLA Handbook (7th Edition):

Rosoman, Thomas. “Critical values in continuum and dependent percolation.” 2011. Web. 14 Jul 2020.

Vancouver:

Rosoman T. Critical values in continuum and dependent percolation. [Internet] [Doctoral dissertation]. University of Bath; 2011. [cited 2020 Jul 14]. Available from: https://researchportal.bath.ac.uk/en/studentthesis/critical-values-in-continuum-and-dependent-percolation(b05185ea-e111-4f5d-9dec-92723099f580).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.545313.

Council of Science Editors:

Rosoman T. Critical values in continuum and dependent percolation. [Doctoral Dissertation]. University of Bath; 2011. Available from: https://researchportal.bath.ac.uk/en/studentthesis/critical-values-in-continuum-and-dependent-percolation(b05185ea-e111-4f5d-9dec-92723099f580).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.545313


Temple University

18. Ratner, Michael. Quantum Walks and Structured Searches on Free Groups and Networks.

Degree: PhD, 2017, Temple University

Mathematics

Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of… (more)

Subjects/Keywords: Mathematics; Computer science; Quantum physics;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ratner, M. (2017). Quantum Walks and Structured Searches on Free Groups and Networks. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,442825

Chicago Manual of Style (16th Edition):

Ratner, Michael. “Quantum Walks and Structured Searches on Free Groups and Networks.” 2017. Doctoral Dissertation, Temple University. Accessed July 14, 2020. http://digital.library.temple.edu/u?/p245801coll10,442825.

MLA Handbook (7th Edition):

Ratner, Michael. “Quantum Walks and Structured Searches on Free Groups and Networks.” 2017. Web. 14 Jul 2020.

Vancouver:

Ratner M. Quantum Walks and Structured Searches on Free Groups and Networks. [Internet] [Doctoral dissertation]. Temple University; 2017. [cited 2020 Jul 14]. Available from: http://digital.library.temple.edu/u?/p245801coll10,442825.

Council of Science Editors:

Ratner M. Quantum Walks and Structured Searches on Free Groups and Networks. [Doctoral Dissertation]. Temple University; 2017. Available from: http://digital.library.temple.edu/u?/p245801coll10,442825


Uniwersytet im. Adama Mickiewicza w Poznaniu

19. Banaszak, Justyna. O strukturze grafów Kroneckera .

Degree: 2019, Uniwersytet im. Adama Mickiewicza w Poznaniu

 Przedmiotem pracy jest asymptotyczna struktura grafów Kroneckera. Grafem Kroneckera nazywamy graf, w którym zbiór wierzchołków stanowią wszystkie ciągi binarne o długości n, w którym prawdopodobieństwo,… (more)

Subjects/Keywords: graphs; grafy; combinatorics; kombinatoryka; random structures; struktury losowe; Kronecker graphs; grafy Kroneckera

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Banaszak, J. (2019). O strukturze grafów Kroneckera . (Doctoral Dissertation). Uniwersytet im. Adama Mickiewicza w Poznaniu. Retrieved from http://hdl.handle.net/10593/24948

Chicago Manual of Style (16th Edition):

Banaszak, Justyna. “O strukturze grafów Kroneckera .” 2019. Doctoral Dissertation, Uniwersytet im. Adama Mickiewicza w Poznaniu. Accessed July 14, 2020. http://hdl.handle.net/10593/24948.

MLA Handbook (7th Edition):

Banaszak, Justyna. “O strukturze grafów Kroneckera .” 2019. Web. 14 Jul 2020.

Vancouver:

Banaszak J. O strukturze grafów Kroneckera . [Internet] [Doctoral dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10593/24948.

Council of Science Editors:

Banaszak J. O strukturze grafów Kroneckera . [Doctoral Dissertation]. Uniwersytet im. Adama Mickiewicza w Poznaniu; 2019. Available from: http://hdl.handle.net/10593/24948


UCLA

20. Cook, Nicholas Andrew. Spectral properties of non-Hermitian random matrices.

Degree: Mathematics, 2016, UCLA

 This thesis presents new results concerning the spectral properties of certain families of large random matrices. The overarching goal is to extend some well-known results… (more)

Subjects/Keywords: Mathematics; circular law; random graphs; random matrices; singularity probability; singular values; universality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cook, N. A. (2016). Spectral properties of non-Hermitian random matrices. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/18w762mz

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

Cook, Nicholas Andrew. “Spectral properties of non-Hermitian random matrices.” 2016. Thesis, UCLA. Accessed July 14, 2020. http://www.escholarship.org/uc/item/18w762mz.

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

MLA Handbook (7th Edition):

Cook, Nicholas Andrew. “Spectral properties of non-Hermitian random matrices.” 2016. Web. 14 Jul 2020.

Vancouver:

Cook NA. Spectral properties of non-Hermitian random matrices. [Internet] [Thesis]. UCLA; 2016. [cited 2020 Jul 14]. Available from: http://www.escholarship.org/uc/item/18w762mz.

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

Council of Science Editors:

Cook NA. Spectral properties of non-Hermitian random matrices. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/18w762mz

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


University of Oxford

21. Giasemidis, Georgios. Spectral dimension in graph models of causal quantum gravity.

Degree: PhD, 2013, University of Oxford

 The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed… (more)

Subjects/Keywords: 539; Theoretical physics; quantum gravity; lattice quantum gravity; spectral dimension; random walks; random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Giasemidis, G. (2013). Spectral dimension in graph models of causal quantum gravity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415

Chicago Manual of Style (16th Edition):

Giasemidis, Georgios. “Spectral dimension in graph models of causal quantum gravity.” 2013. Doctoral Dissertation, University of Oxford. Accessed July 14, 2020. http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415.

MLA Handbook (7th Edition):

Giasemidis, Georgios. “Spectral dimension in graph models of causal quantum gravity.” 2013. Web. 14 Jul 2020.

Vancouver:

Giasemidis G. Spectral dimension in graph models of causal quantum gravity. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2020 Jul 14]. Available from: http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415.

Council of Science Editors:

Giasemidis G. Spectral dimension in graph models of causal quantum gravity. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415


Rutgers University

22. Costello, Kevin, 1981-. Ranks of random matrices and graphs.

Degree: PhD, Mathematics, 2007, Rutgers University

Let Q_n be a random symmetric matrix whose entries on and above the main diagonal are independent random variables (e.g. the adjacency matrix of an… (more)

Subjects/Keywords: Random matrices; Random graphs; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Costello, Kevin, 1. (2007). Ranks of random matrices and graphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810

Chicago Manual of Style (16th Edition):

Costello, Kevin, 1981-. “Ranks of random matrices and graphs.” 2007. Doctoral Dissertation, Rutgers University. Accessed July 14, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810.

MLA Handbook (7th Edition):

Costello, Kevin, 1981-. “Ranks of random matrices and graphs.” 2007. Web. 14 Jul 2020.

Vancouver:

Costello, Kevin 1. Ranks of random matrices and graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Jul 14]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810.

Council of Science Editors:

Costello, Kevin 1. Ranks of random matrices and graphs. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15810


University of Minnesota

23. Oh, Sang-youn. Information theory of random trees induced by stochastic grammars.

Degree: PhD, Electrical Engineering, 2012, University of Minnesota

 Previous research has been done on the information theory of binary random rooted tree models in which every nonleaf vertex in a tree has exactly… (more)

Subjects/Keywords: Data compression; Information theory; Lossless source coding; Random graphs; Random trees; Stochastic grammars; Electrical Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oh, S. (2012). Information theory of random trees induced by stochastic grammars. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/129866

Chicago Manual of Style (16th Edition):

Oh, Sang-youn. “Information theory of random trees induced by stochastic grammars.” 2012. Doctoral Dissertation, University of Minnesota. Accessed July 14, 2020. http://purl.umn.edu/129866.

MLA Handbook (7th Edition):

Oh, Sang-youn. “Information theory of random trees induced by stochastic grammars.” 2012. Web. 14 Jul 2020.

Vancouver:

Oh S. Information theory of random trees induced by stochastic grammars. [Internet] [Doctoral dissertation]. University of Minnesota; 2012. [cited 2020 Jul 14]. Available from: http://purl.umn.edu/129866.

Council of Science Editors:

Oh S. Information theory of random trees induced by stochastic grammars. [Doctoral Dissertation]. University of Minnesota; 2012. Available from: http://purl.umn.edu/129866


Ryerson University

24. Haidar, Ali. The CC-Game: A Variant Of The Game Of Cops And Robbers.

Degree: 2012, Ryerson University

 Cops and Robbers is a vertex pursuit game played on graphs. The objective of the game, as the name suggests, is for a set of… (more)

Subjects/Keywords: Graph theory  – Data processing; Random graphs; Graph algorithms; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haidar, A. (2012). The CC-Game: A Variant Of The Game Of Cops And Robbers. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

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

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Thesis, Ryerson University. Accessed July 14, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

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

MLA Handbook (7th Edition):

Haidar, Ali. “The CC-Game: A Variant Of The Game Of Cops And Robbers.” 2012. Web. 14 Jul 2020.

Vancouver:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Internet] [Thesis]. Ryerson University; 2012. [cited 2020 Jul 14]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866.

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

Council of Science Editors:

Haidar A. The CC-Game: A Variant Of The Game Of Cops And Robbers. [Thesis]. Ryerson University; 2012. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1866

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

25. Lopes, Fabio Marcellus Lima Sá Makiyama. Limite do fluído para o grafo aleatório de Erdos-Rényi.

Degree: Mestrado, Estatística, 2010, University of São Paulo

Neste trabalho, aplicamos o algoritmo Breadth-First Search para encontrar o tamanho de uma componente conectada no grafo aleatório de Erdos-Rényi. Uma cadeia de Markov é… (more)

Subjects/Keywords: Cadeias de Markov; Convergence; Convergência; Grafos aleatórios.; Markov chains; Random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopes, F. M. L. S. M. (2010). Limite do fluído para o grafo aleatório de Erdos-Rényi. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;

Chicago Manual of Style (16th Edition):

Lopes, Fabio Marcellus Lima Sá Makiyama. “Limite do fluído para o grafo aleatório de Erdos-Rényi.” 2010. Masters Thesis, University of São Paulo. Accessed July 14, 2020. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;.

MLA Handbook (7th Edition):

Lopes, Fabio Marcellus Lima Sá Makiyama. “Limite do fluído para o grafo aleatório de Erdos-Rényi.” 2010. Web. 14 Jul 2020.

Vancouver:

Lopes FMLSM. Limite do fluído para o grafo aleatório de Erdos-Rényi. [Internet] [Masters thesis]. University of São Paulo; 2010. [cited 2020 Jul 14]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;.

Council of Science Editors:

Lopes FMLSM. Limite do fluído para o grafo aleatório de Erdos-Rényi. [Masters Thesis]. University of São Paulo; 2010. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;

26. Borges, Nash. Robust Anomaly Detection with Applications to Acoustics and Graphs.

Degree: 2014, Johns Hopkins University

 Our goal is to develop a robust anomaly detector that can be incorporated into pattern recognition systems that may need to learn, but will never… (more)

Subjects/Keywords: Anomaly Detection; Divergence Estimation; Speech Activity Detection; Random Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Borges, N. (2014). Robust Anomaly Detection with Applications to Acoustics and Graphs. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/36963

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

Borges, Nash. “Robust Anomaly Detection with Applications to Acoustics and Graphs.” 2014. Thesis, Johns Hopkins University. Accessed July 14, 2020. http://jhir.library.jhu.edu/handle/1774.2/36963.

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

MLA Handbook (7th Edition):

Borges, Nash. “Robust Anomaly Detection with Applications to Acoustics and Graphs.” 2014. Web. 14 Jul 2020.

Vancouver:

Borges N. Robust Anomaly Detection with Applications to Acoustics and Graphs. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2020 Jul 14]. Available from: http://jhir.library.jhu.edu/handle/1774.2/36963.

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

Council of Science Editors:

Borges N. Robust Anomaly Detection with Applications to Acoustics and Graphs. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/36963

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


University of New South Wales

27. Levenkova, Natalya. Applications of graph theory to real-world networks.

Degree: Mathematics & Statistics, 2014, University of New South Wales

 We apply graph theory to two problems involving real-world networks. The firstproblem is to model sexual contact networks, while the second involves criminal networks.The structure… (more)

Subjects/Keywords: Contact networks; Graph theory; Epidemiology; Random graphs; Stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Levenkova, N. (2014). Applications of graph theory to real-world networks. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Levenkova, Natalya. “Applications of graph theory to real-world networks.” 2014. Masters Thesis, University of New South Wales. Accessed July 14, 2020. http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true.

MLA Handbook (7th Edition):

Levenkova, Natalya. “Applications of graph theory to real-world networks.” 2014. Web. 14 Jul 2020.

Vancouver:

Levenkova N. Applications of graph theory to real-world networks. [Internet] [Masters thesis]. University of New South Wales; 2014. [cited 2020 Jul 14]. Available from: http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true.

Council of Science Editors:

Levenkova N. Applications of graph theory to real-world networks. [Masters Thesis]. University of New South Wales; 2014. Available from: http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true


University of Waterloo

28. Kulmatitskiy, Nikolay. Modeling Dynamic Network with Centrality-based Logistic Regression.

Degree: 2011, University of Waterloo

 Statistical analysis of network data is an active field of study, in which researchers inves- tigate graph-theoretic concepts and various probability models that explain the… (more)

Subjects/Keywords: Dynamic Networks; Network Analysis; Centrality; Exponential Random Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kulmatitskiy, N. (2011). Modeling Dynamic Network with Centrality-based Logistic Regression. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6290

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

Kulmatitskiy, Nikolay. “Modeling Dynamic Network with Centrality-based Logistic Regression.” 2011. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/6290.

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

MLA Handbook (7th Edition):

Kulmatitskiy, Nikolay. “Modeling Dynamic Network with Centrality-based Logistic Regression.” 2011. Web. 14 Jul 2020.

Vancouver:

Kulmatitskiy N. Modeling Dynamic Network with Centrality-based Logistic Regression. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/6290.

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

Council of Science Editors:

Kulmatitskiy N. Modeling Dynamic Network with Centrality-based Logistic Regression. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6290

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

29. Ketelboeter, Brian. The Probabilistic Method and Random Graphs.

Degree: Mathematics, 2012, University of Manitoba

 The probabilistic method in combinatorics is a nonconstructive tool popularized through the work of Paul Erd˝os. Many difficult problems can be solved through a relatively… (more)

Subjects/Keywords: Random graphs; probability

…method and random graphs, along with an outline of this thesis. 1.1 The probabilistic method… …of Claim 1 and other probabilistic results in Ramsey theory. 1.2 Random graphs In their… …random graphs. Their idea was to use probabilistic and statistical methods to study limiting… …graphs is to think of a random graph as a living organism that evolves with time. Let p be the… …fundamental to the development of random graphs was the ability to present many different and… 

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

Ketelboeter, B. (2012). The Probabilistic Method and Random Graphs. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/9228

Chicago Manual of Style (16th Edition):

Ketelboeter, Brian. “The Probabilistic Method and Random Graphs.” 2012. Masters Thesis, University of Manitoba. Accessed July 14, 2020. http://hdl.handle.net/1993/9228.

MLA Handbook (7th Edition):

Ketelboeter, Brian. “The Probabilistic Method and Random Graphs.” 2012. Web. 14 Jul 2020.

Vancouver:

Ketelboeter B. The Probabilistic Method and Random Graphs. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1993/9228.

Council of Science Editors:

Ketelboeter B. The Probabilistic Method and Random Graphs. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/9228


University of Michigan

30. Karrer, Brian C. Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology.

Degree: PhD, Physics, 2012, University of Michigan

 In this dissertation, we present research on several topics in networks including community detection, random graphs, and network epidemiology. Traditional stochastic blockmodels may produce inaccurate… (more)

Subjects/Keywords: Networks; Community Detection; Random Graphs; Network Epidemiology; Physics; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karrer, B. C. (2012). Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/91512

Chicago Manual of Style (16th Edition):

Karrer, Brian C. “Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology.” 2012. Doctoral Dissertation, University of Michigan. Accessed July 14, 2020. http://hdl.handle.net/2027.42/91512.

MLA Handbook (7th Edition):

Karrer, Brian C. “Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology.” 2012. Web. 14 Jul 2020.

Vancouver:

Karrer BC. Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2027.42/91512.

Council of Science Editors:

Karrer BC. Topics in Networks: Community Detection, Random Graphs, and Network Epidemiology. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/91512

[1] [2] [3] [4] [5] [6]

.