Create accountLogin

Recent searches

No recent searches

Search options

Only available when logged in.
eupolicy.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
This Mastodon server is a friendly and respectful discussion space for people working in areas related to EU policy. When you request to create an account, please tell us something about you.

Administered by:

Server stats:

227
active users

eupolicy.social: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.3.8

#graphtheory

0 posts0 participants0 posts today
Public
Fractal Kitty

A friend showed me a leetcode problem yesterday at the Recurse Center:

leetcode.com/problems/minimum-

Which led me to play for a bit on paper, then drafted a rough a visual toy:

codepen.io/fractalkitty/live/W

(I haven't actually done any leetcode problems because I often end up on paper and down rabbit holes)

A wide graph theory tree with 19 nodes with a tool area on the left that has buttons that say: show diameter, tree info, depth colors, central roots, adjacency matrix and then there is info on the current tree for 19 nodes, 18 edges, a height of 3, a diameter of 6 and physics as active. There are instructions of how to use the visual and at the top there is a toggle to turn on the physics and reset the layout. a codepen preview hover is accidentally shown as well. the color pallet and feel is notebooks with greens and off-whites with faint lines on the paper.
#recurseCenter#graphtheory#trees
Public
Warren

Ok, someone more familiar with graph theory tell me how to compute a minimum weight perfect matching on a complete graph with even-number of vertices? Or at least point me to a resource?

It's all either left as an exercise to the reader, extremely complex algorithms (Blossom or something?), or weird libraries, where apparently if I use it on complex graphs it's not necessary, but they then point me to even more complex papers.

Thought I had it solved but now it's returning a matching that's too small.

#graphtheory #computerscience #academia

Public *
Ross Kang

A post of @11011110 has reminded me that (after a year and a half lurking here) it's never too late for me to toot and pin an intro here.

I am a Canadian mathematician in the Netherlands, and I have been based at the University of Amsterdam since 2022. I also have some rich and longstanding ties to the UK, France, and Japan.

My interests are somewhere in the nexus of Combinatorics, Probability, and Algorithms. Specifically, I like graph colouring, random graphs, and probabilistic/extremal combinatorics. I have an appreciation for randomised algorithms, graph structure theory, and discrete geometry.

Around 2020, I began taking a more active role in the community, especially in efforts towards improved fairness and openness in science. I am proud to be part of a team that founded the journal, Innovations in Graph Theory (igt.centre-mersenne.org/), that launched in 2023. (That is probably the main reason I joined mathstodon!) I have also been a coordinator since 2020 of the informal research network, A Sparse (Graphs) Coalition (sparse-graphs.mimuw.edu.pl/), devoted to online collaborative workshops. In 2024, I helped spearhead the MathOA Diamond Open Access Stimulus Fund (mathoa.org/diamond-open-access).

Until now, my posts have mostly been about scientific publishing and combinatorics.

#introduction
#openscience
#diamondopenaccess
#scientificpublishing
#openaccess
#RemoteConferences
#combinatorics
#graphtheory
#ExtremalCombinatorics
#probability

igt.centre-mersenne.orgInnovations in Graph Theory Innovations in Graph Theory
Public *
分 Bifurkatus

They solved Ramsey for r(4,t)

projecteuclid.org/journals/ann

#Showerthought: The number of cliques ~= number of arenas/realities/systems in a population.

Project EuclidThe asymptotics of r(4,t)For integers $s,t \ge 2$, the Ramsey number $r(s,t)$ denotes the minimum $n$ such that every $n$-vertex graph contains a clique of order $s$ or an independent set of order $t$. In this paper we prove \[ r(4,t) = \Omega\Bigl(\frac{t^3}{\mathrm{log}^4 t}\Bigr)$ \quad\quad\quad \mathrm{as}\ t \rightarrow \infty, \] which determines $r(4,t)$ up to a factor of order $\mathrm{log}^2 t$, and solves a conjecture of Erdős.
#graphtheory#systemsengineering#sociology
Public
Vis Lab @ Khoury, Northeastern

Hey Mastodon! 👋 Here is our #introduction post: We are the Data Visualization Lab at Khoury College of Computer Sciences at Northeastern University. You can find more about our work here: vis.khoury.northeastern.edu/

We'd love to be connected to more folks and labs in the realms of #DataVisualization #HCI #xAI #AR #VR #VisualAnalytics #PhD #Research

Our lab has been applying visualization to domain areas like #accessibility #UAVs #Genetics #Privacy #Pedagogy #Networks #GraphTheory

Say hi!

vis.khoury.northeastern.eduKhoury Vis Lab, Northeastern UniversityFront page Khoury Vis Lab, Northeastern University
Public
Abde :verified:

Hello!

After a few days figuring out Mastodon with the help of the folks at QOTO, I will formally introduce myself in order to pin this in my profile :)

My name is Abde and I am a computer scientist. My main domain is #NumericalCalculus and #ParallelComputing. I am currently a PhD student at the Université Libre de Bruxelles (#belgium) and working on porting numerical solvers for simulations on the GPU using #CUDA. You may find my first paper here: etna.math.kent.edu/vol.55.2022

Other research interests are #complexity #computability #graphtheory #geometry #discretemath

I also work as a #VirtualReality developer. My current professional interests are #simulations #numericalcalculus #geometry. We also contribute in several #opensource projects. Most of my work is done in #Unity3D, so feel free to ask any questions!

As a hobby I do some #gamedev and also #musicproduction. I will share some snippets of what I do here, but for now I am focusing in crafting my art by producing #housemusic in #bitwig.

Please enjoy! I am not the most active but I am looking to build my Mastodon network, so feel free to follow and I will follow back :)

#introduction#mastodon#newcomer
Public
Tanguy Fardet

What kind of #network do we want for #Mastodon (and #Fediverse in general)?

The answer may vary depending on users and communities, but let's discuss where the new follow-recommendation tool of Mastodon 3.5 leads us (github.com/mastodon/mastodon/p).

The evolution of a network where new users preferentially follow existing influencers can be modeled as a Price/BA network.

en.wikipedia.org/wiki/Barab%C3

You end up with few large influencers.
Honestly, I'm not a fan...

GitHubAdd cold start follow recommendations by Gargron · Pull Request #15945 · mastodon/mastodonBy Gargron
#graphTheory
ExploreLive feeds
About