Joint Distribution of graph-distances between vertices in Uniform Spanning tree The 2019 Stack Overflow Developer Survey Results Are In Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar Manaracomplete $k$-ary tree: average distance between all verticesPartition of graph into independent sets of consecutive verticesMinimum Spanning Tree in a Complete GraphMinimal alpha-Spanning TreeRandom Walk on graph with five verticesFind $G$ if $G-v$ is regular $forall v in V$Do these graph operations preserve bounded treewidth?Determine the number of graph vertices given some of their degreesNotation for a complete graph with $mid v_1cup v_2mid$ number of verticesEmbedding a weighted graph into $mathbbR^n$
My body leaves; my core can stay
Why not take a picture of a closer black hole?
Is it ethical to upload a automatically generated paper to a non peer-reviewed site as part of a larger research?
How did passengers keep warm on sail ships?
Visa regaring travelling European country
How to politely respond to generic emails requesting a PhD/job in my lab? Without wasting too much time
Sub-subscripts in strings cause different spacings than subscripts
Drawing arrows from one table cell reference to another
Did the new image of black hole confirm the general theory of relativity?
Why did Peik Lin say, "I'm not an animal"?
Separating matrix elements by lines
What information about me do stores get via my credit card?
Is every episode of "Where are my Pants?" identical?
Do I have Disadvantage attacking with an off-hand weapon?
Homework question about an engine pulling a train
Working through the single responsibility principle (SRP) in Python when calls are expensive
How to type a long/em dash `—`
Does Parliament need to approve the new Brexit delay to 31 October 2019?
Is 'stolen' appropriate word?
One-dimensional Japanese puzzle
should truth entail possible truth
Can the DM override racial traits?
What's the point in a preamp?
What was the last x86 CPU that did not have the x87 floating-point unit built in?
Joint Distribution of graph-distances between vertices in Uniform Spanning tree
The 2019 Stack Overflow Developer Survey Results Are In
Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar Manaracomplete $k$-ary tree: average distance between all verticesPartition of graph into independent sets of consecutive verticesMinimum Spanning Tree in a Complete GraphMinimal alpha-Spanning TreeRandom Walk on graph with five verticesFind $G$ if $G-v$ is regular $forall v in V$Do these graph operations preserve bounded treewidth?Determine the number of graph vertices given some of their degreesNotation for a complete graph with $mid v_1cup v_2mid$ number of verticesEmbedding a weighted graph into $mathbbR^n$
$begingroup$
Let T be uniform spanning tree on complete graph $K_n$ (Or equivalently, uniform tree on n-vertices.) Suppose, I choose two vertices, say $u$ and $v$, and look at the graph distance between them in T. Then I can write an explicit formula for the distribution of this new random variable $D_2$. After a suitable scaling it can also be shown that this distribution converges to Rayleigh distribution. Now, if I start with three vertices (as leaves), and I want to understand the joint distribution of the distance between $(v_1,v_2), (v_2,v_3), (v_1,v_3)$. In order to do this, we change the question a little bit by observing that if a tree has 3 leaves, it must have exactly 3 legs. And, we can ask for the joint distribution of length of legs. I wrote an explicit formula for the case when we have 3 leaves and 3 legs. It is already well-known that the joint distribution of graph distance between k vertices converges in distribution (after scaling) to a distribution called $F_k$. The proof is given in a paper due to Peres.
But, since the complete graph is relatively easier case, I am interested in knowing the explicit joint distribution of the graph distance between vertices. For more than 3 legs, I could not write an explicit description. Can someone suggest me a place where I can look it up, or can someone hint at what should the joint distribution look like?
probability graph-theory random-graphs
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
$endgroup$
add a comment |
$begingroup$
Let T be uniform spanning tree on complete graph $K_n$ (Or equivalently, uniform tree on n-vertices.) Suppose, I choose two vertices, say $u$ and $v$, and look at the graph distance between them in T. Then I can write an explicit formula for the distribution of this new random variable $D_2$. After a suitable scaling it can also be shown that this distribution converges to Rayleigh distribution. Now, if I start with three vertices (as leaves), and I want to understand the joint distribution of the distance between $(v_1,v_2), (v_2,v_3), (v_1,v_3)$. In order to do this, we change the question a little bit by observing that if a tree has 3 leaves, it must have exactly 3 legs. And, we can ask for the joint distribution of length of legs. I wrote an explicit formula for the case when we have 3 leaves and 3 legs. It is already well-known that the joint distribution of graph distance between k vertices converges in distribution (after scaling) to a distribution called $F_k$. The proof is given in a paper due to Peres.
But, since the complete graph is relatively easier case, I am interested in knowing the explicit joint distribution of the graph distance between vertices. For more than 3 legs, I could not write an explicit description. Can someone suggest me a place where I can look it up, or can someone hint at what should the joint distribution look like?
probability graph-theory random-graphs
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
$endgroup$
add a comment |
$begingroup$
Let T be uniform spanning tree on complete graph $K_n$ (Or equivalently, uniform tree on n-vertices.) Suppose, I choose two vertices, say $u$ and $v$, and look at the graph distance between them in T. Then I can write an explicit formula for the distribution of this new random variable $D_2$. After a suitable scaling it can also be shown that this distribution converges to Rayleigh distribution. Now, if I start with three vertices (as leaves), and I want to understand the joint distribution of the distance between $(v_1,v_2), (v_2,v_3), (v_1,v_3)$. In order to do this, we change the question a little bit by observing that if a tree has 3 leaves, it must have exactly 3 legs. And, we can ask for the joint distribution of length of legs. I wrote an explicit formula for the case when we have 3 leaves and 3 legs. It is already well-known that the joint distribution of graph distance between k vertices converges in distribution (after scaling) to a distribution called $F_k$. The proof is given in a paper due to Peres.
But, since the complete graph is relatively easier case, I am interested in knowing the explicit joint distribution of the graph distance between vertices. For more than 3 legs, I could not write an explicit description. Can someone suggest me a place where I can look it up, or can someone hint at what should the joint distribution look like?
probability graph-theory random-graphs
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
$endgroup$
Let T be uniform spanning tree on complete graph $K_n$ (Or equivalently, uniform tree on n-vertices.) Suppose, I choose two vertices, say $u$ and $v$, and look at the graph distance between them in T. Then I can write an explicit formula for the distribution of this new random variable $D_2$. After a suitable scaling it can also be shown that this distribution converges to Rayleigh distribution. Now, if I start with three vertices (as leaves), and I want to understand the joint distribution of the distance between $(v_1,v_2), (v_2,v_3), (v_1,v_3)$. In order to do this, we change the question a little bit by observing that if a tree has 3 leaves, it must have exactly 3 legs. And, we can ask for the joint distribution of length of legs. I wrote an explicit formula for the case when we have 3 leaves and 3 legs. It is already well-known that the joint distribution of graph distance between k vertices converges in distribution (after scaling) to a distribution called $F_k$. The proof is given in a paper due to Peres.
But, since the complete graph is relatively easier case, I am interested in knowing the explicit joint distribution of the graph distance between vertices. For more than 3 legs, I could not write an explicit description. Can someone suggest me a place where I can look it up, or can someone hint at what should the joint distribution look like?
probability graph-theory random-graphs
probability graph-theory random-graphs
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
asked Mar 31 at 8:12
WhoKnowsWhoWhoKnowsWho
1017
1017
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f3169158%2fjoint-distribution-of-graph-distances-between-vertices-in-uniform-spanning-tree%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%2f3169158%2fjoint-distribution-of-graph-distances-between-vertices-in-uniform-spanning-tree%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
