相关论文: Non-uniform Kahn-Kalai, spread, variants, and appl…

Fourier methods are fundamental tools to analyze random fields. Statistical structures of homogeneous Gaussian random fields are completely characterized by the power spectrum. In non-Gaussian random fields, polyspectra, higher-order…

We use $KKM$ theorem to prove the existence of a new fixed point theorem for non-expansive mapping:Let M be a bounded closed convex subset of Hilbert space H, and $A:M\rightarrow M$ be a non-expansive mapping, then exists a fixed point of A…

This note shows how to considerably strengthen the usual mode of convergence of an $n$-particle system to its McKean-Vlasov limit, often known as propagation of chaos, when the volatility coefficient is nondegenerate and involves no…

We analyze the spectral properties of the high-dimensional random geometric graph $G(n, d, p)$, formed by sampling $n$ i.i.d vectors $\{v_i\}_{i=1}^{n}$ uniformly on a $d$-dimensional unit sphere and connecting each pair $\{i,j\}$ whenever…

In this paper, we study Dirac-type theorems for an inhomogenous random graph (G) whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in…

The coupled entropy, $H_\kappa,$ is proven to uniquely satisfy the requirement that a generalized entropy be a measure of the uncertainty at the scale, $\sigma,$ for a class of non-exponential distributions. The coupled stretched…

We introduce a new framework for contextuality based on simplicial sets, combinatorial models of topological spaces that play a prominent role in modern homotopy theory. Our approach extends measurement scenarios to consist of spaces…

Combining the results of [14] and [10], the trend to equilibrium in large time is studied for a large particle system associated to a Vlasov-Fokker-Planck equation. Under some conditions (that allow non-convex confining potentials) the…

We investigate the structure of invariant distributions on a non-isotropic non-Riemannian symmetric space of rank one. Especially, the $J$-criterion related to the generalized Gelfand pair is shown for this space without imposing the…

Consider $d$ dependent change point tests, each based on a CUSUM-statistic. We provide an asymptotic theory that allows us to deal with the maximum over all test statistics as both the sample size $n$ and $d$ tend to infinity. We achieve…

In this paper we present a surprisingly general extension of the main result of a paper that appeared in this journal: I. Montes et al., Sklar's theorem in an imprecise setting, Fuzzy Sets and Systems, 278 (2015), 48--66. The main tools we…

In this work, we define the notion of unimodular random measured metric spaces as a common generalization of various other notions. This includes the discrete cases like unimodular graphs and stationary point processes, as well as the…

\cite{tsagris2025a} proposed the generalized circular projected Cauchy (GCPC) distribution, whose special case is the wrapped Cauchy distribution. In this paper we first derive the relationship with the wrapped Cauchy distribution, and then…

In this article we address the problem of the nonlinear interaction of subdiffusive particles. We introduce the random walk model in which statistical characteristics of a random walker such as escape rate and jump distribution depend on…

We study 1-Wasserstein propagation of chaos for "McKean-type" nonlinear Markov chains and their associated interacting particle systems. This paper is organized into two parts: the first part combines arguments from various areas of…

We provide necessary and sufficient conditions for the uniqueness of the k-means set of a probability distribution. This uniqueness problem is related to the choice of k: depending on the underlying distribution, some values of this…

We present an algorithm to identify sparse dependence structure in continuous and non-Gaussian probability distributions, given a corresponding set of data. The conditional independence structure of an arbitrary distribution can be…

The Harary-Sachs theorem for $k$-uniform hypergraphs equates the codegree-$d$ coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with $d$…

We study the model of the totally asymmetric exclusion process with generalized update, which compared to the usual totally asymmetric exclusion process, has an additional parameter enhancing clustering of particles. We derive the exact…

In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2,…