Christine Tobler

Last seen: Today

MathWorks

310 total contributions since 2015

Professional Interests: numerical linear algebra, graph algorithms

Christine Tobler's Badges

Answered
Minimum Spanning Tree - Path or Start-End
In general, you can't rely on the fact that a minimum spanning tree will just be one path. However, if you have a graph for whic...

1 day ago | 0

| accepted

Answered
how to determine efficiency centrality of a node in Matlab
There isn't an efficiency centrality implemented in MATLAB. Based on the paper I quickly read, it seems you would best compute t...

4 days ago | 0

Answered
Graph Laplacian and adjacency matrix
Take a look at pdist in the Statistics and Machine Learning toolbox. If you apply this to your matrix, and then call squareform ...

7 days ago | 0

Answered
Matrix inverse with svd
Use one of A = [ 2 4 6; 8 5 7 ; 0 3 1] [U,S,V] = svd(A); V*inv(S)*U' V*(S\U') % The formula you're using above puts the par...

11 days ago | 0

| accepted

Answered
Degree and influence of line of a node in network
The only reference for DIL I could find is a 2016 paper: Evaluating the importance of nodes in complex networks, J Liu, Q Xiong...

15 days ago | 2

| accepted

Answered
How to find all the edges connecting a specific node with other nodes?
Use outedges to find the IDs of all outgoing edges, or neighbors to find all nodes connected to by these edges.

29 days ago | 0

| accepted

Answered
Symbolic SVD for square matrix
The computation of the SVD in symbolic mathematics involves the solving of a polynomial equation of degree given by the size of ...

1 month ago | 1

Answered
Betweenness Centrality, Edge betweenness
For betweenness centrality, see centrality method of graph and digraph classes. Edge betweenness is not provided.

1 month ago | 0

Answered
How to create random graph?
You can use s = randi(n, e, 1); t = randi(n, e, 1); G = graph(s, t, [], n); which will give you a graph with n nodes and e e...

1 month ago | 1

| accepted

Answered
Why do logical operators do not work with the eigenvalues of this matrix?
There's a small round-off error on the eigenvalue 1: >> TM = [0.1,0.2,0.7; 0.5,0.2,0.3;0.1,0.1,0.8]; [V,D] = eig(TM', 'vector'...

2 months ago | 0

| accepted

Answered
Digraph with a single constrained axis
All algorithms for graph visualization that I'm aware of will compute both x and y (and sometimes z) coordinates for the nodes. ...

2 months ago | 0

Answered
how would i change an undirected network into a directed network on matlab?
It depends on what you want to the directed graph to look like. To replace every undirected edge with two directed edges going i...

2 months ago | 1

Answered
Both eig() and eigs() function calculate different eigenvalues depending on optional input values
The problems seen here are due to M being symmetric positive semi-definite. Such a matrix is numerically singular, which can hav...

3 months ago | 5

| accepted

Answered
Warning: Matrix is singular to working precision: What exactly generates this warning?
The warning is generated based on an estimate of the condition number (specifically, the reciprocal condition number in 1-norm, ...

3 months ago | 0

Answered
Traverse a directed graph visiting all edges at least once?
There aren't any functions for MATLAB's graph object that solve this problem. Possibly you can formulate this as an optimization...

3 months ago | 1

Answered
How to search all elements in two cell arrays?
All right, let's assume you have a graph containing both G and H stored as graph object GH, and that this graph contains the bla...

3 months ago | 0

| accepted

Answered
My Hessenberg Decomposition code is not working
Your code looks correct, try it with A = randn(10) for example - this matches the outputs of HESS quite closely. When the input ...

4 months ago | 1

Answered
Direct Solver
The direct sparse solver (\) unfortunately doesn't have methods for complex symmetric or hermitian problems, only for real symme...

4 months ago | 1

Answered
Solve large linear equations with backslash operator. Why is sparse matrix solved slower than the full matrix?
Sparse linear system solvers are usually fast for sparse matrices with specific structure of where the nonzeros are placed. For ...

4 months ago | 0

Answered
EIGS: Why is 'smallestabs' faster than 'largestabs'?
Whether 'largestabs' or 'smallestabs' depends on the problem: 'smallestabs' needs to factorize the first input, which can make i...

4 months ago | 0

| accepted

Answered
What is the algorithm used by svd function?
We don't give information on what SVD algorithm we use, look up the LAPACK library for detailed descriptions. For practical pur...

4 months ago | 1

Answered
Inverse of higher order matrix
Another way of looking at the equations x*Q = 0 and x e = 1 is as an equation system x * [Q e] = [0 1], which you could solve us...

4 months ago | 0

Answered
How to decompose a 4th order tensor
The value of K1111 is overwritten with the next value in every loop iteration - is this your intention, or did you maybe mean to...

5 months ago | 0

Answered
How can I find the Members of the largest component of a graph?
Use oF = F_prime.Nodes.Name(bin==m); instead of the find command to return node names instead of node numbers.

5 months ago | 1

| accepted

Answered
Projecting data points onto eigenvector space
The lambda here is a diagonal matrix, so SORT will sort each of its columns, not the eigenvalues on the diagonal among themselve...

5 months ago | 0

Answered
Soring varying and compex eigenvalues
This can't be done one the level of individual EIG calls, since it's necessary to track eigenvalues from one call to the next. T...

5 months ago | 0

| accepted

Answered
Change position of Graph edge label and node label
The position of the labels that are part of the graph plot can't be modified. It's possible to create independent text labels an...

5 months ago | 0

Answered
Specifying node numbers using digraph
The easiest way to use graph/digraph when your node numbers are not sequential is to convert the node numbers to string, which w...

5 months ago | 0

| accepted

Answered
Cannot create a matrix using pinv.
You've hit on a rare matrix that the SVD algorithm isn't able to work with (the SVD being the factorization called withing the P...

5 months ago | 0

Answered
Solving for ALL the eigenvectors of a sparse matrix
There isn't really an algorithm like this, unless you have a very specific structure (tridiagonal or banded matrix mostly). The...

5 months ago | 1