The tag has no usage guidance.

learn more… | top users | synonyms (1)

0
votes
0answers
77 views

Primitivity of $AA^\top$

Let $A\in\mathbb{R}^{n\times n}$ be a non-negative and irreducible matrix. Consider $B:=AA^\top$. It can be proved (I can post a proof if needed) that the following condition is necessary and ...
2
votes
0answers
118 views

Which functions preserve the connectivity of graphs/components?

I am somewhat stuck working on an issue and would really love some guidance. I will state the problem, my current state and what led to it in case the solution lies beyond where I was looking The ...
0
votes
2answers
122 views

Is there a name for this operation on graphs - e.g. duplication, Kronecker product of graphs?

I am revising a paper where one of the operations performed on a undirected graph with no loops, is to take each vertex, and split it into two vertices, and take each edge and replace it with 4 edges: ...
-3
votes
1answer
218 views

adjacency matrix of random geometric graphs [closed]

Consider a graph with N nodes. All nodes are distributed as a Poisson point process with density of λ in a L*L area. There is an edge between two nodes if and only if the distance between them is less ...
1
vote
1answer
178 views

power bounded adjacency matrices

A bounded linear operator $T$ on a Banach space $X$ is called power bounded if $\|T^k\|\le M$ for some $M>0$ and all $k\in \mathbb N$. A classical result of Lorch says that if $X$ is reflexive, ...