Related papers: Gelfand-Type problems in Random Walk Spaces

We prove the local and global existence of solutions of the generalized micro-electromechanical system (MEMS) equation $u_t =\Delta u+\lambda f(x)/g(u)$, $u<1$, in $\Omega\times (0,\infty)$, $u(x,t)=0$ on $\partial\Omega\times (0,\infty)$,…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

We consider nonlinear second order elliptic problems of the type \[ -\Delta u=f(u) \text{ in } \Omega, \qquad u=0 \text{ on } \partial \Omega, \] where $\Omega$ is an open $C^{1,1}$-domain in $\mathbb{R}^N$, $N\geq 2$, under some general…

In the present work, we consider existence and multiplicity of positive solutions for nonlocal elliptic problems driven by the Stein-Weiss problem with concave-convex nonlinearities defined in the whole space $\mathbb{R}^N$. More precisely,…

We examine the elliptic system given by \begin{eqnarray*} \qquad \left\{ \begin{array}{lcl} -\Delta u =\lambda f(v) \quad \mbox{ in } \Omega -\Delta v =\gamma f(u) \quad \mbox{ in } \Omega, u=v =0, \quad \mbox{ on } \pOm \end{array}\right.…

In this paper, we study the existence and multiplicity of solutions for the following fractional problem involving the Hardy potential and concave-convex nonlinearities: $$({-}{ \Delta})^{\frac{\alpha}{2}}u- \gamma \frac{u}{|x|^{\alpha}}=…

Here is one of the results obtained in this paper: Let $\Omega\subset {\bf R}^n$ be a smooth bounded domain, let $q>1$, with $q<{{n+2}\over {n-2}}$ if $n\geq 3$ and let $\lambda_1$ be the first eigenvalue of the problem $$\cases{-\Delta…

We give necessary and sufficient conditions for the existence of weak solutions to the model equation $$-\Delta_p u=\sigma \, u^q \quad \text{on} \, \, \, \R^n,$$ in the case $0<q<p-1$, where $\sigma\ge 0$ is an arbitrary locally integrable…

In this paper we consider the following problem $$\begin{cases} -\Delta_{g}u+V(x)u=\lambda\alpha(x)f(u), & \mbox{in }M\\ u\geq0, & \mbox{in }M\\ u\to0, & \mbox{as }d_{g}(x_{0},x)\to\infty \end{cases}$$where $(M,g)$ is a $N$-dimensional…

We give a survey of nonlinear potential estimates and their applications obtained recently for positive solutions to sublinear problems of the type \[ u = \mathbf{G}(\sigma u^q) + f \quad \textrm{in} \,\, \Omega, \] where $0 < q < 1$,…

Suppose that $G=(V, E)$ is a finite graph with the vertex set $V$ and the edge set $E$. Let $\Delta$ be the usual graph Laplacian. Consider the following nonlinear Schr$\ddot{o}$dinger type equation of the form $$ \left \{…

We study the branch of semi-stable and unstable solutions (i.e., those whose Morse index is at most one) of the Dirichlet boundary value problem $-\Delta u=\frac{\lambda f(x)}{(1-u)^2}$ on a bounded domain $\Omega \subset \R^N$, which…

We consider the following singularly perturbed elliptic problem $$ \varepsilon^2\triangle\tilde{u}-\tilde{u}+\tilde{u}^p=0, \ \tilde{u}>0\quad \mbox{in} \ \Omega,\ \ \ \frac{\partial\tilde{u}}{\partial \mathbf{n}}=0 \quad \mbox{on}\…

Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…

Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…

Let $\Omega$ be an open, simply connected, and bounded region in $\mathbb{R}^{d}$, $d\geq2$, and assume its boundary $\partial\Omega$ is smooth. Consider solving the eigenvalue problem $Lu=\lambda u$ for an elliptic partial differential…

Let $\Omega:=\left( a,b\right) \subset\mathbb{R}$, $m\in L^{1}\left( \Omega\right) $ and $\lambda>0$ be a real parameter. Let $\mathcal{L}$ be the differential operator given by $\mathcal{L}u:=-\phi\left( u^{\prime}\right) ^{\prime}+r\left(…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…