# Tagged Questions

**1**

vote

**1**answer

90 views

### How to model a time-discrete heat equation on a graph?

I would like to know how one can set up a time-discrete model for the heat equation on a graph?
Is this problem using the heat kernel equation on a graph?

**0**

votes

**0**answers

64 views

### Heat equation with graph laplacian

I would like to start with considering the time-dependent heat equation on a connected graph and consider its Laplacian matrix.
Suppose we have a connected graph with unknown temperature on vertices. ...

**3**

votes

**1**answer

174 views

### Calculating a generalized inverse (Mooreâ€“Penrose pseudoinverse)

I am considering a graph with $n$ edges with the following nicely structured adjacency matrix:
\begin{equation}
A_n=
\begin{pmatrix}
0 & 0 & 0 &\cdots & 0 & 0 & 1\\
0 & 0 ...

**2**

votes

**1**answer

166 views

### positive semidefinite matrix condition

There is a great work of Alizadeh that in section 4 speaks about Minimizing sum of the first few(k-largest) eigenvalues of a symmetric matrix. Instead of a symmetric model we use the weighted ...

**1**

vote

**0**answers

63 views

### Effect of removing a Hamiltonian cycle on the Laplacian spectrum

Notation: $\lambda_{\max}(G)$ is the largest eigenvalue of the Laplacian matrix of the graph $G$ (aka the Laplacian index of $G$).
Now suppose $G$ is a Hamiltonian graph with Hamiltonian cycle $C$.
...

**4**

votes

**1**answer

169 views

### Divisibility Relation for Spanning Trees of a Graph

Let $A = \big[{1\ 1\atop 1\ 0}\big]$, and let $G_n$ be the graph whose adjacency matrix is
$A^{\otimes n}$. Also let $\kappa(G)$ denote the number of spanning trees of $G$. From a significant amount ...

**4**

votes

**2**answers

272 views

### How does a quasi-isometry affect Poisson or Martin boundaries?

Take two graphs (of bounded valency) or manifolds (f bounded geometry) $G$ and $G'$. Assume there is a quasi-isometry $f:G \to G'$, and assume the Poisson or Martin boundary of $G$ is known, what may ...

**5**

votes

**0**answers

274 views

### Sequence of graphs with small $\lambda_1$ (the smallest nonzero eigenvalue of a regular finite graph)

The combinatorial laplacian on a finite graph $G$ can be defined as $ \Delta: \mathbb{C}^G \to \mathbb{C}^G$ sending the function $f:G \to \mathbb{C}$ to $(\Delta f)(v) = \sum_{v' \sim v} \big( ...

**6**

votes

**3**answers

1k views

### Eigenvectors and partitions of graphs

Let G be an undirected graph with the node set $V$ and the Laplacian matrix $L$. Let $N(v)$ denote the neighbors of a node $v$ and $|N(v)|$ its degree. Then a partition $\pi=(V_1, V_2, \ldots, V_k)$ ...

**0**

votes

**0**answers

184 views

### Graph Laplacian to Continuous version

Has there been a study of vector laplacian that is a continuous version of a graph laplacian? Is there a good introduction to the topic?

**3**

votes

**4**answers

936 views

### Boundaries of the eigenvalues of a symmetric matrix (or of its Lapacian)

Given the adjacency matrix $A_{ij}$ of a graph with $N$ vertices and $M$ links (or any binary symmetric matrix of size $N \times N$), is it possible to establish lower and upper boundaries of its ...