Related papers: Nonlocal minimal graphs in the plane are generical…
Van der Waals heterostructures display a rich variety of unique electronic properties. To identify novel transport mechanisms, nonlocal measurements have been widely used, wherein a voltage is measured at contacts placed far away from the…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…
In this article we prove semiglobal stabilization and exact controllability results for nonlinear plate equations with hinged boundary conditions and analytic nonlinearity. These results hold when the damping or control is localized in a…
We investigate the behavior of non-Euclidean plates with constant negative Gaussian curvature using the F\"oppl-von K\'arm\'an reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic…
The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…
We investigate existence and regularity properties of one-phase free boundary graphs, in connection with the question of whether there exists a complete non-planar free boundary graph in high dimensions.
In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian operator with homogeneous Neumann boundary conditions on inhomogeneous random convergent graph sequences. More precisely, for networks…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
We develop a functional analytic approach for the study of nonlocal minimal graphs. Through this, we establish existence and uniqueness results, a priori estimates, comparison principles, rearrangement inequalities, and the equivalence of…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…
The main goal in distributed symmetry-breaking is to understand the locality of problems; i.e., the radius of the neighborhood that a node needs to explore in order to arrive at its part of a global solution. In this work, we study the…