Related papers: A Stationary Planar Random Graph with Singular Sta…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…
Domain walls of a discrete model of an anisotropic ferromagnet are studied. They can be described by sequences of two reversible mappings. Competition between the length scale of spatial structures and the lattice constant leads to a rich…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…
Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…
We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
The knowledge of transitions between regular, laminar or chaotic behavior is essential to understand the underlying mechanisms behind complex systems. While several linear approaches are often insufficient to describe such processes, there…
We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmueller distance for random walks…
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
The conventional duality analysis is employed to identify a location of a critical point on a uniform lattice without any disorder in its structure. In the present study, we deal with the random planar lattice, which consists of the…
The planar-diagrammatic technique of large-$N$ random matrices is extended to evaluate averages over the circular ensemble of unitary matrices. It is then applied to study transport through a disordered metallic ``grain'', attached through…
We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or delta type) boundary conditions with continuous wavefunctions, we investigate two…
We demonstrate the phenomenon of stochastic resonance (SR) for discrete-time dynamical systems. We investigate various systems that are not necessarily bistable, but do have two well defined states, switching between which is aided by…
We prove partial regularity of weakly stationary harmonic maps with (partially) free boundary data on manifolds where the domain metric may degenerate or become singular along the free boundary at the rate $d^\alpha$ for the distance…
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…