Respondida

Finding number of independent pathways in a graph

I'd expect the call to rmedge is the most expensive here. You could instead add edge weights for every edge in the graph, and th...

Finding number of independent pathways in a graph

I'd expect the call to rmedge is the most expensive here. You could instead add edge weights for every edge in the graph, and th...

más de 1 año hace | 0

Respondida

Feature for eigs involving just positive eigenvalues

There's no option to do so directly, since it's not a common request and there's already a lot of option names in EIGS to dig th...

Feature for eigs involving just positive eigenvalues

There's no option to do so directly, since it's not a common request and there's already a lot of option names in EIGS to dig th...

más de 1 año hace | 0

| aceptada

Respondida

Large sparse matrix LU decomposition

If the call to lu runs out of memory, but the call to decomposition(__, 'lu') doesn't, likely the reason is that decomposition u...

Large sparse matrix LU decomposition

If the call to lu runs out of memory, but the call to decomposition(__, 'lu') doesn't, likely the reason is that decomposition u...

más de 1 año hace | 0

| aceptada

Respondida

Facing a unbalanced matrix, such as 3*5000, why someone reduce the computational cost by svd(A*A') .

The computational complexity of svd (when using the 'econ' option, which is very necessary for matrices that are far from square...

Facing a unbalanced matrix, such as 3*5000, why someone reduce the computational cost by svd(A*A') .

The computational complexity of svd (when using the 'econ' option, which is very necessary for matrices that are far from square...

más de 1 año hace | 1

| aceptada

Respondida

Boundary 'edges' around node(s)

There is no option to do this as part of the graph plot directly. You can achieve it by turning off the node markers (set 'Marke...

Boundary 'edges' around node(s)

There is no option to do this as part of the graph plot directly. You can achieve it by turning off the node markers (set 'Marke...

más de 1 año hace | 1

Respondida

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...

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...

más de 1 año hace | 0

| aceptada

Respondida

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...

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...

más de 1 año hace | 0

Respondida

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 ...

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 ...

más de 1 año hace | 0

Respondida

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...

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...

más de 1 año hace | 1

| aceptada

Respondida

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...

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...

más de 1 año hace | 2

| aceptada

Respondida

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.

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.

más de 1 año hace | 0

| aceptada

Respondida

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 ...

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 ...

más de 1 año hace | 1

Respondida

Betweenness Centrality, Edge betweenness

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

Betweenness Centrality, Edge betweenness

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

más de 1 año hace | 0

Respondida

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...

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...

más de 1 año hace | 1

| aceptada

Respondida

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'...

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'...

más de 1 año hace | 0

| aceptada

Respondida

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. ...

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. ...

más de 1 año hace | 0

| aceptada

Respondida

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...

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...

más de 1 año hace | 1

Respondida

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...

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...

más de 1 año hace | 5

| aceptada

Respondida

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, ...

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, ...

más de 1 año hace | 0

Respondida

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...

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...

más de 1 año hace | 1

Respondida

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...

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...

más de 1 año hace | 0

| aceptada

Respondida

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 ...

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 ...

casi 2 años hace | 1

Respondida

Direct Solver

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

Direct Solver

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

casi 2 años hace | 1

Respondida

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 ...

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 ...

casi 2 años hace | 0

Respondida

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...

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...

casi 2 años hace | 0

| aceptada

Respondida

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...

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...

casi 2 años hace | 1

Respondida

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...

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...

casi 2 años hace | 0

Respondida

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...

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...

casi 2 años hace | 0

Respondida

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.

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.

casi 2 años hace | 1

| aceptada

Respondida

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...

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...

casi 2 años hace | 0