相关论文: Fixation probability on clique-based graphs
The dynamics of a two-species community of $N$ competing individuals is considered, with an emphasis on the role of environmental variations that affect coherently the fitness of entire populations. The chance of fixation of a mutant…
We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…
We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a…
The Moran process is a classic stochastic process that models the rise and takeover of novel traits in network-structured populations. In biological terms, a set of mutants, each with fitness $m\in(0,\infty)$ invade a population of…
Given a graph $G$ and an integer $\ell\ge 2$, we denote by $\alpha_{\ell}(G)$ the maximum size of a $K_{\ell}$-free subset of vertices in $V(G)$. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree…
It is well known that $n/(n - \mu)$, where $\mu$ is the spectral radius of a graph with $n$ vertices, is a lower bound for the clique number. We conjecture that $\mu$ can be replaced in this bound with $\sqrt{s^+}$, where $s^+$ is the sum…
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
We use a standard Monte-Carlo algorithm to study the slow dynamics of a binary Lennard-Jones glass-forming mixture at low temperature. We find that Monte-Carlo is by far the most efficient way to simulate a stochastic dynamics since…
Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters,…
Evolution occurs in populations of reproducing individuals. In stochastic descriptions of evolutionary dynamics, such as the Moran process, individuals are chosen randomly for birth and for death. If the same type is chosen for both steps,…
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called local clique cover number of G and is…
A simple model of cyclically competing species on a directed graph with quenched disorder is proposed as an extension of the rock-paper-scissors model. By assuming that the effects of loops in a directed random graph can be ignored in the…
The diagrammatic Monte Carlo (Diag-MC) method is a numerical technique which samples the entire diagrammatic series of the Green's function in quantum many-body systems. In this work, we incorporate the flat histogram principle in the…
A random 2-cell embedding of a connected graph $G$ in some orientable surface is obtained by choosing a random local rotation around each vertex. Under this setup, the number of faces or the genus of the corresponding 2-cell embedding…
Finding complete subgraphs in a graph, that is, cliques, is a key problem and has many real-world applications, e.g., finding communities in social networks, clustering gene expression data, modeling ecological niches in food webs, and…
We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…