Amanda Redlich

Assistant Professor of Mathematics

Teaching this semester

MATH 2000. Linear Algebra, B

A study of linear algebra in the context of Euclidean spaces and their subspaces, with selected examples drawn from more general vector spaces. Topics will include: vectors, linear independence and span, linear transformations, matrices and their inverses, bases, dimension and rank, determinants, eigenvalues and eigenvectors, diagonalization and change of basis, and orthogonality. Applications drawn from linear systems of equations, discrete dynamical systems, Markov chains, computer graphics, and least-squares approximation.

MATH 2206. Probability

A study of the mathematical models used to formalize nondeterministic or “chance” phenomena. General topics include combinatorial models, probability spaces, conditional probability, discrete and continuous random variables, independence and expected values. Specific probability densities, such as the binomial, Poisson, exponential, and normal, are discussed in depth.

Teaching next semester

MATH 2000. Linear Algebra, A

A study of linear algebra in the context of Euclidean spaces and their subspaces, with selected examples drawn from more general vector spaces. Topics will include: vectors, linear independence and span, linear transformations, matrices and their inverses, bases, dimension and rank, determinants, eigenvalues and eigenvectors, diagonalization and change of basis, and orthogonality. Applications drawn from linear systems of equations, discrete dynamical systems, Markov chains, computer graphics, and least-squares approximation.

Education

  • B.A., University of Chicago
  • Ph.D., MIT

PDF Curriculum Vitae

Publications

Amanda Redlich: Power laws and power-of-two-choices, submitted.

Amanda Redlich: A power-of-two-choices unbalanced allocation process, SIAM J. Discrete Math, 31-1 (2017), pp. 477-488.

Robert DeMarco, Amanda Redlich: Graph decomposition and parity, J. Graph Theory 82 (4): 374–386 (2016).

J. Augustine, W. K. Moses Jr., A. Redlich, E. Upfal: Ballanced allocation: Patience is not a virtue, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, (2016) 655-671.

Robert DeMarco, Jeffry Kahn, Amanda Redlich: Modular statistics for subgraph counts in sparse random graphs, Electronic J. of Combinatorics 22(1): P1.37 (2015).

Shabnam Beheshti, Amanda Redlich: Remarks on combinatorial aspects of the KP Equation, Proceedings of the Second International Conference on Nonlinear and Modern Mathematical Physics, AIP Conf. Proc. 1562, 5 (2013).

S. Patil, S. Roy, J. Augustine, A. Redlich, A. Deshpande, M. Gharote, S. Lodha, A. Mehrotra, H. Vin: Minimizing Testing Overheads in Database Migration Lifecycle. Proceedings of 16th International Conference on Management of Data (COMAD), 2010. 

Igor Pak, Amanda Redlich: Long cycles in abc-permutations.  Functional Analysis and Other Mathematics 2(1): 87-92 (2008).

David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial properties of a rooted graph polynomial. SIAM J. Discrete Math. 22(2): 776-785 (2008)D. Eisenstat, J. Feder, G. Francos, G. Gordon, A. Redlich: Expected rank and randomness in rooted graphs. Discrete Applied Mathematics 156(5): 746-756 (2008)

Selected Talks

Random Walks and Metrics Minisymposium, SIAM Annual Meeting, Pittsburgh PA, July 2017 - Generating power-law-like distributions easily: Popularity contests

Computer Science & Engineering Seminar, Indian Institute of Technology Madras, May 2017 - The power of two choices when the rich get richer: multiple choice at the multiplex

Topology et al. Seminar, Wesleyan University, Nov. 2016 - Graph counting and combina- torial games: A logical connection

Special Session on Extremal and Probabilistic Combinatorics, AMS Fall Central Sectional Meeting, University of St. Thomas, Oct. 2016 - The waiting game: Balanced allocation via random choices

MSCS Seminar, Macalester College, Oct. 2016 - The best random choice

Special Session on New Developments in Graphs and Hypergraphs, AMS Fall Eastern Sectional Meeting, Bowdoin College, Sept. 2016 - Strategic graph decompositions

SIAM Workshop on Network Science, Boston MA, July 2016 - Designing exit frequency distance measures for biological networks

Randomized Structures and Algorithms, Carnegie Mellon University, July 2015 - Power laws and the power of two choices

Colby-Bowdoin-Bates Math Colloquium, April 2015 - There is method in madness: Increasing randomness to decrease randomness

ICERM, Providence RI, March 2014 - Subgraphs in random graphs

Discrete Mathematics Days in the Northeast, Middletown CT, October 2013 - Parity, first-order logic, and gluing and cutting graphs

IAS WAM Research Seminar, Princeton NJ, May 2013 - Gluing graphs, ungluing graphs, and first-order logic with parity

DIMACS/CCICADA Interdisciplinary Seminar, Piscataway NJ, April 2013 - Unbalanced allocations and cost minimization

Applied Communication Sciences, Basking Ridge NJ, April 2013 - Logic, parity, and counting subgraphs in random graphs

Princeton Discrete Mathematics Seminar, Princeton NJ, March 2013 - Graph constructions, graph decompositions, and random graphs

Bell Labs Mathematics Colloquium, Murray Hill NJ, Jan. 2013 - Unbalanced allocations and cost minimization

Midwestern Graph Theory Conference LIII, Ames IA, Sept. 2012 - Logic and graph decompositions

2012 SIAM Conference on Discrete Mathematics, Halifax NS, June 2012 - The power and weakness of two choices

Applied Mathematics Colloquium, Illinois Institute of Technology, Chicago IL, April 2012 - Deterministic randomness

Penn Combinatorics and Probability Seminar, Philadelphia PA, March 2012 - Deterministic random algorithms

Columbia Discrete Math Seminar, New York NY, March 2012 - Logic, parity, and graph decompositions