On a random graph evolving by degrees
نویسندگان
چکیده
منابع مشابه
on bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
متن کاملNear-critical SIR epidemic on a random graph with given degrees
Emergence of new diseases and elimination of existing diseases is a key public health issue. In mathematical models of epidemics, such phenomena involve the process of infections and recoveries passing through a critical threshold where the basic reproductive ratio is 1. In this paper, we study near-critical behaviour in the context of a susceptible-infective-recovered epidemic on a random (mul...
متن کاملLaw of large numbers for the SIR epidemic on a random graph with given degrees
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant rate. Suppose that initially there are only a few infective vertices. We prove there is a threshold for a parameter involving the rates and vertex degrees be...
متن کاملEvolving Graphs by Graph Programming
Rule-based graph programming is a deep and rich topic. We present an approach to exploiting the power of graph programming as a representation and as an execution medium in an evolutionary algorithm (EGGP). We demonstrate this power in comparison with Cartesian Genetic Programming (CGP), showing that it is significantly more efficient in terms of fitness evaluations on some classic benchmark pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2010
ISSN: 0001-8708
DOI: 10.1016/j.aim.2009.08.015