Related papers: Parametric and nonparametric symmetries in graphic…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
We generalize a framework of list colouring results to correspondence colouring. Correspondence colouring is a generalization of list colouring wherein we localize the meaning of the colours available to each vertex. As pointed out by…
In this paper we show that every graph $G$ of bounded maximum average degree ${\rm mad}(G)$ and with maximum degree $\Delta$ can be edge-colored using the optimal number of $\Delta$ colors in quasilinear time, whenever $\Delta\ge 2{\rm…
In several different fields, there is interest in analyzing the upper or lower tail quantile of the underlying distribution rather than mean or center quantile. However, the investigation of the tail quantile is difficult because of data…
Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erd{\H o}s--Ko--Rado theorem. On the other hand, P.~Erd{\H o}s and L.~Lov{\'a}sz in the noted paper~\cite{EL} posed problems on…
We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent tau in (2,3). In this model two colors spread with a fixed but not…
In the Maximum-size Properly Colored Forest problem, we are given an edge-colored undirected graph and the goal is to find a properly colored forest with as many edges as possible. We study this problem within a broader framework by…
In this paper, we study several coloring problems on graphs from the viewpoint of parameterized complexity. We show that Precoloring Extension is fixed-parameter tractable (FPT) parameterized by distance to clique and Equitable Coloring is…
We present a semidefinite programming approach to bound the measures of cross-independent pairs in a bipartite graph. This can be viewed as a far-reaching extension of Hoffman's ratio bound on the independence number of a graph. As an…
Recent methods for estimating sparse undirected graphs for real-valued data in high dimensional problems rely heavily on the assumption of normality. We show how to use a semiparametric Gaussian copula--or "nonparanormal"--for high…
Max-stable processes are widely used to model spatial extremes. These processes exhibit asymptotic dependence meaning that the large values of the process can occur simultaneously over space. Recently, inverted max-stable processes have…
A new methodology for model determination in decomposable graphical Gaussian models is developed. The Bayesian paradigm is used and, for each given graph, a hyper inverse Wishart prior distribution on the covariance matrix is considered.…
This paper presents a new model for characterising temporal dependence in exceedances above a threshold. The model is based on the class of trawl processes, which are stationary, infinitely divisible stochastic processes. The model for…
Predicting extreme events in nonlinear dynamical systems is challenging due to a limited understanding of their statistical properties. This study numerically and theoretically investigates the statistical properties of infinite-modal maps…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
The tail of a bivariate distribution function in the domain of attraction of a bivariate extreme-value distribution may be approximated by the one of its extreme-value attractor. The extreme-value attractor has margins that belong to a…
Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph…
Numerous approaches are proposed in the literature for non-stationarity marginal extreme value inference, including different model parameterisations with respect to covariate, and different inference schemes. The objective of this article…
The generalized Pareto distribution (GPD) is a fundamental model for analyzing the tail behavior of a distribution. In particular, the shape parameter of the GPD characterizes the extremal properties of the distribution. As described in…