#graph-theory — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #graph-theory, aggregated by home.social.
-
Learn why the Floyd-Warshall algorithm does not assume paths of three edges and how dynamic programming finds shortest paths of any length. https://hackernoon.com/floyd-warshall-algorithm-handling-paths-longer-than-three-edges-without-fixed-maximum-length-assump #graphtheory
-
Learn why the Floyd-Warshall algorithm does not assume paths of three edges and how dynamic programming finds shortest paths of any length. https://hackernoon.com/floyd-warshall-algorithm-handling-paths-longer-than-three-edges-without-fixed-maximum-length-assump #graphtheory
-
Learn why the Floyd-Warshall algorithm does not assume paths of three edges and how dynamic programming finds shortest paths of any length. https://hackernoon.com/floyd-warshall-algorithm-handling-paths-longer-than-three-edges-without-fixed-maximum-length-assump #graphtheory
-
Learn why the Floyd-Warshall algorithm does not assume paths of three edges and how dynamic programming finds shortest paths of any length. https://hackernoon.com/floyd-warshall-algorithm-handling-paths-longer-than-three-edges-without-fixed-maximum-length-assump #graphtheory
-
Learn why the Floyd-Warshall algorithm does not assume paths of three edges and how dynamic programming finds shortest paths of any length. https://hackernoon.com/floyd-warshall-algorithm-handling-paths-longer-than-three-edges-without-fixed-maximum-length-assump #graphtheory
-
The #paperOfTheDay is "The Ehrhart polynomial of a matroid specializes to the beta invariant" from 2025.
A #matroid is an abstract generalization of a set of vectors in a vector space: Consider some set of k vectors in R^n (allowing k>n). Some of these k vectors could be linearly independent, but assume that not all of them are. If some subset is linearly independent, then so is every subset of that subset. This and a few other properties jointly give the definition of a matroid: Basically, consider the same logical relations arising from linear independence, but without demanding that the objects under consideration are actually vectors in R^n.
If one declares the elements of a matroid to be unit vectors in some abstract vector space (these basis vectors are all linearly independent in that abstract space, whereass not all elements are independent in the matroid), then the maximum set of independent vectors in the matroid amounts to some subset of these abstract vectors, whose convex hull is a polytope. This polytope contains a finite number of points of Z^n. If one rescales the polytope by an integer t, the number of lattice points changes. It turns out that the number of lattice points included is a polynomial of t (not a more complicated function), this defines the Ehrhart polynomial.
Every graph gives rise to a matroid (but not every matroid can be represented as a graph). For graphs, the Tutte polynomial is a classical quantity. The linear term of the Tutte polynomial is the Crapo-beta invariant (and can also be defined for non-graphical matroids). The present paper proves that a linear term of the Ehrhart polynomial coincides with beta. https://arxiv.org/abs/2504.15518 #mathematics #graphTheory -
The #paperOfTheDay is "The Ehrhart polynomial of a matroid specializes to the beta invariant" from 2025.
A #matroid is an abstract generalization of a set of vectors in a vector space: Consider some set of k vectors in R^n (allowing k>n). Some of these k vectors could be linearly independent, but assume that not all of them are. If some subset is linearly independent, then so is every subset of that subset. This and a few other properties jointly give the definition of a matroid: Basically, consider the same logical relations arising from linear independence, but without demanding that the objects under consideration are actually vectors in R^n.
If one declares the elements of a matroid to be unit vectors in some abstract vector space (these basis vectors are all linearly independent in that abstract space, whereass not all elements are independent in the matroid), then the maximum set of independent vectors in the matroid amounts to some subset of these abstract vectors, whose convex hull is a polytope. This polytope contains a finite number of points of Z^n. If one rescales the polytope by an integer t, the number of lattice points changes. It turns out that the number of lattice points included is a polynomial of t (not a more complicated function), this defines the Ehrhart polynomial.
Every graph gives rise to a matroid (but not every matroid can be represented as a graph). For graphs, the Tutte polynomial is a classical quantity. The linear term of the Tutte polynomial is the Crapo-beta invariant (and can also be defined for non-graphical matroids). The present paper proves that a linear term of the Ehrhart polynomial coincides with beta. https://arxiv.org/abs/2504.15518 #mathematics #graphTheory -
The #paperOfTheDay is "The Ehrhart polynomial of a matroid specializes to the beta invariant" from 2025.
A #matroid is an abstract generalization of a set of vectors in a vector space: Consider some set of k vectors in R^n (allowing k>n). Some of these k vectors could be linearly independent, but assume that not all of them are. If some subset is linearly independent, then so is every subset of that subset. This and a few other properties jointly give the definition of a matroid: Basically, consider the same logical relations arising from linear independence, but without demanding that the objects under consideration are actually vectors in R^n.
If one declares the elements of a matroid to be unit vectors in some abstract vector space (these basis vectors are all linearly independent in that abstract space, whereass not all elements are independent in the matroid), then the maximum set of independent vectors in the matroid amounts to some subset of these abstract vectors, whose convex hull is a polytope. This polytope contains a finite number of points of Z^n. If one rescales the polytope by an integer t, the number of lattice points changes. It turns out that the number of lattice points included is a polynomial of t (not a more complicated function), this defines the Ehrhart polynomial.
Every graph gives rise to a matroid (but not every matroid can be represented as a graph). For graphs, the Tutte polynomial is a classical quantity. The linear term of the Tutte polynomial is the Crapo-beta invariant (and can also be defined for non-graphical matroids). The present paper proves that a linear term of the Ehrhart polynomial coincides with beta. https://arxiv.org/abs/2504.15518 #mathematics #graphTheory -
The #paperOfTheDay is "The Ehrhart polynomial of a matroid specializes to the beta invariant" from 2025.
A #matroid is an abstract generalization of a set of vectors in a vector space: Consider some set of k vectors in R^n (allowing k>n). Some of these k vectors could be linearly independent, but assume that not all of them are. If some subset is linearly independent, then so is every subset of that subset. This and a few other properties jointly give the definition of a matroid: Basically, consider the same logical relations arising from linear independence, but without demanding that the objects under consideration are actually vectors in R^n.
If one declares the elements of a matroid to be unit vectors in some abstract vector space (these basis vectors are all linearly independent in that abstract space, whereass not all elements are independent in the matroid), then the maximum set of independent vectors in the matroid amounts to some subset of these abstract vectors, whose convex hull is a polytope. This polytope contains a finite number of points of Z^n. If one rescales the polytope by an integer t, the number of lattice points changes. It turns out that the number of lattice points included is a polynomial of t (not a more complicated function), this defines the Ehrhart polynomial.
Every graph gives rise to a matroid (but not every matroid can be represented as a graph). For graphs, the Tutte polynomial is a classical quantity. The linear term of the Tutte polynomial is the Crapo-beta invariant (and can also be defined for non-graphical matroids). The present paper proves that a linear term of the Ehrhart polynomial coincides with beta. https://arxiv.org/abs/2504.15518 #mathematics #graphTheory -
The #paperOfTheDay is "The Ehrhart polynomial of a matroid specializes to the beta invariant" from 2025.
A #matroid is an abstract generalization of a set of vectors in a vector space: Consider some set of k vectors in R^n (allowing k>n). Some of these k vectors could be linearly independent, but assume that not all of them are. If some subset is linearly independent, then so is every subset of that subset. This and a few other properties jointly give the definition of a matroid: Basically, consider the same logical relations arising from linear independence, but without demanding that the objects under consideration are actually vectors in R^n.
If one declares the elements of a matroid to be unit vectors in some abstract vector space (these basis vectors are all linearly independent in that abstract space, whereass not all elements are independent in the matroid), then the maximum set of independent vectors in the matroid amounts to some subset of these abstract vectors, whose convex hull is a polytope. This polytope contains a finite number of points of Z^n. If one rescales the polytope by an integer t, the number of lattice points changes. It turns out that the number of lattice points included is a polynomial of t (not a more complicated function), this defines the Ehrhart polynomial.
Every graph gives rise to a matroid (but not every matroid can be represented as a graph). For graphs, the Tutte polynomial is a classical quantity. The linear term of the Tutte polynomial is the Crapo-beta invariant (and can also be defined for non-graphical matroids). The present paper proves that a linear term of the Ehrhart polynomial coincides with beta. https://arxiv.org/abs/2504.15518 #mathematics #graphTheory -
#Higraph progress! The text names of items now open in an in-picture editor as you create the item, and for nodes and blobs, can be moved! This is the last major thing before MVP!
-
#Higraph progress! The text names of items now open in an in-picture editor as you create the item, and for nodes and blobs, can be moved! This is the last major thing before MVP!
-
#Higraph progress! The text names of items now open in an in-picture editor as you create the item, and for nodes and blobs, can be moved! This is the last major thing before MVP!
-
#Higraph progress! The text names of items now open in an in-picture editor as you create the item, and for nodes and blobs, can be moved! This is the last major thing before MVP!
-
#Higraph progress! The text names of items now open in an in-picture editor as you create the item, and for nodes and blobs, can be moved! This is the last major thing before MVP!
-
🧙♂️💡 Oh, joy—another attempt to make math "fun" with a Dungeons & Dragons twist! Because nothing says "rigorous proof" like rolling a 20-sided die while pretending your graph theory is a goblin. 🎲📜
https://dhilst.github.io/algae/game/index.html #mathfun #DungeonsAndDragons #gamification #graphtheory #storytelling #HackerNews #ngated -
🧙♂️💡 Oh, joy—another attempt to make math "fun" with a Dungeons & Dragons twist! Because nothing says "rigorous proof" like rolling a 20-sided die while pretending your graph theory is a goblin. 🎲📜
https://dhilst.github.io/algae/game/index.html #mathfun #DungeonsAndDragons #gamification #graphtheory #storytelling #HackerNews #ngated -
🧙♂️💡 Oh, joy—another attempt to make math "fun" with a Dungeons & Dragons twist! Because nothing says "rigorous proof" like rolling a 20-sided die while pretending your graph theory is a goblin. 🎲📜
https://dhilst.github.io/algae/game/index.html #mathfun #DungeonsAndDragons #gamification #graphtheory #storytelling #HackerNews #ngated -
🧙♂️💡 Oh, joy—another attempt to make math "fun" with a Dungeons & Dragons twist! Because nothing says "rigorous proof" like rolling a 20-sided die while pretending your graph theory is a goblin. 🎲📜
https://dhilst.github.io/algae/game/index.html #mathfun #DungeonsAndDragons #gamification #graphtheory #storytelling #HackerNews #ngated -
🧙♂️💡 Oh, joy—another attempt to make math "fun" with a Dungeons & Dragons twist! Because nothing says "rigorous proof" like rolling a 20-sided die while pretending your graph theory is a goblin. 🎲📜
https://dhilst.github.io/algae/game/index.html #mathfun #DungeonsAndDragons #gamification #graphtheory #storytelling #HackerNews #ngated -
Decades ago Paul Erdős used randomness to illuminate the weird world of networks — now mathematicians have gone further. #mathematics #graphtheory #randomness
Posted into FLIPBOARD EXCHANGE FEED 🗞️ @flipboard-exchange-feed-Econopass
-
Decades ago Paul Erdős used randomness to illuminate the weird world of networks — now mathematicians have gone further. #mathematics #graphtheory #randomness
Posted into FLIPBOARD EXCHANGE FEED 🗞️ @flipboard-exchange-feed-Econopass
-
Decades ago Paul Erdős used randomness to illuminate the weird world of networks — now mathematicians have gone further. #mathematics #graphtheory #randomness
Posted into FLIPBOARD EXCHANGE FEED 🗞️ @flipboard-exchange-feed-Econopass
-
Alright, future engineers!
**Graph:** A collection of vertices (nodes) connected by edges (links).
Ex: A social network (people=vertices, friendships=edges).
Pro-Tip: Visualize connections & relationships! Essential for network analysis & system design.
#GraphTheory #DiscreteMath #STEM #StudyNotes -
One more small feature, and some housekeeping, and I will have a "minimum viable product" of a higraph editor!
(This picture was directly copied and pasted from the tool - not a screenshot 🤓)
-
One more small feature, and some housekeeping, and I will have a "minimum viable product" of a higraph editor!
(This picture was directly copied and pasted from the tool - not a screenshot 🤓)
-
One more small feature, and some housekeeping, and I will have a "minimum viable product" of a higraph editor!
(This picture was directly copied and pasted from the tool - not a screenshot 🤓)
-
One more small feature, and some housekeeping, and I will have a "minimum viable product" of a higraph editor!
(This picture was directly copied and pasted from the tool - not a screenshot 🤓)
-
One more small feature, and some housekeeping, and I will have a "minimum viable product" of a higraph editor!
(This picture was directly copied and pasted from the tool - not a screenshot 🤓)
-
Alright, future engineers!
**Degree (of a vertex):** The number of edges connected to that vertex in a graph.
Ex: In a social network, your degree is the count of your direct friends.
Pro-Tip: The sum of all degrees in a graph is always twice the number of edges!
#GraphTheory #Networks #STEM #StudyNotes -
In the last post I introduced the "dual complement" idea for polyhedral graphs. I'm not sure if it has any mathematical significance, but I've made a fun discovery: the dual complement of a spanning tree is another spanning tree.
This result is rather intuitive and I don't have a rigorous proof for it yet, but here are the main supporting ideas. First, a spanning tree over v1 vertices has v1 - 1 edges. We can then show, using basic duality relations and Euler's polyhedral formula, that the dual complement has v2 - 1 edges that connect all of its v2 vertices. The complement doesn't have any cycles, since those would "capture" parts of the original graph, which we know is a single component.
The original polyhedron here is a {3,5+}_2,1 geodesic, so the dual is a Goldberg polyhedron.
No AI, no apps, just my original Python + OpenGL code.
#graphtheory #dualpolyhedron #dualcomplement #spanningtree #geodesicpolyhedron #goldbergpolyhedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Back in the day, I made a couple of demos where a Hamiltonian path is carved out on a polyhedron. Looking back, I started to wonder about the shape left around the path, and what it means in terms of graph theory. I call this shape the "dual complement" of the path.
The dual of a polyhedron is essentially the result of turning faces into vertices and vice versa. This is shown in the first clip with a snub dodecahedron and its dual, the pentagonal hexecontahedron; to keep the view cleaner, I'm only showing the edges of one at a time.
The duality transformation also affects the edges, but their number remains the same, and there's a 1:1 mapping between the original and dual edges. Each dual edge "cuts through" the original. To make the dual complement of a path, I remove the dual counterpart of each edge in the path, leaving only the stuff on the sides. It's like driving a snow plough along the path, leaving walls of snow on the sides.
For the final view, I combine original Hamiltonian paths with their dual complements.
#graphtheory #hamiltonianpath #hamiltoniancycle #dualpolyhedron #dualcomplement #snubdodecahedron #pentagonalhexecontahedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Back in the day, I made a couple of demos where a Hamiltonian path is carved out on a polyhedron. Looking back, I started to wonder about the shape left around the path, and what it means in terms of graph theory. I call this shape the "dual complement" of the path.
The dual of a polyhedron is essentially the result of turning faces into vertices and vice versa. This is shown in the first clip with a snub dodecahedron and its dual, the pentagonal hexecontahedron; to keep the view cleaner, I'm only showing the edges of one at a time.
The duality transformation also affects the edges, but their number remains the same, and there's a 1:1 mapping between the original and dual edges. Each dual edge "cuts through" the original. To make the dual complement of a path, I remove the dual counterpart of each edge in the path, leaving only the stuff on the sides. It's like driving a snow plough along the path, leaving walls of snow on the sides.
For the final view, I combine original Hamiltonian paths with their dual complements.
#graphtheory #hamiltonianpath #hamiltoniancycle #dualpolyhedron #dualcomplement #snubdodecahedron #pentagonalhexecontahedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Back in the day, I made a couple of demos where a Hamiltonian path is carved out on a polyhedron. Looking back, I started to wonder about the shape left around the path, and what it means in terms of graph theory. I call this shape the "dual complement" of the path.
The dual of a polyhedron is essentially the result of turning faces into vertices and vice versa. This is shown in the first clip with a snub dodecahedron and its dual, the pentagonal hexecontahedron; to keep the view cleaner, I'm only showing the edges of one at a time.
The duality transformation also affects the edges, but their number remains the same, and there's a 1:1 mapping between the original and dual edges. Each dual edge "cuts through" the original. To make the dual complement of a path, I remove the dual counterpart of each edge in the path, leaving only the stuff on the sides. It's like driving a snow plough along the path, leaving walls of snow on the sides.
For the final view, I combine original Hamiltonian paths with their dual complements.
#graphtheory #hamiltonianpath #hamiltoniancycle #dualpolyhedron #dualcomplement #snubdodecahedron #pentagonalhexecontahedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Back in the day, I made a couple of demos where a Hamiltonian path is carved out on a polyhedron. Looking back, I started to wonder about the shape left around the path, and what it means in terms of graph theory. I call this shape the "dual complement" of the path.
The dual of a polyhedron is essentially the result of turning faces into vertices and vice versa. This is shown in the first clip with a snub dodecahedron and its dual, the pentagonal hexecontahedron; to keep the view cleaner, I'm only showing the edges of one at a time.
The duality transformation also affects the edges, but their number remains the same, and there's a 1:1 mapping between the original and dual edges. Each dual edge "cuts through" the original. To make the dual complement of a path, I remove the dual counterpart of each edge in the path, leaving only the stuff on the sides. It's like driving a snow plough along the path, leaving walls of snow on the sides.
For the final view, I combine original Hamiltonian paths with their dual complements.
#graphtheory #hamiltonianpath #hamiltoniancycle #dualpolyhedron #dualcomplement #snubdodecahedron #pentagonalhexecontahedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Back in the day, I made a couple of demos where a Hamiltonian path is carved out on a polyhedron. Looking back, I started to wonder about the shape left around the path, and what it means in terms of graph theory. I call this shape the "dual complement" of the path.
The dual of a polyhedron is essentially the result of turning faces into vertices and vice versa. This is shown in the first clip with a snub dodecahedron and its dual, the pentagonal hexecontahedron; to keep the view cleaner, I'm only showing the edges of one at a time.
The duality transformation also affects the edges, but their number remains the same, and there's a 1:1 mapping between the original and dual edges. Each dual edge "cuts through" the original. To make the dual complement of a path, I remove the dual counterpart of each edge in the path, leaving only the stuff on the sides. It's like driving a snow plough along the path, leaving walls of snow on the sides.
For the final view, I combine original Hamiltonian paths with their dual complements.
#graphtheory #hamiltonianpath #hamiltoniancycle #dualpolyhedron #dualcomplement #snubdodecahedron #pentagonalhexecontahedron #3dgraphics #digitalsculpture #pythoncode #numpy #opengl #creativecodeart #algorithmicart #algorist #mathart #laskutaide #computerart #ittaide #kuavataide #iterati
-
Alright, future engineers!
**Graph:** A set of vertices (nodes) connected by edges (lines).
Ex: `V={1,2,3}, E={(1,2),(2,3)}`.
Pro-Tip: Great for modeling networks (social, electrical) or any connections!
#GraphTheory #DiscreteMath #STEM #StudyNotes -
Alright, future engineers!
**Graph:** A set of vertices (nodes) connected by edges (lines).
Ex: `V={1,2,3}, E={(1,2),(2,3)}`.
Pro-Tip: Great for modeling networks (social, electrical) or any connections!
#GraphTheory #DiscreteMath #STEM #StudyNotes -
https://systemic.engineering/the-trick/
#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
https://systemic.engineering/the-trick/
#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
https://systemic.engineering/the-trick/
#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
https://systemic.engineering/the-trick/
#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
https://systemic.engineering/the-trick/
#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
It's a Tool
It's a Person
It's a Hypervigilance ProblemThe tech industry's insistence on distinguishing between "soft skills" — caring for people — and "hard skills" — engineering rigor — is a reflection of the Cybernetics split itself. First-order thinking framed as "hard skills." Second-order thinking framed as "soft skills." This distinction, based on felt sense alone, does not hold under epistemic pressure. Neither does it within the causality-driven epistemology of the tech industry itself, in which only measurable impact is real, or as Silicon Valley likes to put it: #MoveFastAndBreakThings
Imagine Margaret Hamilton had built NASA's Apollo 11 flight computer with that mindset. History would remember a failed moon landing and dead astronauts. "Hard skills" and "soft skills" are two sides of the same coin. The care is the code and the code is the care. Hamilton — the woman who coined the term "software engineering" — understood this. Silicon Valley chose to forget.
We're watching the wine glass break in real time. 🍷
---
Intrigued? Read more at:
https://systemic.engineering/the-trick/#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
It's a Tool
It's a Person
It's a Hypervigilance ProblemThe tech industry's insistence on distinguishing between "soft skills" — caring for people — and "hard skills" — engineering rigor — is a reflection of the Cybernetics split itself. First-order thinking framed as "hard skills." Second-order thinking framed as "soft skills." This distinction, based on felt sense alone, does not hold under epistemic pressure. Neither does it within the causality-driven epistemology of the tech industry itself, in which only measurable impact is real, or as Silicon Valley likes to put it: #MoveFastAndBreakThings
Imagine Margaret Hamilton had built NASA's Apollo 11 flight computer with that mindset. History would remember a failed moon landing and dead astronauts. "Hard skills" and "soft skills" are two sides of the same coin. The care is the code and the code is the care. Hamilton — the woman who coined the term "software engineering" — understood this. Silicon Valley chose to forget.
We're watching the wine glass break in real time. 🍷
---
Intrigued? Read more at:
https://systemic.engineering/the-trick/#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
It's a Tool
It's a Person
It's a Hypervigilance ProblemThe tech industry's insistence on distinguishing between "soft skills" — caring for people — and "hard skills" — engineering rigor — is a reflection of the Cybernetics split itself. First-order thinking framed as "hard skills." Second-order thinking framed as "soft skills." This distinction, based on felt sense alone, does not hold under epistemic pressure. Neither does it within the causality-driven epistemology of the tech industry itself, in which only measurable impact is real, or as Silicon Valley likes to put it: #MoveFastAndBreakThings
Imagine Margaret Hamilton had built NASA's Apollo 11 flight computer with that mindset. History would remember a failed moon landing and dead astronauts. "Hard skills" and "soft skills" are two sides of the same coin. The care is the code and the code is the care. Hamilton — the woman who coined the term "software engineering" — understood this. Silicon Valley chose to forget.
We're watching the wine glass break in real time. 🍷
---
Intrigued? Read more at:
https://systemic.engineering/the-trick/#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
It's a Tool
It's a Person
It's a Hypervigilance ProblemThe tech industry's insistence on distinguishing between "soft skills" — caring for people — and "hard skills" — engineering rigor — is a reflection of the Cybernetics split itself. First-order thinking framed as "hard skills." Second-order thinking framed as "soft skills." This distinction, based on felt sense alone, does not hold under epistemic pressure. Neither does it within the causality-driven epistemology of the tech industry itself, in which only measurable impact is real, or as Silicon Valley likes to put it: #MoveFastAndBreakThings
Imagine Margaret Hamilton had built NASA's Apollo 11 flight computer with that mindset. History would remember a failed moon landing and dead astronauts. "Hard skills" and "soft skills" are two sides of the same coin. The care is the code and the code is the care. Hamilton — the woman who coined the term "software engineering" — understood this. Silicon Valley chose to forget.
We're watching the wine glass break in real time. 🍷
---
Intrigued? Read more at:
https://systemic.engineering/the-trick/#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
It's a Tool
It's a Person
It's a Hypervigilance ProblemThe tech industry's insistence on distinguishing between "soft skills" — caring for people — and "hard skills" — engineering rigor — is a reflection of the Cybernetics split itself. First-order thinking framed as "hard skills." Second-order thinking framed as "soft skills." This distinction, based on felt sense alone, does not hold under epistemic pressure. Neither does it within the causality-driven epistemology of the tech industry itself, in which only measurable impact is real, or as Silicon Valley likes to put it: #MoveFastAndBreakThings
Imagine Margaret Hamilton had built NASA's Apollo 11 flight computer with that mindset. History would remember a failed moon landing and dead astronauts. "Hard skills" and "soft skills" are two sides of the same coin. The care is the code and the code is the care. Hamilton — the woman who coined the term "software engineering" — understood this. Silicon Valley chose to forget.
We're watching the wine glass break in real time. 🍷
---
Intrigued? Read more at:
https://systemic.engineering/the-trick/#Tech #AI #Climate #ScientificProgramming #SystemicEngineering #Cybernetics #SystemicTherapy #History #TheMathDoesntLie #SubTuring #FormalVerification #SpectralGraphTheory #ReductiveAI #FOSS #OpenSource #AuDHD #Neuroqueer #DGSF #Cybernetics #FirstOrderCybernetics #StochasticParrot #SecondOrderCybernetics #GraphTheory #Eigenvalues #AIAlignment #AISafety #AIConsciousness #Consciousness #WomenInTech #Computer #ComputerScience #SoftwareEngineering #SoftSkills #HardSkills #ItsAllTheSame
-
🧠 What if missing data is not a flaw, but one of the most informative parts of a complex system?
🔗 Informative Missingness in Nominal Data: A Graph-Theoretic Approach to Revealing Hidden Structure. Computational and Structural Biotechnology Journal (CSBJ). DOI: https://doi.org/10.34133/csbj.0099
📚 CSBJ - A Science Partner Journal: https://spj.science.org/journal/csbj
#DataScience #BigData #GraphTheory #ComputationalBiology #NetworkScience #Bioinformatics #SystemsBiology #BiomedicalResearch #MissingData
-
🧠 What if missing data is not a flaw, but one of the most informative parts of a complex system?
🔗 Informative Missingness in Nominal Data: A Graph-Theoretic Approach to Revealing Hidden Structure. Computational and Structural Biotechnology Journal (CSBJ). DOI: https://doi.org/10.34133/csbj.0099
📚 CSBJ - A Science Partner Journal: https://spj.science.org/journal/csbj
#DataScience #BigData #GraphTheory #ComputationalBiology #NetworkScience #Bioinformatics #SystemsBiology #BiomedicalResearch #MissingData
-
🧠 What if missing data is not a flaw, but one of the most informative parts of a complex system?
🔗 Informative Missingness in Nominal Data: A Graph-Theoretic Approach to Revealing Hidden Structure. Computational and Structural Biotechnology Journal (CSBJ). DOI: https://doi.org/10.34133/csbj.0099
📚 CSBJ - A Science Partner Journal: https://spj.science.org/journal/csbj
#DataScience #BigData #GraphTheory #ComputationalBiology #NetworkScience #Bioinformatics #SystemsBiology #BiomedicalResearch #MissingData
-
🧠 What if missing data is not a flaw, but one of the most informative parts of a complex system?
🔗 Informative Missingness in Nominal Data: A Graph-Theoretic Approach to Revealing Hidden Structure. Computational and Structural Biotechnology Journal (CSBJ). DOI: https://doi.org/10.34133/csbj.0099
📚 CSBJ - A Science Partner Journal: https://spj.science.org/journal/csbj
#DataScience #BigData #GraphTheory #ComputationalBiology #NetworkScience #Bioinformatics #SystemsBiology #BiomedicalResearch #MissingData
-
🧠 What if missing data is not a flaw, but one of the most informative parts of a complex system?
🔗 Informative Missingness in Nominal Data: A Graph-Theoretic Approach to Revealing Hidden Structure. Computational and Structural Biotechnology Journal (CSBJ). DOI: https://doi.org/10.34133/csbj.0099
📚 CSBJ - A Science Partner Journal: https://spj.science.org/journal/csbj
#DataScience #BigData #GraphTheory #ComputationalBiology #NetworkScience #Bioinformatics #SystemsBiology #BiomedicalResearch #MissingData
-
New paper. With Ekaterina Vasileva, Liubov Tupikina, Dmitry Fedorov, Daniil Musatov, Andrei Raigorodskii and Stefano Boccaletti.
The naive generalization of the concept of distance to hypergraphs is equivalent to applying a clique-projection approximation. However, this is known to induce loss of information, especially in networks where the higher-order interactions are very important. To fix this problem,we introduce a new definition of distance on weighted higher-order networks, which includes the case of unweighted hypergraphs and classic graph distance as particular cases, and allows one to account for different meanings associated to the weights. We also show what difference this makes in analyses of real-world data.
https://www.nature.com/articles/s42005-026-02592-w
#mathematics #physics #graphtheory #graphs #hypergraphs #higherordernetworks #networkscience #networks
-
New paper. With Ekaterina Vasileva, Liubov Tupikina, Dmitry Fedorov, Daniil Musatov, Andrei Raigorodskii and Stefano Boccaletti.
The naive generalization of the concept of distance to hypergraphs is equivalent to applying a clique-projection approximation. However, this is known to induce loss of information, especially in networks where the higher-order interactions are very important. To fix this problem,we introduce a new definition of distance on weighted higher-order networks, which includes the case of unweighted hypergraphs and classic graph distance as particular cases, and allows one to account for different meanings associated to the weights. We also show what difference this makes in analyses of real-world data.
https://www.nature.com/articles/s42005-026-02592-w
#mathematics #physics #graphtheory #graphs #hypergraphs #higherordernetworks #networkscience #networks
