Related papers: Gelfand-Type problems in Random Walk Spaces

This paper is concerned with power concavity properties of the solution to the parabolic boundary value problem \begin{equation} \tag{$P$} \left\{\begin{array}{ll} \partial_t u=\Delta u +f(x,t,u,\nabla u) &…

Consider two manifolds~$M^m$ and $N^n$ and a first-order Lagrangian $L(u)$ for mappings $u:M\to N$, i.e., $L$ is an expression involving $u$ and its first derivatives whose value is an $m$-form (or more generally, an $m$-density) on~$M$.…

In this paper we are concerned with the number of critical points of solutions of nonlinear elliptic equations. We will deal with the case of non-convex, contractile and non-contractile planar domains. We will prove results on the estimate…

We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike,…

In this paper we prove the existence of at least one positive solution for the nonlocal semipositone problem \[ \displaystyle \left\{\begin{array}{rcll} (-\Delta)_p^s(u) &=& \lambda f(u) \qquad & \text{in} \ \ \Omega \\u &=& 0 & \text{in} \…

In this paper, using the theory developed in [8], we obtain some results of a totally new type about a class of non-local problems. Here is a sample: Let $\Omega\subset {\bf R}^n$ be a smooth bounded domain, with $n\geq 4$, let $a, b,…

In the present paper we investigate the following semilinear singular elliptic problem: \begin{equation*} (\rm P)\qquad \left \{\begin{array}{l} -\Delta u = \dfrac{p(x)}{u^{\alpha}}\quad \text{in} \Omega \\ u = 0\ \text{on} \Omega,\ u>0…

We study exceptional sets of the local time of the continuous-time simple random walk in scaled-up (by $N$) versions $D_N\subseteq \mathbb Z^2$ of bounded open domains $D\subseteq \mathbb R^2$. Upon exit from $D_N$, the walk lands on a…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

We initiate the study of inverse source problems for quasilinear elliptic equations of the form \[ \left\{ \begin{array}{ll} \nabla \cdot (\gamma(x,u,\nabla u) \nabla u) = F & \text{in } \Omega, \\ u = f & \text{on } \partial\Omega,…

We establish new global bifurcation theorems for dynamical systems in terms of local semiflows on complete metric spaces. These theorems are applied to the nonlinear evolution equation $u_t+A u=f_\lambda(u)$ in a Banach space $X$, where $A$…

If a partition $\lambda$ of size n is chosen randomly according to the Plancherel measure $P_n[\lambda] = (\dim \lambda)^2/n!$, then as n goes to infinity, the rescaled shape of $\lambda$ is with high probability very close to a non-random…

In this paper we investigate the existence of solution for the following nonlocal problem with anisotropic Stein-Weiss convolution term $$ -\Delta_{\Phi} u+V(x)\phi(|u|)u=\dfrac{1}{|x|^\alpha}\left(\int_{\mathbb{R}^{N}}…

The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…

We introduce and study level-planar straight-line drawings with a fixed number $\lambda$ of slopes. For proper level graphs, we give an $O(n \log^2 n / \log \log n)$-time algorithm that either finds such a drawing or determines that no such…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…

We prove existence, symmetry and uniqueness of solutions to the fractional Gelfand equation $$ (-\Delta)^s u = e^u \quad \mbox{in $\mathbb{R}$} \quad \mbox{with} \quad \int_{\mathbb{R}} e^u dx < +\infty $$ for all exponents $s \in…