Related papers: Central Limit Theorem for Euclidean Minimal Spanni…
In the recent past, there has been a concerted effort to develop mathematical models for real-world networks and to analyze various dynamics on these models. One particular problem of significant importance is to understand the effect of…
In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…
Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and are denoted FMSF (free minimal spanning forest) and WMSF…
We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to…
In this paper, we study the problem of global existence of weak solutions for the quasi-stationary compressible Stokes equations with an anisotropic viscous tensor. The key element of our proof is the control of a particular defect measure…
We consider $N$ Euler-Bernoulli beams and $N$ strings alternatively connected to one another and forming a particular network which is a chain beginning with a string. We study two stabilization problems on the same network and the spectrum…
This study presents a Eulerian theory to elucidate the molecular kinematics in polymer networks and their connection to continuum deformation, grounded in fundamental statistical physics and thermodynamics. Three key innovations are…
This paper is devoted to the study of the stability of limit cycles of a nonlinear delay differential equation with a distributed delay. The equation arises from a model of population dynamics describing the evolution of a pluripotent stem…
A novel approach for non-intrusive uncertainty propagation is proposed. Our approach overcomes the limitation of many traditional methods, such as generalised polynomial chaos methods, which may lack sufficient accuracy when the quantity of…
The main objective of this article is to establish a central limit theorem for additive three-variable functionals of bifurcating Markov chains. We thus extend the central limit theorem under point-wise ergodic conditions studied in…
We consider sequences of needlet random fields defined as weighted averaged forms of spherical Gaussian eigenfunctions. Our main result is a Central Limit Theorem in the high energy setting, for the boundary lengths of their excursion sets.…
We consider a point process sequence induced by a stationary symmetric alpha-stable (0 < alpha < 2) discrete parameter random field. It is easy to prove, following the arguments in the one-dimensional case in Resnick and Samorodnitsky…
In this paper, we study weakly dynamic undirected graphs, that can be used to represent some logistic networks. The goal is to deliver all the delivery points in the network. The network exists in a mostly stable environment, except for a…
We obtain the law of large numbers (LLN) and the central limit theorem (CLT) for weakly dependent non-stationary arrays of random fields with asymptotically unbounded moments. The weak dependence condition for arrays of random fields is…
We investigate the (generalized) Walsh decomposition of point-to-point effective resistances on countable random electric networks with i.i.d. resistances. We show that it is concentrated on low levels, and thus point-to-point effective…
Statistical inference for non-stationary data is hindered by the failure of classical central limit theorems (CLTs), not least because there is no fixed Gaussian limit to converge to. To resolve this, we introduce relative weak convergence,…
The limits of the Second Law of Thermodynamics, which reigns undisputed in the macroscopic world, are investigated at the mesoscopic level, corresponding to spatial dimensions of a few microns. An extremely simple isolated system, modeled…
We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…
In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset $V_{\rm NT}$ of vertices as an internal vertex. This problem, called Minimum Weight Non-Terminal Spanning Tree,…
We consider an infinite, planar, Delaunay graph which is obtained by locally deforming the embedding of a general, isoradial graph, w.r.t. a real deformation parameter $\epsilon$. This entails a careful analysis of edge-flips induced by the…