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 +publisher:"University of Michigan" +contributor:("Vershynin, Roman"). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Michigan

1. Shapiro, Austin Warren. Independence Models for Integer Points of Polytopes.

Degree: PhD, Mathematics, 2011, University of Michigan

 The integer points of a high-dimensional polytope P are generally difficult to count or sample uniformly. We consider a class of low-complexity random models for… (more)

Subjects/Keywords: Polytope; Integer Point; Lattice Point; Littlewood-Offord; Maximum Entropy; Contingency Table; Mathematics; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shapiro, A. W. (2011). Independence Models for Integer Points of Polytopes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/86295

Chicago Manual of Style (16th Edition):

Shapiro, Austin Warren. “Independence Models for Integer Points of Polytopes.” 2011. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/86295.

MLA Handbook (7th Edition):

Shapiro, Austin Warren. “Independence Models for Integer Points of Polytopes.” 2011. Web. 03 Dec 2020.

Vancouver:

Shapiro AW. Independence Models for Integer Points of Polytopes. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/86295.

Council of Science Editors:

Shapiro AW. Independence Models for Integer Points of Polytopes. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/86295


University of Michigan

2. Firouzi, Hamed. High Dimensional Correlation Networks And Their Applications.

Degree: PhD, Electrical Engineering: Systems, 2015, University of Michigan

 Analysis of interactions between variables in a large data set has recently attracted special attention in the context of high dimensional multivariate statistical analysis. Variable… (more)

Subjects/Keywords: Big Data; High Dimensional Data; Correlation Analysis; Time Series Analysis; Covariance Estimation; Dimensionality Reduction; Electrical Engineering; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Firouzi, H. (2015). High Dimensional Correlation Networks And Their Applications. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/113492

Chicago Manual of Style (16th Edition):

Firouzi, Hamed. “High Dimensional Correlation Networks And Their Applications.” 2015. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/113492.

MLA Handbook (7th Edition):

Firouzi, Hamed. “High Dimensional Correlation Networks And Their Applications.” 2015. Web. 03 Dec 2020.

Vancouver:

Firouzi H. High Dimensional Correlation Networks And Their Applications. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/113492.

Council of Science Editors:

Firouzi H. High Dimensional Correlation Networks And Their Applications. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/113492

3. Le, Can M. Estimating Community Structure in Networks by Spectral Methods.

Degree: PhD, Statistics, 2016, University of Michigan

 Networks are studied in a wide range of fields, including social psychology, sociology, physics, computer science, probability, and statistics. One of the fundamental problems in… (more)

Subjects/Keywords: Network analysis; Community detection; Concentration of sparse random graphs; Computer Science; Mathematics; Science (General); Statistics and Numeric Data; Engineering; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, C. M. (2016). Estimating Community Structure in Networks by Spectral Methods. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/133258

Chicago Manual of Style (16th Edition):

Le, Can M. “Estimating Community Structure in Networks by Spectral Methods.” 2016. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/133258.

MLA Handbook (7th Edition):

Le, Can M. “Estimating Community Structure in Networks by Spectral Methods.” 2016. Web. 03 Dec 2020.

Vancouver:

Le CM. Estimating Community Structure in Networks by Spectral Methods. [Internet] [Doctoral dissertation]. University of Michigan; 2016. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/133258.

Council of Science Editors:

Le CM. Estimating Community Structure in Networks by Spectral Methods. [Doctoral Dissertation]. University of Michigan; 2016. Available from: http://hdl.handle.net/2027.42/133258

4. Basu, Sumanta. Modeling and Estimation of High-dimensional Vector Autoregressions.

Degree: PhD, Statistics, 2014, University of Michigan

 Vector Autoregression (VAR) represents a popular class of time series models in applied macroeconomics and finance, widely used for structural analysis and simultaneous forecasting of… (more)

Subjects/Keywords: High-dimensional Statistics; Time Series; Vector Autoregression; Granger Causality; Statistics and Numeric Data; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Basu, S. (2014). Modeling and Estimation of High-dimensional Vector Autoregressions. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/109029

Chicago Manual of Style (16th Edition):

Basu, Sumanta. “Modeling and Estimation of High-dimensional Vector Autoregressions.” 2014. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/109029.

MLA Handbook (7th Edition):

Basu, Sumanta. “Modeling and Estimation of High-dimensional Vector Autoregressions.” 2014. Web. 03 Dec 2020.

Vancouver:

Basu S. Modeling and Estimation of High-dimensional Vector Autoregressions. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/109029.

Council of Science Editors:

Basu S. Modeling and Estimation of High-dimensional Vector Autoregressions. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/109029

5. Ferguson, Timothy James. Extremal Problems in Bergman Spaces.

Degree: PhD, Mathematics, 2011, University of Michigan

 We deal with extremal problems in Bergman spaces. If A^p denotes the Bergman space, then for any given functional phi not equal to zero in… (more)

Subjects/Keywords: Bergman; Extremal Problem; Hardy Space; Mathematics; Science

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

Ferguson, T. J. (2011). Extremal Problems in Bergman Spaces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84458

Chicago Manual of Style (16th Edition):

Ferguson, Timothy James. “Extremal Problems in Bergman Spaces.” 2011. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/84458.

MLA Handbook (7th Edition):

Ferguson, Timothy James. “Extremal Problems in Bergman Spaces.” 2011. Web. 03 Dec 2020.

Vancouver:

Ferguson TJ. Extremal Problems in Bergman Spaces. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/84458.

Council of Science Editors:

Ferguson TJ. Extremal Problems in Bergman Spaces. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84458

6. Rebrova, Elizaveta. Spectral Properties of Heavy-Tailed Random Matrices.

Degree: PhD, Mathematics, 2018, University of Michigan

 The classical Random Matrix Theory studies asymptotic spectral properties of random matrices when their dimensions grow to infinity. In contrast, the non-asymptotic branch of the… (more)

Subjects/Keywords: Random matrix theory; High-dimensional probability; Mathematics; Science

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

Rebrova, E. (2018). Spectral Properties of Heavy-Tailed Random Matrices. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/146003

Chicago Manual of Style (16th Edition):

Rebrova, Elizaveta. “Spectral Properties of Heavy-Tailed Random Matrices.” 2018. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/146003.

MLA Handbook (7th Edition):

Rebrova, Elizaveta. “Spectral Properties of Heavy-Tailed Random Matrices.” 2018. Web. 03 Dec 2020.

Vancouver:

Rebrova E. Spectral Properties of Heavy-Tailed Random Matrices. [Internet] [Doctoral dissertation]. University of Michigan; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/146003.

Council of Science Editors:

Rebrova E. Spectral Properties of Heavy-Tailed Random Matrices. [Doctoral Dissertation]. University of Michigan; 2018. Available from: http://hdl.handle.net/2027.42/146003

7. Lee, Seung Jin. Centrally Symmetric Polytopes with Many Faces.

Degree: PhD, Mathematics, 2013, University of Michigan

 We study the convex hull of the symmetric moment curve Uk(t)=(cos t, sin t, cos 3t, sin 3t, ldots, cos (2k-1)t, sin (2k-1)t) in {ℝ}2k(more)

Subjects/Keywords: Polytopes; Mathematics; Science

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

Lee, S. J. (2013). Centrally Symmetric Polytopes with Many Faces. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/99877

Chicago Manual of Style (16th Edition):

Lee, Seung Jin. “Centrally Symmetric Polytopes with Many Faces.” 2013. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/99877.

MLA Handbook (7th Edition):

Lee, Seung Jin. “Centrally Symmetric Polytopes with Many Faces.” 2013. Web. 03 Dec 2020.

Vancouver:

Lee SJ. Centrally Symmetric Polytopes with Many Faces. [Internet] [Doctoral dissertation]. University of Michigan; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/99877.

Council of Science Editors:

Lee SJ. Centrally Symmetric Polytopes with Many Faces. [Doctoral Dissertation]. University of Michigan; 2013. Available from: http://hdl.handle.net/2027.42/99877

8. Wang, Yizao. Topics on Max-stable Processes and the Central Limit Theorem.

Degree: PhD, Statistics, 2012, University of Michigan

 This dissertation consists of results in two distinct areas of probability theory. One is the extreme value theory, the other is the central limit theorem.… (more)

Subjects/Keywords: Max-stable Process; Central Limit Theorem; Statistics and Numeric Data; Science

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

Wang, Y. (2012). Topics on Max-stable Processes and the Central Limit Theorem. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/93809

Chicago Manual of Style (16th Edition):

Wang, Yizao. “Topics on Max-stable Processes and the Central Limit Theorem.” 2012. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/93809.

MLA Handbook (7th Edition):

Wang, Yizao. “Topics on Max-stable Processes and the Central Limit Theorem.” 2012. Web. 03 Dec 2020.

Vancouver:

Wang Y. Topics on Max-stable Processes and the Central Limit Theorem. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/93809.

Council of Science Editors:

Wang Y. Topics on Max-stable Processes and the Central Limit Theorem. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/93809

9. Calder, Jeffrey William. Hamilton-Jacobi Equations for Sorting and Percolation Problems.

Degree: PhD, Applied and Interdisciplinary Mathematics, 2014, University of Michigan

 In this dissertation we prove continuum limits for some sorting and percolation problems that are important in mathematical, scientific, and engineering contexts. The first problem… (more)

Subjects/Keywords: Non-dominated Sorting; Longest Chain Problem; Multi-objective Optimization; Viscosity Solutions; Hamilton-Jacobi Equations; Directed Last Passage Percolation; Computer Science; Mathematics; Science (General); Engineering; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Calder, J. W. (2014). Hamilton-Jacobi Equations for Sorting and Percolation Problems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108848

Chicago Manual of Style (16th Edition):

Calder, Jeffrey William. “Hamilton-Jacobi Equations for Sorting and Percolation Problems.” 2014. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/108848.

MLA Handbook (7th Edition):

Calder, Jeffrey William. “Hamilton-Jacobi Equations for Sorting and Percolation Problems.” 2014. Web. 03 Dec 2020.

Vancouver:

Calder JW. Hamilton-Jacobi Equations for Sorting and Percolation Problems. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/108848.

Council of Science Editors:

Calder JW. Hamilton-Jacobi Equations for Sorting and Percolation Problems. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108848

10. Padakandla, Arun Raghuthama. An Algebraic Framework for Multi-Terminal Communication.

Degree: PhD, Electrical Engineering: Systems, 2014, University of Michigan

 We consider the problem of developing coding techniques and characterizing information-theoretic achievable rate regions for the following three multi-terminal communication channels. Firstly, we study an… (more)

Subjects/Keywords: Multi-terminal Information Theory; Achievable Rate Regions; Three User Broadcast Channel; Three User Interference Channel; Coset Codes; Multiple Access Channel With Distributed States; Electrical Engineering; Engineering

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

Padakandla, A. R. (2014). An Algebraic Framework for Multi-Terminal Communication. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/107264

Chicago Manual of Style (16th Edition):

Padakandla, Arun Raghuthama. “An Algebraic Framework for Multi-Terminal Communication.” 2014. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/107264.

MLA Handbook (7th Edition):

Padakandla, Arun Raghuthama. “An Algebraic Framework for Multi-Terminal Communication.” 2014. Web. 03 Dec 2020.

Vancouver:

Padakandla AR. An Algebraic Framework for Multi-Terminal Communication. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/107264.

Council of Science Editors:

Padakandla AR. An Algebraic Framework for Multi-Terminal Communication. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/107264

11. Wootters, Mary Katherine. Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes.

Degree: PhD, Mathematics, 2014, University of Michigan

 We study two problems in coding theory, list-decoding and local-decoding. We take a probabilistic approach to these problems, in contrast to more typical algebraic approaches.… (more)

Subjects/Keywords: Error Correcting Codes; High Dimensional Probability; Mathematics; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wootters, M. K. (2014). Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/108844

Chicago Manual of Style (16th Edition):

Wootters, Mary Katherine. “Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes.” 2014. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/108844.

MLA Handbook (7th Edition):

Wootters, Mary Katherine. “Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes.” 2014. Web. 03 Dec 2020.

Vancouver:

Wootters MK. Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/108844.

Council of Science Editors:

Wootters MK. Any Errors in this Dissertation are Probably Fixable: Topics in Probability and Error Correcting Codes. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/108844

12. Tan, Yan Shuo. Some Algorithms and Paradigms for Big Data.

Degree: PhD, Mathematics, 2018, University of Michigan

 The reality of big data poses both opportunities and challenges to modern researchers. Its key features  – large sample sizes, high-dimensional feature spaces, and structural… (more)

Subjects/Keywords: big data; optimization; mathematical data science; machine learning; signal processing; Mathematics; Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tan, Y. S. (2018). Some Algorithms and Paradigms for Big Data. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/145895

Chicago Manual of Style (16th Edition):

Tan, Yan Shuo. “Some Algorithms and Paradigms for Big Data.” 2018. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/145895.

MLA Handbook (7th Edition):

Tan, Yan Shuo. “Some Algorithms and Paradigms for Big Data.” 2018. Web. 03 Dec 2020.

Vancouver:

Tan YS. Some Algorithms and Paradigms for Big Data. [Internet] [Doctoral dissertation]. University of Michigan; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/145895.

Council of Science Editors:

Tan YS. Some Algorithms and Paradigms for Big Data. [Doctoral Dissertation]. University of Michigan; 2018. Available from: http://hdl.handle.net/2027.42/145895

13. Benson-Putnins, David T. Volumes and Integer Points of Multi-Index Transportation Polytopes.

Degree: PhD, Mathematics, 2015, University of Michigan

 Counting the integer points of transportation polytopes has important applications in statistics for tests of statistical significance, as well as in several applications in combinatorics.… (more)

Subjects/Keywords: combinatorics; integer points; transportation polytope; Fourier analysis; Asymptotic counting; Mathematics; Science

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benson-Putnins, D. T. (2015). Volumes and Integer Points of Multi-Index Transportation Polytopes. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/111456

Chicago Manual of Style (16th Edition):

Benson-Putnins, David T. “Volumes and Integer Points of Multi-Index Transportation Polytopes.” 2015. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/111456.

MLA Handbook (7th Edition):

Benson-Putnins, David T. “Volumes and Integer Points of Multi-Index Transportation Polytopes.” 2015. Web. 03 Dec 2020.

Vancouver:

Benson-Putnins DT. Volumes and Integer Points of Multi-Index Transportation Polytopes. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/111456.

Council of Science Editors:

Benson-Putnins DT. Volumes and Integer Points of Multi-Index Transportation Polytopes. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/111456

.