Related papers: Central limit theorems for patterns in multiset pe…
An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar graphs. We connect this problem to the theory of permutation…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
We provide a simple proof for of the central limit theorem for the number of vertices in the giant for super-critical stochastic block model using the breadth-first walk of Konarovskyi, Limic and the author (2024). Our approach follows the…
Recently, Ishiwata, Kawabi and Kotani [2] proved two kinds of central limit theorems for non-symmetric random walks on crystal lattices from the view point of discrete geometric analysis. In the present paper, we obtain yet another kind of…
We consider the adjacency matrix $A$ of a large random graph and study fluctuations of the function $f_n(z,u)=\frac{1}{n}\sum_{k=1}^n\exp\{-uG_{kk}(z)\}$ with $G(z)=(z-iA)^{-1}$. We prove that the moments of fluctuations normalized by…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…
We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…
We establish a central limit theorem (CLT) for families of products of $\epsilon$-independent random variables. We utilize graphon limits to encode the evolution of independence and characterize the limiting distribution. Our framework…
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…
In a recent paper [15], Giardin{\`a}, Giberti, Hofstad, Prioriello have proved a law of large number and a central limit theorem with respect to the annealed measure for the magnetization of the Ising model on some random graphs including…
Motivated by second order asymptotic results, we characterize the convergence in law of double integrals, with respect to Poisson random measures, toward a standard Gaussian distribution. Our conditions are expressed in terms of…
The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…
In this dissertation, we show that the Central Limit Theorem and the Invariance Principle for Discrete Fourier Transforms discovered by Peligrad and Wu can be extended to the quenched setting. We show that the random normalization…
In this paper, we establish a central limit theorem for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem generalizes and…
In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…
We prove a central limit theorem for stationary multiple (random) fields of martingale differences $f\circ T_{\underline{i}}$, $\underline{i}\in \Bbb Z^d$, where $T_{\underline{i}}$ is a $\Bbb Z^d$ action. In most cases the multiple…