Related papers: Nodal intersections of random eigenfunctions again…
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our…
We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…
We present a notion of a random toric surface modeled on a notion of a random graph. We then study some threshold phenomena related to the smoothness of the resulting surfaces.
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
Many classical objects on a surface S can be interpreted as cross-ratio functions on the circle at infinity of the universal covering. This includes closed curves considered up to homotopy, metrics of negative curvature considered up to…
We study rotational surfaces in Euclidean 3-space whose Gauss curvature is given as a prescribed function of its Gauss map. By means of a phase plane analysis and under mild assumptions on the prescribed function, we generalize the…
We consider the nodal domains of Gaussian random waves in two dimensions. We present a method to calculate the distribution of the number of nodal domains and the average connectivity with the help of auxiliary Potts-spins. An analytical…
This paper is concerned with the location of nodal sets of eigenfunctions of the Dirichlet Laplacian in thin tubular neighbourhoods of hypersurfaces of the Euclidean space of arbitrary dimension. In the limit when the radius of the…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
We study the nodal curves of low energy Dirichlet eigenfunctions in generalized curvilinear quadrilaterals. The techniques can be seen as a generalization of the tools developed by Grieser-Jerison in a series of works on convex planar…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
We address the problem of bounding from below the self-intersection of integral curves on the projective plane blown-up at general points. In particular, by applying classical deformation theory we obtain the expected bound in the case of…
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…
We continue our investigation into intersections of closed paths on a torus, to further our understanding of the commutator algebra of Wilson loop observables in 2+1 quantum gravity, when the cosmological constant is negative. We give a…
The idea of a finite collection of closed sets having "strongly regular intersection" at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically,…
In this paper we derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the uniform multicommodity flow problem under random walk routing. We show the mean load is linearly dependent on the nodal…
Rudnick and Wigman (Ann. Henri Poincar\'{e}, 2008; arXiv:math-ph/0702081) conjectured that the variance of the volume of the nodal set of arithmetic random waves on the $d$-dimensional torus is $O(E/\mathcal{N})$, as $E\to\infty$, where $E$…
We study Gauss curvature for random Riemannian metrics on a compact surface, lying in a fixed conformal class; our questions are motivated by comparison geometry. Next, analogous questions are considered for the scalar curvature in…