Evan D. Nash

According to our database, Evan D. Nash authored at least 3 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Understanding high-order network structure using permissible walks on attributed hypergraphs.

Audun Myers, Enzo Battistella, Sean English, Robert Green, Cliff A. Joslyn, Evgeniya Lagoda, Van Magnan, Evan D. Nash, Michael Robinson

J. Complex Networks, 2025

2019

The maximum likelihood degree of toric varieties.

Carlos Améndola, Nathan Bliss, Isaac Burke, Courtney R. Gibbons, Martin Helmer, Serkan Hosten, Evan D. Nash, Jose Israel Rodriguez, Daniel Smolkin

J. Symb. Comput., 2019

2013

Extremal graphs without 4-cycles.

Frank A. Firke, Peter M. Kosek, Evan D. Nash, Jason Williford

J. Comb. Theory B, 2013