Related papers: Asymptotic distribution of nodal intersections for…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…
A detailed investigation is presented of a simple unidirectional finite-energy solution of the 3D wave equation. Its asymptotics as a spatial point runs to infinity with the wave propagations speed is a standard spherical wave as z < 0,…
We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…
Dynamical systems with $\epsilon$ small random perturbations appear in both continuous mechanical motions and discrete stochastic chemical kinetics. The present work provides a detailed analysis of the central limit theorem (CLT), with a…
The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
We test M. Berry's ansatz on nodal deficiency in presence of boundary. The square billiard is studied, where the high spectral degeneracies allow for the introduction of a Gaussian ensemble of random Laplace eigenfunctions…
It was recently remarked by Lutz [{\it Phys. Rev. A} {\bf 67} (2003), 051402(R)] that the equation for the marginal Wigner distribution in an optical lattice admits a scale-free distribution corresponding to Tsallis statistics. Here we show…
The tangled nodal lines (wave vortices) in random, three-dimensional wavefields are studied as an exemplar of a fractal loop soup. Their statistics are a three-dimensional counterpart to the characteristic random behaviour of nodal domains…
We investigate the effects of non-commutative geometry on the topological aspects of gauge theory using a non-perturbative formulation based on the twisted reduced model. The configuration space is decomposed into topological sectors…
We consider a numerical approach for a covariant generalised Navier-Stokes equation on general surfaces and study the influence of varying Gaussian curvature on anomalous vortex-network active turbulence. This regime is characterised by…
We investigate the joint distribution of nodes of small degrees and the degree profile in preferential dynamic attachment circuits. In particular, we study the joint asymptotic distribution of the number of the nodes of outdegree $0$…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…