Joint Mathematics Meetings AMS Special Session

Current as of Saturday, January 16, 2021 03:30:05

Joint Mathematics Meetings

• January 6-9, 2021 (Wednesday - Saturday)
• Meeting #1163

Associate secretaries:

Brian D. Boe, AMS brian@math.uga.edu
Hortensia Soto, MAA hortensia.soto@colostate.edu

• Saturday January 9, 2021, 8:00 a.m.-11:50 a.m.
  AMS Special Session on Applied Combinatorial Methods, I
  Organizers:
  Stephen J. Young, Pacific Northwest National Lab stephen.young@pnnl.gov
  Sinan G. Aksoy, Pacific Northwest National Lab
  

  • 8:00 a.m.
    Spectral methods for clustering signed and directed graphs, and constrained clustering.
    Mihai Cucuringu*, Department of Statistics & Mathematical Institute, University of Oxford; The Alan Turing Institute, London, UK
    (1163-62-809)
  • 8:30 a.m.
    Some combinatorics of RNA branching.
    Christine Heitsch*, Georgia Institute of Technology
    Svetlana Poznanovic, Clemson University
    (1163-92-826)
  • 9:00 a.m.
    Rand Error Calculations for Watershed Segmentations and Connected Component Segmentations.
    Beate G. Zimmer*, Texas A&M University-Corpus Christi
    Reid B. Porter, Los Alamos National Laboratory
    (1163-05-145)
  • 9:30 a.m.
    Hypergraph Cuts with General Splitting Functions.
    Austin R Benson*, Cornell University
    Jon Kleinberg, Cornell University
    Nate Veldt, Cornell University
    (1163-68-369)
  • 10:00 a.m.
    Computational Complexity and Forbidden Graph Patterns.
    Puck Rombach*, University of Vermont
    (1163-05-1646)
  • 10:30 a.m.
    Ramanujan Graphs and Supercomputing Topologies.
    Stephen J Young*, Pacific Northwest National Laboratory
    (1163-05-799)
  • 11:00 a.m.
    Constructing Admissible Voter Preferences with the Voter Basis.
    Andrew Beveridge*, Macalester College
    Ian Calaway, Stanford University
    (1163-05-198)
  • 11:30 a.m.
    Graph Algorithms in Neuromorphic Computing.
    Bill Kay*, Oak Ridge National Laboratory
    Pasanna Date, Oak Ridge National Laboratory
    Catherine Schuman, Oak Ridge National Laboratory
    Jade O'Connor, Oak Ridge National Laboratory
    (1163-68-708)
• Saturday January 9, 2021, 1:00 p.m.-5:50 p.m.
  AMS Special Session on Applied Combinatorial Methods, II
  Organizers:
  Stephen J. Young, Pacific Northwest National Lab stephen.young@pnnl.gov
  Sinan G. Aksoy, Pacific Northwest National Lab
  

  • 1:00 p.m.
    On work of Ron Graham.
    Steve Butler*, Iowa State University
    (1163-05-701)
  • 1:30 p.m.
    The localization number of a graph.
    Anthony Bonato*, Ryerson University
    (1163-05-291)
  • 2:00 p.m.
    Spectral threshold for extremal cyclic edge-connectivity.
    Sinan Aksoy, Pacific Northwest National Lab
    Mark Kempton*, Brigham Young University
    Stephen Young, Pacific Northwest National Lab
    (1163-05-360)
  • 2:30 p.m.
    Naval applications of combinatorics.
    Mark Bilinski*, Naval Information Warfare Center Pacific
    (1163-05-634)
  • 3:00 p.m.
    LDPC Codes Achieve List-Decoding Capacity.
    Jonathan Mosheiff, Carnegie Mellon University
    Nicolas Resch, CWI
    Noga Ron-Zewi, University of Haifa
    Shashwat Silas, Stanford
    Mary Wootters*, Stanford
    (1163-68-303)
  • 3:30 p.m.
    A Survey of Ranking and Recommendation Systems.
    Paul Bruillard*, Expedia Group
    (1163-05-1269)
  • 4:00 p.m.
    A bipartite graph model for backbone discovery in discrete fracture networks.
    Aric Hagberg*, Los Alamos National Laboratory
    Jeffrey D Hyman, Los Alamos National Laboratory
    Dave Osthus, Los Alamos National Laboratory
    Shriram Srinivasan, Los Alamos National Laboratory
    Hari Viswanathan, Los Alamos National Laboratory
    Gowri Srinivasan, Los Alamos National Laboratory
    (1163-05-1373)
  • 4:30 p.m.
    An Unsupervised Framework for Comparing Graph Embeddings.
    Bogumil Kaminski, SGH Warsaw School of Economics
    Pawel Pralat*, Ryerson University
    Francois Theberge, The Tutte Institute for Mathematics and Computing
    (1163-05-756)
  • 5:00 p.m.
    Analyzing Critical Components of Power Grids During Cascading Failures Using Community Structures in Interaction Graphs.
    Upama Nakarmi*, University of South Florida
    (1163-05-909)
  • 5:30 p.m.
    Combinatorial Challenges arising from the Simplex Method.
    Jesus A. De Loera*, Dept. of Mathematics, University of California, Davis
    (1163-52-358)