相关论文: Weighted Persistent Homology Sums of Random \v{C}e…

Let $(X_{n,t})_{t=1}^{\infty}$ be a stationary absolutely regular sequence of real random variables with the distribution dependent on the number~$n$. The paper presents sufficient conditions for the asymptotic normality (for $n\to\infty$…

Let $n$ be a sufficiently large natural number and let $B$ be an origin-symmetric convex body in $R^n$ in the $\ell$-position, and such that the normed space $(R^n,\|\cdot\|_B)$ admits a $1$-unconditional basis. Then for any…

Weighting methods are widely used to adjust for covariates in observational studies, sample surveys, and regression settings. In this paper, we study a class of recently proposed weighting methods which find the weights of minimum…

Assemblies of anisotropic particles commonly appear in studies of active many-body systems. However, in two dimensions, the geometric ramifications of the finite density of such objects are not entirely understood. To fully characterize…

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

Let X_R be the zero locus in RP^n of one or two independently and Weyl distributed random real quadratic forms (this is the same as requiring that the corresponding symmetric matrices are in the Gaussian Orthogonal Ensemble). We prove that…

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…

Our main aim is to apply the theory of regularly varying functions to the asymptotical analysis at infinity of solutions of Friedmann cosmological equations. A new constant $\Gamma$ is introduced related to the Friedmann cosmological…

We prove that smooth Wigner-Weyl spectral sums at an energy level $E$ exhibit Airy scaling asymptotics across the classical energy surface $\Sigma_E$. This was proved earlier by the authors for the isotropic harmonic oscillator and the…

Cosmology based on large scale peculiar velocity preferes volume weighted velocity statistics. However, measuring the volume weighted velocity statistics from inhomogeneously distributed galaxies (simulation particles/halos) suffer from an…

We investigate the homology of an unbounded noisy sample on $\mathbb{R}^d$, under various assumptions on the sampling density. This investigation is based on previous results by Adler, Bobrowski, and Weinberger (\cite{crackle}), and Owada…

We study the attenuation of long-wavelength shear sound waves propagating through model jammed packings of frictionless soft spheres interacting with repulsive springs. The elastic attenuation coefficient, $\alpha(\omega)$, of transverse…

For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…

We study the minimum spanning arborescence problem on the complete digraph $\vec{K}_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent uniform random variable $U^\alpha$ where $\alpha\leq 1$ and $U$ is…

The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…

In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…

For a bivariate $P(x,y) \in \mathbb{R}[x,y]\setminus (\mathbb{R}[x] \cup \mathbb{R}[y])$, our first result shows that for all finite $A \subseteq \mathbb{R}$, $|P(A,A)|\geq \alpha|A|^{5/4}$ with $\alpha =\alpha(\mathrm{deg} P) \in…