Embedding graphs on $Bbb R^2$ and tuning them with a parameter The Next CEO of Stack OverflowMinimum cost path with variable costs and fixed number of stepsIs it possible to know if such path in a graph exists?How to pick $N$ “special” nodes in connected graph $G$ so that average distance from any non-special node to nearest special node is minimized?How do I solve this problem from graph theory?Graphs with weighted edges and verticesFinding highest sum with limited cost using variable NodesConnectivity of two-layer graphCreate an undirected connected graph from scratchOrienteering Problem with a graph that both nodes and edges are weightedGraph Traversal
How to install OpenCV on Raspbian Stretch?
Should I tutor a student who I know has cheated on their homework?
Why is the US ranked as #45 in Press Freedom ratings, despite its extremely permissive free speech laws?
Are police here, aren't itthey?
Chain wire methods together in Lightning Web Components
Find non-case sensitive string in a mixed list of elements?
INSERT to a table from a database to other (same SQL Server) using Dynamic SQL
Is a distribution that is normal, but highly skewed considered Gaussian?
Why do remote US companies require working in the US?
Why isn't the Mueller report being released completely and unredacted?
Does Germany produce more waste than the US?
How a 64-bit process virtual address space is divided in Linux?
Method for adding error messages to a dictionary given a key
Why do airplanes bank sharply to the right after air-to-air refueling?
Is micro rebar a better way to reinforce concrete than rebar?
A Man With a Stainless Steel Endoskeleton (like The Terminator) Fighting Cloaked Aliens Only He Can See
WOW air has ceased operation, can I get my tickets refunded?
What flight has the highest ratio of time difference to flight time?
Is French Guiana a (hard) EU border?
Why is my new battery behaving weirdly?
How to invert MapIndexed on a ragged structure? How to construct a tree from rules?
Is it okay to majorly distort historical facts while writing a fiction story?
Flying from Cape Town to England and return to another province
Recycling old answers
Embedding graphs on $Bbb R^2$ and tuning them with a parameter
The Next CEO of Stack OverflowMinimum cost path with variable costs and fixed number of stepsIs it possible to know if such path in a graph exists?How to pick $N$ “special” nodes in connected graph $G$ so that average distance from any non-special node to nearest special node is minimized?How do I solve this problem from graph theory?Graphs with weighted edges and verticesFinding highest sum with limited cost using variable NodesConnectivity of two-layer graphCreate an undirected connected graph from scratchOrienteering Problem with a graph that both nodes and edges are weightedGraph Traversal
$begingroup$
Is there a discipline in mathematics that expounds upon a certain notion in graph theory. I was told that in classical graph theory, you can move nodes around without changing the graph as long as the connections stay the same.
Can graphs move through an ambient space?
Say the graph was defined in terms of two intersecting families of functions, embedded on a manifold and flowed according to a continuously changing parameter? That is to say, there is a set of functions scaled by different parameter values, all flowing at the same rate through an ambient space, while preserving connections between nodes. The nodes would be placed at the intersections.
Could one define a graph in terms of a family of intersecting functions with parameter $t,$ in $Bbb R^2$ as follows? Here is an example:
$f_s,t(x)=x^st$ and $f_s,t(1-x)=(1-x)^st,$
for $x,fin (0,1)$ and $ssubsetBbb Q.$
So if $|s|=n,$ then there are $2n$ total equations and $n^2$ nodes. If $|s|=100$ then there are $200$ total equations and $100^2$ nodes.
Equate $f_s,t(x)=f_s,t(1-x)$ and place a mass at each intersection. Let $t$ be mathematical time. As time flowed, each node would evolve and trace out a geodesic path. In the case of these particular functions, it would be a vertical path.
general-topology functions graph-theory reference-request manifolds
$endgroup$
add a comment |
$begingroup$
Is there a discipline in mathematics that expounds upon a certain notion in graph theory. I was told that in classical graph theory, you can move nodes around without changing the graph as long as the connections stay the same.
Can graphs move through an ambient space?
Say the graph was defined in terms of two intersecting families of functions, embedded on a manifold and flowed according to a continuously changing parameter? That is to say, there is a set of functions scaled by different parameter values, all flowing at the same rate through an ambient space, while preserving connections between nodes. The nodes would be placed at the intersections.
Could one define a graph in terms of a family of intersecting functions with parameter $t,$ in $Bbb R^2$ as follows? Here is an example:
$f_s,t(x)=x^st$ and $f_s,t(1-x)=(1-x)^st,$
for $x,fin (0,1)$ and $ssubsetBbb Q.$
So if $|s|=n,$ then there are $2n$ total equations and $n^2$ nodes. If $|s|=100$ then there are $200$ total equations and $100^2$ nodes.
Equate $f_s,t(x)=f_s,t(1-x)$ and place a mass at each intersection. Let $t$ be mathematical time. As time flowed, each node would evolve and trace out a geodesic path. In the case of these particular functions, it would be a vertical path.
general-topology functions graph-theory reference-request manifolds
$endgroup$
add a comment |
$begingroup$
Is there a discipline in mathematics that expounds upon a certain notion in graph theory. I was told that in classical graph theory, you can move nodes around without changing the graph as long as the connections stay the same.
Can graphs move through an ambient space?
Say the graph was defined in terms of two intersecting families of functions, embedded on a manifold and flowed according to a continuously changing parameter? That is to say, there is a set of functions scaled by different parameter values, all flowing at the same rate through an ambient space, while preserving connections between nodes. The nodes would be placed at the intersections.
Could one define a graph in terms of a family of intersecting functions with parameter $t,$ in $Bbb R^2$ as follows? Here is an example:
$f_s,t(x)=x^st$ and $f_s,t(1-x)=(1-x)^st,$
for $x,fin (0,1)$ and $ssubsetBbb Q.$
So if $|s|=n,$ then there are $2n$ total equations and $n^2$ nodes. If $|s|=100$ then there are $200$ total equations and $100^2$ nodes.
Equate $f_s,t(x)=f_s,t(1-x)$ and place a mass at each intersection. Let $t$ be mathematical time. As time flowed, each node would evolve and trace out a geodesic path. In the case of these particular functions, it would be a vertical path.
general-topology functions graph-theory reference-request manifolds
$endgroup$
Is there a discipline in mathematics that expounds upon a certain notion in graph theory. I was told that in classical graph theory, you can move nodes around without changing the graph as long as the connections stay the same.
Can graphs move through an ambient space?
Say the graph was defined in terms of two intersecting families of functions, embedded on a manifold and flowed according to a continuously changing parameter? That is to say, there is a set of functions scaled by different parameter values, all flowing at the same rate through an ambient space, while preserving connections between nodes. The nodes would be placed at the intersections.
Could one define a graph in terms of a family of intersecting functions with parameter $t,$ in $Bbb R^2$ as follows? Here is an example:
$f_s,t(x)=x^st$ and $f_s,t(1-x)=(1-x)^st,$
for $x,fin (0,1)$ and $ssubsetBbb Q.$
So if $|s|=n,$ then there are $2n$ total equations and $n^2$ nodes. If $|s|=100$ then there are $200$ total equations and $100^2$ nodes.
Equate $f_s,t(x)=f_s,t(1-x)$ and place a mass at each intersection. Let $t$ be mathematical time. As time flowed, each node would evolve and trace out a geodesic path. In the case of these particular functions, it would be a vertical path.
general-topology functions graph-theory reference-request manifolds
general-topology functions graph-theory reference-request manifolds
edited Mar 19 at 19:52
Ultradark
asked Mar 19 at 4:14
UltradarkUltradark
3681518
3681518
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3153670%2fembedding-graphs-on-bbb-r2-and-tuning-them-with-a-parameter%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3153670%2fembedding-graphs-on-bbb-r2-and-tuning-them-with-a-parameter%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown