Related papers: Nontrivial edge coupling from a Dirichlet network …

This works deals with one dimensional infinite perturbation - namely line defects - in periodic media. In optics, such defects are created to construct an (open) waveguide that concentrates light. The existence and the computation of the…

Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

In a topological semimetal with Dirac or Weyl points, the bulk edge correspondence principle predicts a gapless edge mode if the essential symmetry is still preserved at the surface. The detection of such topological surface state has been…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We consider on a spin manifold with boundary a Dirac operator $D_A$ with chiral boundary conditions, twisted by a unitary connection $A$. When $m$ is not in the chiral spectrum of $D_A$, we define an analogue of the Dirichlet-to-Neumann map…

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

We consider the Dirichlet Laplacian in a domain two three-dimensional parallel layers having common boundary and coupled by a window. The window produces the bound states below the essential spectrum; we obtain two-sided estimates for them.…

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that…

The cyclic edge-connectivity of a graph $G$ is the least $k$ such that there exists a set of $k$ edges whose removal disconnects $G$ into components where every component contains a cycle. We show that for graphs of minimum degree at least…

We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…

Depinning of an interface from a random self--affine substrate with roughness exponent $\zeta_S$ is studied in systems with short--range interactions. In 2$D$ transfer matrix results show that for $\zeta_S<1/2$ depinning falls in the…

Studies of models of current flow behaviour in Electrical Impedance Tomography (EIT) have shown that the current density distribution varies extremely rapidly near the edge of the electrodes used in the technique. This behaviour imposes…

We explain how (perturbed) boundary conformal field theory allows us to understand the tunneling of edge quasiparticles in non-Abelian topological states. The coupling between a bulk non-Abelian quasiparticle and the edge is due to resonant…

We prove certain mixed-norm Strichartz estimates on manifolds with boundary. Using them we are able to prove new results for the critical and subcritical wave equation in 4-dimensions with Dirichlet or Neumann boundary conditions. We obtain…

We study the symmetry properties of limit profiles of nonautonomous nonlinear parabolic systems with Dirichlet boundary conditions in radial bounded domains. In the case of competitive systems, we show that if the initial profiles satisfy a…

We propose an alternative condition for the solvability of the Dirichlet problem for the minimal surface equation that applies to non-mean convex domains. We introduce a structural condition, obtained from a second-order ordinary…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…

We consider the Bernoulli bond percolation model in a box $\Lambda$ (not necessarily parallel to the directions of the lattice) in the regime where the percolation parameter is close to $1$. We condition the configuration on the event that…