Related papers: Moment Calculus on Ramsey Graph
We discuss a connection between two areas of mathematics which until recently seemed to be rather distant from each other: (1) noncommutative harmonic analysis on groups and (2) some topics in probability theory related to random point…
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite graph. We use this connection to describe and analyse a…
The $\phi$-divergence-based moment method was recently introduced Abdelmalik et al. (2023) for the discretization of the radiative transfer equation. At the continuous level, this method is very close to the entropy-based MN methods and…
In computational and applied statistics, it is of great interest to get fast and accurate calculation for the distributions of the quadratic forms of Gaussian random variables. This paper presents a novel approximation strategy that…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In…
Given a graph $H$, the $k$-colored Gallai Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum integer $n$ such that every $k$-coloring of the edges of the complete graph on $n$ vertices contains either a rainbow triangle or a…
For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning…
The $q$-color Ramsey number of a $k$-uniform hypergraph $H$ is the minimum integer $N$ such that any $q$-coloring of the complete $k$-uniform hypergraph on $N$ vertices contains a monochromatic copy of $H$. The study of these numbers is one…
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…
This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph…
Random graphs are matrices with independent 0, 1 elements with probabilities determined by a small number of parameters. One of the oldest model is the Rasch model where the odds are ratios of positive numbers scaling the rows and columns.…
In this paper, the authors design a trial to count rational ratios on the interval [0, 1], and plot a normalized frequency statistical graph. Patterns, symmetry and co-linear properties reflected in the graph are confirmed. The main…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of those working in Reverse Mathematics to take…
This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions…
Known results on the moments of the distribution generated by the two-locus Wright-Fisher diffusion model and a duality between the diffusion process and the ancestral process with recombination are briefly summarized. A numerical methods…
We consider a fractional counting process with jumps of amplitude $1,2,\ldots,k$, with $k\in \mathbb{N}$, whose probabilities satisfy a suitable system of fractional difference-differential equations. We obtain the moment generating…
Our physical world is constantly evolving over time, rendering challenges for pre-trained language models to understand and reason over the temporal contexts of texts. Existing work focuses on strengthening the direct association between a…
The purpose of this paper is to design an algorithm for the computation of the counterparty risk which is competitive in regards of a brute force "Monte-Carlo of Monte-Carlo" method (with nested simulations). This is achieved using marked…