International audienceWe analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the inhomogeneous graph model of Söderberg (2002). We investigate the sum of the weights of those graphs and their structure. Those results allow us to give a new proof in a more general setting of a theorem of Wright (1972) on the enumeration of properly colored graphs. We also discuss applications related to social networksNous étudions un modèle de graphes pondérés, introduits par de Panafieu et Ravelomanana (2014) et proche des graphes inhomogènes de Söderberg (2002). Nous analysons la somme des poids de ces graphes et leur structure. Ces résultats nous permettent d’obtenir une nouvelle preuve d’un théor...
Triangle-Dense Graphs ” [1]. The motivation of the paper is to develop a theory of algorithms for so...
The rapid emergence of social networks, their major impact on today's society, and the recent access...
One of the main characteristics of real-world networks is their large clustering. Clustering is one ...
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous r...
In order to understand how the network structure impacts the underlying dynamics, we seek an assortm...
Graphs are ubiquitous. They spawn from domains such as the world wide web, social networks, biologic...
AbstractWe enumerate weighted simple graphs with a natural upper bound condition on the sum of the w...
Accepted at MARAMI 2015We propose two models of growing network based on the formation of cliques. T...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
peer-reviewedWe present an analytical approach to determining the expected cascade size in a broad r...
Many real-world networks were found to be highly clustered, and contain a large amount of small cliq...
International audienceWe study the complexity of the problem of enumerating all graphs with frequenc...
We develop a new set of random graph models. The motivation for these mod- els comes from social ne...
Relational data are ubiquitous in the nature and their accessibility has not ceased to increase in r...
AbstractAs the extension of the previous work by Ciucu and the present authors [M. Ciucu, W.G. Yan, ...
Triangle-Dense Graphs ” [1]. The motivation of the paper is to develop a theory of algorithms for so...
The rapid emergence of social networks, their major impact on today's society, and the recent access...
One of the main characteristics of real-world networks is their large clustering. Clustering is one ...
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous r...
In order to understand how the network structure impacts the underlying dynamics, we seek an assortm...
Graphs are ubiquitous. They spawn from domains such as the world wide web, social networks, biologic...
AbstractWe enumerate weighted simple graphs with a natural upper bound condition on the sum of the w...
Accepted at MARAMI 2015We propose two models of growing network based on the formation of cliques. T...
International audienceWe enumerate the connected graphs that contain a linear number of edges with r...
peer-reviewedWe present an analytical approach to determining the expected cascade size in a broad r...
Many real-world networks were found to be highly clustered, and contain a large amount of small cliq...
International audienceWe study the complexity of the problem of enumerating all graphs with frequenc...
We develop a new set of random graph models. The motivation for these mod- els comes from social ne...
Relational data are ubiquitous in the nature and their accessibility has not ceased to increase in r...
AbstractAs the extension of the previous work by Ciucu and the present authors [M. Ciucu, W.G. Yan, ...
Triangle-Dense Graphs ” [1]. The motivation of the paper is to develop a theory of algorithms for so...
The rapid emergence of social networks, their major impact on today's society, and the recent access...
One of the main characteristics of real-world networks is their large clustering. Clustering is one ...