相关论文: Large deviation principles for empirical measures …
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
For a proper vertex coloring $c$ of a graph $G$, let $\varphi_c(G)$ denote the maximum, over all induced subgraphs $H$ of $G$, the difference between the chromatic number $\chi(H)$ and the number of colors used by $c$ to color $H$. We…
In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a graph is at most $k$ if it has a fractional coloring in…
An edge-coloring of a graph $G$ with colors $1,\ldots,t$ is an \emph{interval $t$-coloring} if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an integer interval. It is well-known that…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
We establish the large deviation principle for a topological Markov shift over infinite alphabet which satisfies strong combinatorial assumptions called ``finite irreducibility'' or ``finite primitiveness''. More precisely, we assume the…
The aim of the paper is to establish a large deviation principle (LDP) for the empirical measure of mean-field interacting diffusions in a random environment. The point is to derive such a result once the environment has been frozen…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
The article obtains large deviation asymptotic for sub-critical communication networks modelled as signal-interference-noise-ratio(SINR) random networks. To achieve this, we define the empirical power measure and the empirical connectivity…
We prove a Large Deviation Principle for the random spec- tral measure associated to the pair $(H_N; e)$ where $H_N$ is sampled in the GUE(N) and e is a fixed unit vector (and more generally in the $\beta$- extension of this model). The…
One-dimensional run-and-tumble processes may converge towards some localized non-equilibrium steady state when the two velocities and/or the two switching rates are space-dependent. A long dynamical trajectory can be then analyzed via the…
The theory of stochastic approximations form the theoretical foundation for studying convergence properties of many popular recursive learning algorithms in statistics, machine learning and statistical physics. Large deviations for…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
We prove a Large Deviation Principle for {\color{blue} jump-Markov } Processes on sparse large disordered network with disordered connectivity. The network is embedded in a geometric space, with the probability of a connection a (scaled)…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
We consider two graph colouring problems in which edges at distance at most $t$ are given distinct colours, for some fixed positive integer $t$. We obtain two upper bounds for the distance-$t$ chromatic index, the least number of colours…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
We study a system of N particles with logarithmic, Coulomb or Riesz pairwise interactions, confined by an external potential. We examine a microscopic quantity, the tagged empirical field, for which we prove a large deviation principle at…
The manifold of empirical mean values of statistical data ad infinitum has a geometric shape that depends on the probability measure that governs the generating model. Large deviation theory produces entropy functions that depend on both…