132 reputation
6
bio website tfmaw.blogspot.co.uk
location UK
age 32
visits member for 3 years
seen Dec 11 at 15:00

Mathematician who is going deep into collaborations with commercial sector businesses. They have me working on different technologies and throw really interesting problems at me.

Love thinking too deeply about almost anything; sea turtle speed. Maybe I will manage to outrace the sail fish! lol


Sep
29
awarded  Popular Question
Sep
6
accepted Methods to approximate the betweenness centrality on large networks
Sep
2
comment Methods to approximate the betweenness centrality on large networks
@JohnMangual, good idea!
Sep
2
comment Methods to approximate the betweenness centrality on large networks
@JohnMangual, I have recently posted a question on stat.stackexchange.com which I am waiting to see some activity. This site is much more active and the answers more in depth
Sep
1
comment Methods to approximate the betweenness centrality on large networks
@fedja, they arise from twitter, so large hubs. They vary. Usually a very steep degree distribution decay
Sep
1
comment Methods to approximate the betweenness centrality on large networks
@fedja, I was hoping for something linear in complexity. I agree with your arguments that in general there are no guarantees with a stochastic approach. But that is the same issue with all sampling approaches. What if I check for consistency of the results with individual runs? Like perform convergence diagnostics on the centrality computed?
Sep
1
awarded  Editor
Sep
1
revised Methods to approximate the betweenness centrality on large networks
added 33 characters in body
Sep
1
asked Methods to approximate the betweenness centrality on large networks
Feb
7
awarded  Supporter
Feb
7
accepted How to identify bridge nodes between nearly connected graph components in partitioned adjacency matrices?
Feb
1
awarded  Student
Feb
1
asked How to identify bridge nodes between nearly connected graph components in partitioned adjacency matrices?
Jan
31
awarded  Scholar
Jan
31
awarded  Autobiographer
Jan
31
accepted Can the first non-zero eigenvalue of a Laplacian matrix with more than 1 zero valued eigenvalue be used to reorder an adjacency matrix?
Jan
31
comment Can the first non-zero eigenvalue of a Laplacian matrix with more than 1 zero valued eigenvalue be used to reorder an adjacency matrix?
@xawlaxaw , do you think that I could add small random padding values to the zeros in the adjacency matrix to force the Fiedler vector's eigenvalue to be non-zero?
Jan
30
asked Can the first non-zero eigenvalue of a Laplacian matrix with more than 1 zero valued eigenvalue be used to reorder an adjacency matrix?