Related papers: Outermost boundaries for star-connected components…
For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…
The high-density plaquette percolation model in d dimensions contains a surface that is homeomorphic to the (d-1)-sphere and encloses the origin. This is proved by a path-counting argument in a dual model. When d=3, this permits an improved…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
We calculate the phase diagram of a model for topological superconducting wires with local s-wave pairing, spin-orbit coupling $\vec{\lambda}$ and magnetic field $\vec{B}$ with arbitrary orientations. This model is a generalized lattice…
We investigate the stability of helical superfluid phase in a spin-orbit coupled Fermi gas loaded in a bilayer optical lattice. The phase diagram of the system is constructed in the mean field framework. We investigate the topological…
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-\epsilon) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i}…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…
The Birkhoff graph $\mathcal{B}_n$ is the Cayley graph of the symmetric group $S_n$, where two permutations are adjacent if they differ by a single cycle. Our main result is a tighter upper bound on the independence number…
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…
The principle existence theorem (i.e. Theorem 1) of "Existence and Behavior of the Radial Limits of a Bounded Capillary Surface at a Corner" (Pacific J. Math. Vol. 176, No. 1 (1996), 165-194) is extended to the case of a contact angle…
We give a recursive formula, expressed in terms of the characteristic tuples, for the Betti numbers of the boundary of the Milnor fiber of an irreducible quasi-ordinary surface. The singular locus of the surface consists of two components,…
We study transport across a line junction lying between two orthogonal topological insulator surfaces and a superconductor which can have either s-wave (spin-singlet) or p-wave (spin-triplet) pairing symmetry. We present a formalism for…
As nature junction geometry of the d-wave cuprate superconductor/insulator/the mixture of s-wave and d-wave cuprate superconductor, the upmost surface junction of intrinsic Josephson junction stack fabricated on…
A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…
We consider bond percolation on high-dimensional product graphs $G=\square_{i=1}^tG^{(i)}$, where $\square$ denotes the Cartesian product. We call the $G^{(i)}$ the base graphs and the product graph $G$ the host graph. Very recently, Lichev…
The unitary Cayley graph $C_R$ of a finite unital ring $R$ is the simple graph with vertex set $R$ in which two elements $x$ and $y$ are connected by an edge if and only if $x-y$ is a unit of $R$. We characterize the unitary Cayley graph…
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is…
Topological crystalline insulators (TCIs) are classified by topological invariants defined with respect to the crystalline symmetries of their gapped bulk. The bulk-boundary correspondence then links the topological properties of the bulk…
A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…