The perturbation-theory tag has no wiki summary.

**5**

votes

**0**answers

146 views

### Behavior of eigenspaces of adjacency matrices of random graphs (not via perturbation theory)

For the sake of discussion, let us say that we have the adjacency matrix $A$ of a graph, on $n$ nodes, from a stochastic block model with 2 blocks. Another name for this (usually used in computer ...

**5**

votes

**0**answers

293 views

### Rigorous results on the method of multiple scales

The method of multiple scales (Scholarpedia) is a technique used to obtain approximate solutions to differential equations, most commonly when some of the more standard approaches to perturbation ...

**2**

votes

**0**answers

197 views

### Distributions of eigenvalues for matrix normal distribution: related references

I am interested in the distribution of the eigenvalues of matrices that are sampled from the matrix normal distribution.
I am sampling from $p(X \mid M,U,V)$ and let's assume that I know the ...

**2**

votes

**0**answers

68 views

### series representation for *un*bounded perturbations of semigroup generators

Let $A$ generate an analytic $C_0$-semigroup on a Banach space $X$ and $B$ be a relatively compact perturbation, i.e., $B$ is compact as an operator from $D(A)$ (with the graph norm) to $X$. Then ...

**1**

vote

**0**answers

58 views

### Perturbation of eigenvalues of some special matrices

In perturbation theory of linear operators, one major question is how the eigenvalues of a linear operator $A$ change under a small perturbation, $A(x) = A + xP$, with $x\in\mathbb{R}$. For instance, ...

**1**

vote

**0**answers

79 views

### Inverse of matrix of generalised harmonic numbers

For $s=0,1,\dots$ and $n=1,2,\dots$, denote $r_{n,s}=\sum_{k=1}^n k^s$. It is well-known that $r_{n,s}$ are polynomials in $n$ with leading term $\frac{1}{s+1}n^{s+1}$. Let $R_{n,s}$ be the ...

**1**

vote

**0**answers

82 views

### On generalization of Wigner semi circle

I want to analyse noise model for a matrix M whose entries are not real numbers. The matrix is a collection of N permutation matrices of size nxn i.e, M is NnxNn. Because its a collection of ...

**0**

votes

**0**answers

21 views

### Weighted Perturbation Bound for Polar Decomposition

Setup: Let $X\in\mathbb{R}^{n\times r}$ be a matrix with orthogonal columns, with $\Sigma = X^TX$, and assume that $\Sigma$ is invertible (note, $\Sigma$ is not necessarily the identity).
Suppose we ...

**0**

votes

**0**answers

41 views

### Perturbation method of a boundary value problem

Let $u(x, \epsilon, \theta)$ be the solution of $$u''+(\epsilon \cos(x)+\theta-u)u=0$$ with boundary conditions $u'(0)=0$ and $u'(\pi)=0$. Here $\theta\in [0, 1]$.
I tried to put the solution in ...