hessen.social ist einer von vielen unabhängigen Mastodon-Servern, mit dem du dich im Fediverse beteiligen kannst.
hessen.social ist die Mastodongemeinschaft für alle Hessen:innen und alle, die sich Hessen verbunden fühlen

Serverstatistik:

1,6 Tsd.
aktive Profile

#graphs

1 Beitrag1 Beteiligte*r0 Beiträge heute
NFDI4DS<p><a href="https://nfdi.social/tags/DIN" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DIN</span></a> <a href="https://nfdi.social/tags/Spec" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Spec</span></a> 91526 released on <a href="https://nfdi.social/tags/Knowledge" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Knowledge</span></a> <a href="https://nfdi.social/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a> for <a href="https://nfdi.social/tags/Language" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Language</span></a> models and vice versa: Hybrid applications of <a href="https://nfdi.social/tags/symbolic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>symbolic</span></a> and sub-symbolic <a href="https://nfdi.social/tags/AI" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AI</span></a></p><p>The <a href="https://nfdi.social/tags/standardization" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>standardization</span></a> focuses on the advantages of hybrid approaches that combine symbolic knowledge with modern language models. </p><p><span class="h-card"><a href="https://nfdi.social/@NFDI4DS" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>NFDI4DS</span></a></span> was involved in creating the specification together with other partners from academia and industry.</p><p>Read more: <a href="https://www.dinmedia.de/en/technical-rule/din-spec-91526/390496163" rel="nofollow noopener noreferrer" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">dinmedia.de/en/technical-rule/</span><span class="invisible">din-spec-91526/390496163</span></a></p><p><a href="https://nfdi.social/tags/LLM" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LLM</span></a> <a href="https://nfdi.social/tags/neurosymbolic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>neurosymbolic</span></a> <a href="https://nfdi.social/tags/KG" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>KG</span></a> <a href="https://nfdi.social/tags/DINSPEC" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DINSPEC</span></a></p>
Richie Khoo<p>Is there a way to graph trending hashtags on mastodon/the Fediverse?</p><p>What I'm interested in is to graph say my local city of <a href="https://hachyderm.io/tags/Adelaide" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Adelaide</span></a> and use that as a bit of an indicator of if <a href="https://hachyderm.io/tags/Mastodon" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Mastodon</span></a> usage and engagemement is growing locally in my town</p><p>And yes im interested in data across the fediverse or at least across a few selected servers, as I want data beyond just a single instance.</p><p>I can see this on my desktop web interface right now.. so Im guessing there *should* be a way.</p><p><a href="https://hachyderm.io/tags/GrowingMastodon" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GrowingMastodon</span></a> <a href="https://hachyderm.io/tags/DataVisualisation" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataVisualisation</span></a> <a href="https://hachyderm.io/tags/TrendingTopics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>TrendingTopics</span></a> <a href="https://hachyderm.io/tags/DataAnalytics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataAnalytics</span></a> <a href="https://hachyderm.io/tags/FediverseAnalytics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FediverseAnalytics</span></a> <a href="https://hachyderm.io/tags/GoogleTrends" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GoogleTrends</span></a> <a href="https://hachyderm.io/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a></p>
Jesus Castagnetto 🇵🇪<p>"A new way to make <a href="https://mastodon.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> more accessible to blind and low-vision readers"</p><p><a href="https://mastodon.social/tags/dataviz" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>dataviz</span></a> <a href="https://mastodon.social/tags/accessibility" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>accessibility</span></a> <a href="https://mastodon.social/tags/a11y" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>a11y</span></a></p><p><a href="https://news.mit.edu/2025/making-graphs-more-accessible-blind-low-vision-readers-0325" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.mit.edu/2025/making-graph</span><span class="invisible">s-more-accessible-blind-low-vision-readers-0325</span></a></p>
Jack Linke 🦄<p>Talk me out of building a <a href="https://social.jacklinke.com/tags/Neo4j" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Neo4j</span></a> implementation in parallel to my existing <a href="https://social.jacklinke.com/tags/PostgreSQL" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>PostgreSQL</span></a> DB (with a subset of tables as nodes) for queries that tend to be "graph-like" in nature.</p><p>In particular, I'm thinking of failure analysis, predictive maintenance, etc in relation to physical infrastructure I model as a directed acyclic graph.</p><p>Is this just my <a href="https://social.jacklinke.com/tags/ADHD" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ADHD</span></a> wanting to try something new, or could I actually find value in this side-quest? 😬</p><p><a href="https://social.jacklinke.com/tags/Modeling" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Modeling</span></a> <a href="https://social.jacklinke.com/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareEngineering</span></a> <a href="https://social.jacklinke.com/tags/Database" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Database</span></a> <a href="https://social.jacklinke.com/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a> <a href="https://social.jacklinke.com/tags/Django" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Django</span></a> <a href="https://social.jacklinke.com/tags/UhOh" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>UhOh</span></a></p>
ErrantScience<p>See if you can work out the number of mistakes in this graph and let us know. Anyone that gets it right will be awarded special internet points. <a href="https://mas.to/tags/DataVis" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DataVis</span></a> <a href="https://mas.to/tags/Data" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Data</span></a> <a href="https://mas.to/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a></p>
Marc Trius<p>Is there a term for a graph that changes shape as it is traversed? (You could say that an edge is or isn't enabled depending on which edge was used to enter the node)</p><p><a href="https://hachyderm.io/tags/ComputerScience" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ComputerScience</span></a> <a href="https://hachyderm.io/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://hachyderm.io/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://hachyderm.io/tags/GameDev" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GameDev</span></a></p>
Alexandre B A Villares<p><a href="https://pynews.com.br/tags/TravellingSalesmanProblem" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>TravellingSalesmanProblem</span></a> <a href="https://pynews.com.br/tags/MinimalSpanningTree" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>MinimalSpanningTree</span></a> <a href="https://pynews.com.br/tags/SciPy" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SciPy</span></a> <a href="https://pynews.com.br/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> Code at: <a href="https://github.com/villares/sketch-a-day/tree/main/2025/sketch_2025_02_11" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/villares/sketch-a-d</span><span class="invisible">ay/tree/main/2025/sketch_2025_02_11</span></a><br>More sketch-a-day: <a href="https://abav.lugaralgum.com/sketch-a-day" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">abav.lugaralgum.com/sketch-a-d</span><span class="invisible">ay</span></a><br>If you like this, support my work: <a href="https://www.paypal.com/donate/?hosted_button_id=5B4MZ78C9J724" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">paypal.com/donate/?hosted_butt</span><span class="invisible">on_id=5B4MZ78C9J724</span></a> <a href="https://pynews.com.br/tags/Processing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Processing</span></a> <a href="https://pynews.com.br/tags/Python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Python</span></a> <a href="https://pynews.com.br/tags/py5" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>py5</span></a> <a href="https://pynews.com.br/tags/CreativeCoding" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CreativeCoding</span></a></p>
Data Science<p>Friends Don't Let Friends Make Bad Graphs! Do you agree with the examples of bad graphs and the alternatives Chenxin Li (@chenxinli2.bsky.social) lists at <a href="https://github.com/cxli233/FriendsDontLetFriends" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/cxli233/FriendsDont</span><span class="invisible">LetFriends</span></a> <a href="https://genomic.social/tags/RStats" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>RStats</span></a> <a href="https://genomic.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://genomic.social/tags/dataviz" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>dataviz</span></a> <a href="https://genomic.social/tags/help" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>help</span></a></p>
Harald Klinke<p>Graphs are everywhere, but LLMs are trained on text. In „Talk like a Graph“ (ICLR 2024), Google introduces methods for encoding graphs for LLMs, launches the GraphQA benchmark, and demonstrates how task phrasing &amp; graph structure impact reasoning. Right methods boost performance by up to 60%! <a href="https://det.social/tags/ICLR2024" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ICLR2024</span></a> <a href="https://det.social/tags/AI" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AI</span></a> <a href="https://det.social/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a><br><a href="https://blog.research.google/2024/03/talk-like-graph-encoding-graphs-for.html" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">blog.research.google/2024/03/t</span><span class="invisible">alk-like-graph-encoding-graphs-for.html</span></a></p>
Felix 🇺🇦🚴‍♂️🇨🇦🇬🇱🇩🇰🇲🇽🇵🇦 🇪🇺<p>The <a href="https://norden.social/tags/Dusa" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Dusa</span></a> Programming Language<br>Dusa is a logic programming language designed by Rob Simmons and Chris Martens, the first implementation of finite-choice logic programming. <a href="https://norden.social/tags/datalog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>datalog</span></a> <a href="https://norden.social/tags/logicprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logicprogramming</span></a> <a href="https://norden.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://norden.social/tags/prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>prolog</span></a> <a href="https://norden.social/tags/programminglanguages" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programminglanguages</span></a> </p><p><a href="https://dusa.rocks/docs/introductions/graph/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dusa.rocks/docs/introductions/</span><span class="invisible">graph/</span></a></p>
Felix 🇺🇦🚴‍♂️🇨🇦🇬🇱🇩🇰🇲🇽🇵🇦 🇪🇺<p>Deepwalking in <a href="https://norden.social/tags/Clojure" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Clojure</span></a> <br><a href="https://www.mihirdeshpande.com/posts/deepwalk_clojure" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">mihirdeshpande.com/posts/deepw</span><span class="invisible">alk_clojure</span></a></p><p><a href="https://norden.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a></p>
Terence Eden<p>🆕 blog! “Graphing the connections between my blog posts”</p><p>I love ripping off good ideas from other people's blogs. I was reading Alvaro Graves-Fuenzalida's blog when I saw this nifty little force-directed graph:</p><p>When zoomed in, it shows the relation between posts and tags.</p><p>In this case, I can see that the posts about Small Gods and Pyramids…</p><p>👀 Read more: <a href="https://shkspr.mobi/blog/2025/01/graphing-the-connections-between-my-blog-posts/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">shkspr.mobi/blog/2025/01/graph</span><span class="invisible">ing-the-connections-between-my-blog-posts/</span></a><br>⸻<br><a href="https://mastodon.social/tags/blogging" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>blogging</span></a> <a href="https://mastodon.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://mastodon.social/tags/HTML" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HTML</span></a> <a href="https://mastodon.social/tags/php" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>php</span></a> <a href="https://mastodon.social/tags/WordPress" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>WordPress</span></a></p>
Dan Drake 🦆<p>Oh, this is neat: combine the construction of the natural numbers as sets, interpret sets as trees, and use a nice graph layout algorithm: numbers are leaves!</p><p><a href="https://www.christo.sh/numbers-are-leaves/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="">christo.sh/numbers-are-leaves/</span><span class="invisible"></span></a></p><p><a href="https://mathstodon.xyz/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mathstodon.xyz/tags/settheory" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>settheory</span></a> <a href="https://mathstodon.xyz/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a></p>
Jocelyn<p><span class="h-card" translate="no"><a href="https://fosstodon.org/@catselbow" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>catselbow</span></a></span> </p><p>We also have 2025 = 3⁴ 5².</p><p>That could be represented by a hierarchy of <a href="https://mastodon.gougere.fr/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a>:<br>- three bipartite graphs joining n nodes to n nodes (n=3, twice, and n=5) make n² edges,<br>- the bipartite <a href="https://mastodon.gougere.fr/tags/graph" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graph</span></a> that has for nodes the edges of the n=3 graph has 3⁴ edges,<br>- taking those edges as one set of nodes, and those of the n=5 graph as another set, the bipartite graph formed with them has 2025 edges.</p><p>Who is ready to find a nice way to arrange this in the plane, and then code it?</p><p><a href="https://mastodon.gougere.fr/tags/network" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>network</span></a></p>
Tao of Mac<p>Visualization</p><p>This is a spottily-updated list of miscellaneous resources I’ve come across dealing with data visualization in several forms.(...)</p><p><a href="https://mastodon.social/tags/charting" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>charting</span></a> <a href="https://mastodon.social/tags/charts" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>charts</span></a> <a href="https://mastodon.social/tags/data" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>data</span></a> <a href="https://mastodon.social/tags/graphics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphics</span></a> <a href="https://mastodon.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://mastodon.social/tags/mathematics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mathematics</span></a> <a href="https://mastodon.social/tags/plots" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>plots</span></a> <a href="https://mastodon.social/tags/plotting" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>plotting</span></a> <a href="https://mastodon.social/tags/statistics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>statistics</span></a></p><p><a href="https://taoofmac.com/space/infoviz" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">taoofmac.com/space/infoviz</span><span class="invisible"></span></a></p>
John<p>Part 2 ended up falling out of Part 1 so they're mushed together. Part 1 was essentially, "given this graph (the overall dependency set) and this subset of nodes we care about (the pages in the current order), is the current order topologically sorted? </p><p>Part 2 is then, ok, since they're not, sort them.</p><p>There was nothing particularly tricky if you already know how directed acyclic graphs work. If you didn’t, hopefully now you do? :-)</p><p>The "we only care about pages in the current order, not the entire dependency graph” part added a bit of complication, but between Python dict comprehensions and set operations it was pretty easy to create an order-specific graph, which we could use non-destructively to answer Part 1 by keeping a `seen` set and checking the disunion of the current page's deps and the seen set each time, and then if it wasn't in order we could use it destructively in Part 2.</p><p><a href="https://sfba.social/tags/AdventOfCode" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AdventOfCode</span></a> <a href="https://sfba.social/tags/AdventOfCode2024" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AdventOfCode2024</span></a> <a href="https://sfba.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://sfba.social/tags/algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithms</span></a> <a href="https://sfba.social/tags/topologicalsort" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>topologicalsort</span></a> <a href="https://sfba.social/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a></p>
PyKEEN<p>PyKEEN is developer-friendly software for knowledge graph embedding models.</p><p>We just released version v1.11 with some nice improvements in the last ten months</p><p>Check it out here <a href="https://github.com/pykeen/pykeen/releases/tag/v1.11.0" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/pykeen/pykeen/relea</span><span class="invisible">ses/tag/v1.11.0</span></a></p><p>Install from PyPI with `pip install --upgrade pykeen`</p><p><a href="https://fosstodon.org/tags/graphmachinelearning" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphmachinelearning</span></a> <a href="https://fosstodon.org/tags/gml" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>gml</span></a> <a href="https://fosstodon.org/tags/ai" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ai</span></a> <a href="https://fosstodon.org/tags/ml" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ml</span></a> <a href="https://fosstodon.org/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://fosstodon.org/tags/knowledgegraphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>knowledgegraphs</span></a></p>
Data Science<p>Friends Don't Let Friends Make Bad Graphs! Do you agree with the examples of bad graphs and the alternatives Chenxin Li (@chenxinli2.bsky.social) lists at <a href="https://github.com/cxli233/FriendsDontLetFriends" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/cxli233/FriendsDont</span><span class="invisible">LetFriends</span></a> <a href="https://genomic.social/tags/RStats" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>RStats</span></a> <a href="https://genomic.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a> <a href="https://genomic.social/tags/dataviz" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>dataviz</span></a> <a href="https://genomic.social/tags/help" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>help</span></a></p>
Bobsee<p><span class="h-card" translate="no"><a href="https://mastodon.social/@flexghost" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>flexghost</span></a></span> <a href="https://hachyderm.io/tags/Graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Graphs</span></a> should have the y-axis start at zero. Otherwise</p>
James Ashford<p>Just published my latest post on the 2024 conservative leadership election. Feel free to check it out. It features a fancy bipartite graph</p><p><a href="https://brewingdata.com/2024-conservative-leadership-election-endorsements-september-update/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">brewingdata.com/2024-conservat</span><span class="invisible">ive-leadership-election-endorsements-september-update/</span></a></p><p><a href="https://moth.social/tags/ukpol" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ukpol</span></a> <a href="https://moth.social/tags/dataviz" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>dataviz</span></a> <a href="https://moth.social/tags/graphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>graphs</span></a></p>