Nate Veldt

Assistant Professor in the Department of Computer Science and Engineering at Texas A&M University

[NBC Olympics & Paralympics @NBCOlympics]

WOW. 😱

A STUNNING upset in the men’s 1500m as AMERICAN COLE HOCKER takes gold! #ParisOlympics

[Nate Veldt @n_veldt]

Thanks, David!

[David Gleich @dgleich]

Always nice to see networks in @TheSIAMNews ! Great work @n_veldt

[Purdue Computer Science @PurdueCS]

Congratulations to Professors Zikas, @msbaz2013, Aliaga, Benes, and @dgleich for being awarded #Purdue University’s prestigious Seed for Success Acorn Awards.
➡️ https://t.co/6DNa6ckqTd

#ComputerScience #DataScience #AI #PurdueCS #TheNextGiantLeap #PurdueComputes

[SIAM @TheSIAMNews]

The November issue of SIAM News is now available! In this month's edition, @n_veldt finds that even a seemingly minor generalization of the standard #hypergraph cut penalty yields a rich space of theoretical questions and #complexity results. Check it out! https://t.co/Tv00MWd0B3

[Vedangi V. Bengali @vedangibengali]

Excited to share that our paper "Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling" with @n_veldt has been accepted as a full paper at #CIKM2023.

[ARG-tech @ARG_tech]

Today @raybbecker led us through the paper by @austinbenson, @n_veldt, and @dgleich titled "Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails" https://t.co/3ZersIfRWY

[SIAM ACDA @siam_acda]

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23)
May 31 – June 2, 2023
Seattle, Washington, U.S.

New submission due dates:
Registering a submission: Jan 16;
Paper submission deadline; Jan 23.

[SIAM ACDA @siam_acda]

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), May 31 -- June 2, 2023

https://t.co/a89KZh1IKn

Important dates: Short Abstract and Submission Registration: Jan 9, 2023
Papers and Presentations-without-papers: Jan 16, 2023

#SIAMACDA23

[Aydın Buluç @aydoz]

Last week, Michael Bender, Bora Ucar (@UCARBora1), I organized a community-building workshop for the SIAM Activity Group on Applied and Computational Discrete Algorithms (ACDA, @siam_acda) at Aussois, France.

[Nate Veldt @n_veldt]

More details, and link to paper submissions are available on our (still evolving) webpage. https://t.co/Kg7q3dB0Rb

[Nate Veldt @n_veldt]

Do you do research on hypergraphs, simplicial complexes, higher-order graphs, higher-order machine learning, or [insert favorite “higher order” complex systems term here]? Submit to our ICDM Workshop on Machine Learning on Higher-order Structured Data! https://t.co/inYdyoZD6w

[Nate Veldt @n_veldt]

Paper submission: Sept 2, notification: Sept 23. Workshop: Sometime in Nov 30-Dec 4. Paper submissions follow the standard ICDM 2022 guidelines. Accepted papers will be published in the ICDM Workshop proceedings.

[Lev Reyzin @lreyzin]

If I organized APPROX/RANDOM, I'd be tempted to put out one regular and one decaf coffee container, but not label which is which. I'd want to know if the APPROX authors would always fill their cups halfway from each container and if the RANDOM authors would flip a coin to decide.

[Shuiwang Ji @ShuiwangJi]

The Department of Computer Science and Engineering at Texas A&M University invites applications for multiple full-time tenured or tenure-track positions. Open rank, open area.
https://t.co/MP5hUM3En8

[David Gleich @dgleich]

Need data (networks, hypergraphs, tensors, ML, AI)? Here’s a timestamped and linked digest of Anthony Fauci’s emails https://t.co/4Ude2KaDv4 from @JasonLeopold FOIA request. With @austinbenson and @n_veldt Data and Code https://t.co/0NBMmmOwzD

[Blair D. Sullivan @BlairDSullivan]

So who's going to be at #SIAMACDA21 next week? Hoping to see some familiar faces!
@austinbenson @RichVuduc @dgleich @eapurvine @Prof_DavidBader @aydoz @DocSparse @rpeng233 ?
PS. Check your email for instructions on participating in the Introduction Blitz on Monday!

[Nate Veldt @n_veldt]

@jientho The key point is that there are seemingly natural ways to generalize mathematical notions of homophily from graphs to hypergraphs, that end up being combinatorially impossible. Full details about these notions are of course in the paper. See especially commentary after Thm 1!

[Nate Veldt @n_veldt]

(1/n) New preprint with @austinbenson and Jon Kleinberg! "Higher-order Homophily is Combinatorially Impossible" (https://t.co/5oFRQuGPgT)

[Nate Veldt @n_veldt]

@jientho Refined short explanation: men and women can't both exhibit preferences for *all* types of groups where their gender is the majority. If groups contain only men or only women, then, e.g., men do not have a higher than random preference for groups with 5 men and 2 women.

[Nate Veldt @n_veldt]

@jientho Yes, you are right about your example. This is what we refer to in the paper as simple homophily, and it indeed can exist. These statements are fleshed out more in technical depth in the paper.

[Shubhendu Trivedi @_onionesque]

Just finished working through this very nice tutorial on learning over hypergraphs and simplicial complexes. https://t.co/lGlxXJd7BP An excellent resource for (re)gaining familiarity with the basics of the area if one is new (or grew skeptical at some point). h/t: @n_veldt