相关论文: On explicit random-like tournaments

The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…

We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known "circle design"…

Almost-complex and hyper-complex manifolds are considered in this paper from the point of view of complex analysis and potential theory. The idea of holomorphic coordinates on an almost-complex manifold $(M,\mathbf{J}%)$ is suggested by D.…

The existing periodic orbit theory of spectral correlations for classically chaotic systems relies on the Riemann-Siegel-like representation of the spectral determinants which is still largely hypothetical. We suggest a simpler derivation…

The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…

We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…

We investigate a smoothing property for strongly-continuous operator semigroups, akin to ultracontractivity in parabolic evolution equations. Specifically, we establish the stability of this property under certain relatively bounded…

Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achieve a reachability objective in $n$ games (on the same finite arena) simultaneously by broadcasting actions, and where the opponent has full…

A tournament is an orientation of a complete graph. We say that a vertex $x$ in a tournament $\vec T$ controls another vertex $y$ if there exists a directed path of length at most two from $x$ to $y$. A vertex is called a king if it…

We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…

An informal and elementary introduction to probability scoring and forecast verification and improvement, slightly extended from Significance 22:3(2025)16, which might be useful for less mathematical readers as a prologue to the classic…

We generalise Ehrhard and Regnier's Taylor expansion from pure to probabilistic $\lambda$-terms through notions of probabilistic resource terms and explicit Taylor expansion. We prove that the Taylor expansion is adequate when seen as a way…

In this article we take a probabilistic look at H\"older's inequality, considering the ratio of terms in the classical H\"older inequality for random vectors in $\mathbb{R}^n$. We prove a central limit theorem for this ratio, which then…

Ahlfors and Gehring asked for the Riemann Mapping Theorem for quasiconformal mappings (QC) of R^3. We summarise our solution: (a) QC reflections are tame (b) T is the fixed set of a QC reflection iff T is a uniform sphere (i.e. the limits…

In this paper we have used one 2 variable Boolean function called Rule 6 to define another beautiful transformation named as Extended Rule-6. Using this function we have explored the algebraic beauties and its application to an efficient…

We discuss a model of a $N$-person, non-cooperative stochastic game, inspired by the discrete version of the red-and-black gambling problem introduced by Dubins and Savage in 1965. Our main theorem generalizes a result of Pontiggia from…