The $n$-dimensional analogue of convergence circles in $\mathbb{C}$ are polydiscs, i.e. products of discs $B_{r_1}(z_1) \times ... \times B_{r_n}(z_n) \subseteq \mathbb{C}^n$. If $r_1=...=r_n$ this is just the $r$-ball around $z$ w.r.t. the $\infty$-norm on $\mathbb{C}^n$.
I claim:
$\sum_{\alpha\in\mathbb{N}^n} a_\alpha z^\alpha$ is absolutely convergent for all $z\in\mathbb{C}^n$ iff $R^{-1} := \limsup\limits_{k\to\infty} \left( \sum_{|\alpha|=k} |a_\alpha| \right)^{1/k} = 0$.
Proof:
$\impliedby$ is an easy exercise. One can indeed show absolute convergence in the interior of every polydisc with radius $<R$: $\sum_\alpha |a_\alpha z^\alpha| \leq \sum_k (\sum_{|\alpha|=k} |a_\alpha|) \|z\|_\infty^k$ is convergent because for $\|z\|_\infty<r_1<r_2<R$ all but finitely many summands are eventually smaller than $r_2^{-k} r_1^k<(\frac{r_1}{r_2})^k$.
$\implies$ follows similarly to the one-dimensional case: Fix any $w$ with $|w_i|\geq R$ for all $1\leq i\leq n$ and assume $\sum a_\alpha w^\alpha$ converges absolutely.
Then $a_\alpha w^\alpha$ goes to zero for $|\alpha|\to\infty$. Now we have $|a_\alpha w^\alpha| \geq |a_\alpha| R^{|\alpha|}$. If the LHS goes to zero, this must mean $|a_\alpha|R^{|\alpha|} \to 0$ as well.
Therefore if $\epsilon>0$, then $|a_\alpha|\leq \epsilon R^{-|\alpha|}$ for $|\alpha|\gg 0$. This implies $\sum_{|\alpha|=k} |a_\alpha| \leq \binom{n+k-1}{k} \epsilon R^{-k}$ where the binomial is exactly the number of multiindices $\alpha\in\mathbb{N}^n$ with $|\alpha|=k$ by a standard exercise in combinatorics. The binomial $\binom{n+k-1}{k}$ can also be written as $\binom{n+k-1}{n-1}$ which is a polynomial in $k$ of degree $n$. Therefore the $k$-th root of it goes to 1 with $k\to\infty$.
This shows $\limsup\limits_{k\to\infty} (\sum_{|\alpha|=k} |a_\alpha|)^{1/k} \leq R^{-1}$ which proves the claim.
Looking a bit closer at this proof, one notices that there is actually a more precise statement hidden in there which is also similar to the one-dimensional case:
If $\sum a_\alpha z^\alpha$ converges absolutely at some point $z=w$ with $|w_i|\geq r_i>0$, then the power series converges absolutely on the open polydisc $B_{r_1}(0) \times ... \times B_{r_n}(0)$.
For $n=1$ this means that the region of convergence of the power series is necessarily wedged between $B_r(0)$ and $\overline{B_r(0)}$ for some critical radius $r\in[0,\infty]$, because discs in the plane are nicely contained in each other.
For $n>1$ these containment properties no longer hold. Instead the region of convergence is now somewhere in between the less simple sets
$\bigcup_{r\in R} B_{r_1}(0) \times...\times B_{r_n}(0)$ and $\bigcup_{r\in R} \overline{B_{r_1}(0) \times...\times B_{r_n}(0)}$ for some critical set of radii $R\subseteq [0,\infty]^n$.
One can think of $R$ as some hyperbola, for example $R=\{(r_1,r_2) | r_1 r_2=1\}$ is the set of critial radii for $\sum_n (z_1 z_2)^n$. More specifically: The set $A$ of points where the power series converges absolutely is log-convex, that is $L:=\{(\log|z_1|, ..., \log|z_n|) \mid z\in A\}$ is a convex subset of $[-\infty,+\infty)^n$. And the set of critical radii is the boundary of $L$.