Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Community detection and stochastic block models: recent developments
The stochastic block model (SBM) is a random graph model with planted clusters. It is widely
employed as a canonical model to study clustering and community detection, and provides …
employed as a canonical model to study clustering and community detection, and provides …
[ספר][B] Introduction to random graphs
A Frieze, M Karoński - 2015 - books.google.com
From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …
complex interactions between proteins in the cells of our bodies, we constantly face the …
[ספר][B] Analysis of boolean functions
R O'Donnell - 2014 - books.google.com
Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …
science. They also arise in other areas of mathematics, including combinatorics, statistical …
[ספר][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Algorithmic barriers from phase transitions
For many random constraint satisfaction problems, by now there exist asymptotically tight
estimates of the largest constraint density for which solutions exist. At the same time, for …
estimates of the largest constraint density for which solutions exist. At the same time, for …
Optimality and sub-optimality of PCA I: Spiked random matrix models
A central problem of random matrix theory is to understand the eigenvalues of spiked
random matrix models, introduced by Johnstone, in which a prominent eigenvector (or …
random matrix models, introduced by Johnstone, in which a prominent eigenvector (or …
Information-theoretic thresholds from the cavity method
Vindicating a sophisticated but non-rigorous physics approach called the cavity method, we
establish a formula for the mutual information in statistical inference problems induced by …
establish a formula for the mutual information in statistical inference problems induced by …
The computer science and physics of community detection: Landscapes, phase transitions, and hardness
Community detection in graphs is the problem of finding groups of vertices which are more
densely connected than they are to the rest of the graph. This problem has a long history, but …
densely connected than they are to the rest of the graph. This problem has a long history, but …
A supernodal formulation of vertex colouring with applications in course timetabling
For many problems in scheduling and timetabling, the choice of a mathematical
programming formulation is determined by the formulation of the graph colouring …
programming formulation is determined by the formulation of the graph colouring …
Rigorous location of phase transitions in hard optimization problems
It is widely believed that for many optimization problems, no algorithm is substantially more
efficient than exhaustive search. This means that finding optimal solutions for many practical …
efficient than exhaustive search. This means that finding optimal solutions for many practical …