User Tools

Site Tools


resources

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
resources [2026/06/01 22:45] asjensenresources [2026/06/02 20:45] (current) – [Group Publications] asjensen
Line 26: Line 26:
 A running list of publications that resulted from the work of NODE group.  A running list of publications that resulted from the work of NODE group. 
  
-'' **Models of Random Spanning Trees**, Eric Babson, Moon Duchin, Annina Iseli, Dylan Thurston, Jamie Tucker-Foltz and Pietro Poggi-Corradini. Random Structures and Algorithms (2025). [[https://doi.org/10.1002/rsa.70063|DOI]] [[https://arxiv.org/pdf/2407.20226|Arxiv]]''+'' **Models of Random Spanning Trees**, Eric Babson, Moon Duchin, Annina Iseli, Dylan Thurston, Jamie Tucker-Foltz and Pietro Poggi-Corradini. Random Structures and Algorithms (2026). [[https://doi.org/10.1002/rsa.70063|DOI]] [[https://arxiv.org/pdf/2407.20226|Arxiv]]''
  
 '' **Convergence of the Probabilistic Interpretation of Modulus**, Nathan Albin, Joan Lind and Pietro Poggi-Corradini. Illinois Journal of Mathematics, Volume 69, Number 1 (2025), 123-188. [[ https://doi.org/10.1215/00192082-11831079|DOI]] [[https://arxiv.org/pdf/2106.11418|Arxiv]]'' '' **Convergence of the Probabilistic Interpretation of Modulus**, Nathan Albin, Joan Lind and Pietro Poggi-Corradini. Illinois Journal of Mathematics, Volume 69, Number 1 (2025), 123-188. [[ https://doi.org/10.1215/00192082-11831079|DOI]] [[https://arxiv.org/pdf/2106.11418|Arxiv]]''
Line 32: Line 32:
 '' **An Exact-Arithmetic Algorithm for Spanning Tree Modulus**, Nathan Albin, Kapila Kottegoda and Pietro Poggi-Corradini. Networks, Volume 85, Number 4 (2025), 412-424. [[ https://doi.org/10.1002/net.22270|DOI]] [[https://arxiv.org/pdf/2009.03736|Arxiv]]'' '' **An Exact-Arithmetic Algorithm for Spanning Tree Modulus**, Nathan Albin, Kapila Kottegoda and Pietro Poggi-Corradini. Networks, Volume 85, Number 4 (2025), 412-424. [[ https://doi.org/10.1002/net.22270|DOI]] [[https://arxiv.org/pdf/2009.03736|Arxiv]]''
  
-'' **Modulus for Bases of Matroids**, Huy Truong and Pietro Poggi-Corradini. Proc. Discrete Mathematics, Volume 348, Issue 5 (2025). [[https://doi.org/10.48550/arXiv.2404.05650|DOI]] [[https://arxiv.org/abs/2404.05650v1|Arxiv]]''+'' **Modulus for Bases of Matroids**, Huy Truong and Pietro Poggi-Corradini. Discrete Mathematics, Volume 348, Issue 5 (2025). [[https://doi.org/10.48550/arXiv.2404.05650|DOI]] [[https://arxiv.org/abs/2404.05650v1|Arxiv]]''
  
-'' **On the Sharp Lower Bound for Duality of Modulus.**, Sylvester Eriksson-Bique and Pietro Poggi-Corradini. Proc. Amer. Math. Soc. 150 (2022), 2955-2968. [[https://doi.org/10.1090/proc/15951|DOI]] [[https://arxiv.org/pdf/2102.03035.pdf|Arxiv]]''+'' **Minimizing the Determinant of the Graph Laplacian**, Nathan Albin, Joan Lind, Anna Melikyan and Pietro Poggi-Corradini. Journal of Graph Theory, Volume 110, Issue 3 (2025). [[ https://doi.org/10.1002/jgt.23275|DOI]] [[https://arxiv.org/pdf/2404.06363|Arxiv]]'' 
 + 
 +'' **Density of Continuous Functions in Sobolev Spaces with Applications to Capacity**, Sylvester Eriksson-Bique and Pietro Poggi-Corradini. Trans. Amer. Math. Soc. Ser. B 11 (2024), 901-944. [[https://doi.org/10.1090/btran/188|DOI]] [[https://arxiv.org/pdf/2303.00649|Arxiv]]'' 
 + 
 +'' **Modulus of Edge Covers and Stars**, Adriana Ortiz-Aquino and Nathan Albin. Operations Research Forum, Volume 7, Number 20 (2026). [[https://doi.org/10.1007/s43069-026-00606-5|DOI]] [[https://arxiv.org/pdf/2303.00649|Arxiv]]'' 
 + 
 +'' **On the Sharp Lower Bound for Duality of Modulus.**, Sylvester Eriksson-Bique and Pietro Poggi-Corradini. Proc. Amer. Math. Soc. 150 (2022), 2955-2968. [[https://doi.org/10.1090/proc/15951|DOI]] [[https://arxiv.org/pdf/2309.13180v2|Arxiv]]''
  
 '' **Fairest edge usage and minimum expected overlap for random trees.**, Nathan Albin, Jason Clemens, Derek Hoare, Pietro Poggi-Corradini, Brandon Sit, and Sarah Tymochko. Discrete Mathematics. Volume 344, Issue 5 (2021), 112282. [[https://doi.org/10.1016/j.disc.2020.112282|DOI]] [[https://arxiv.org/abs/1805.10112|Arxiv]]'' '' **Fairest edge usage and minimum expected overlap for random trees.**, Nathan Albin, Jason Clemens, Derek Hoare, Pietro Poggi-Corradini, Brandon Sit, and Sarah Tymochko. Discrete Mathematics. Volume 344, Issue 5 (2021), 112282. [[https://doi.org/10.1016/j.disc.2020.112282|DOI]] [[https://arxiv.org/abs/1805.10112|Arxiv]]''
resources.1780353951.txt.gz · Last modified: by asjensen

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki