Jeff

247
Reputation
98 views
Is this your account?

Registered User 

Name Jeff
Member for 1 year
Seen 10 hours ago
Website
Location
Age
10h
 comment Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)
@piotr-migdal: What if we just consider the case where $W_{ij}$ is much greater than $W_{ik}$ and $W_{jk}$ for all $k \notin \{i,j\}$? Then, it isn't possible that $|v_i−v_j|$ is large, is it?
10h
 comment Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)
@meij: Yes, let v be a unit vector. So, I suppose $1$ is technically an upper bound on $|v_i−v_j|$, but I was hoping for something tighter, involving $W_{ij}$...I need a bound I can optimize $W$ with respect to. Thanks for the question.
18h
 revised Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)
added 45 characters in body; edited tags; edited title
1d
 revised Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)
edited title
1d
 revised Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)
deleted 32 characters in body; added 34 characters in body; deleted 4 characters in body
1d
 asked Upper bound on the difference between two elements of the Fiedler vector (a particular eigenvector of a graph Laplacian)