7.1k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR1.3k papers
- Massachusetts Institute of TechnologyUS1.3k papers
- University of BristolGB1.3k papers
- University of Maryland, College ParkUS1.3k papers
- Peking UniversityCN1.3k papers
- European Organization for Nuclear ResearchCH1.3k papers
- RWTH Aachen UniversityDE1.3k papers
- Rutherford Appleton LaboratoryGB1.3k papers
- University of ZurichCH1.3k papers
- The Ohio State UniversityUS1.3k papers
- Université Libre de BruxellesBE1.3k papers
- California Institute of TechnologyUS1.3k papers
4 papers · 2 filters
Distribution of the sum-of-digits function of random integers: a survey
Louis H. Y. Chen, Hsien-Kuei Hwang, Vytas Zacharovas
We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also…
Assortativity and clustering of sparse random intersection graphs
Mindaugas Bloznelis, Jerzy Jaworski, Valentas Kurauskas
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptoti…
Analysis of an exhaustive search algorithm in random graphs and the n^{c\log n} -asymptotics
Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana +1
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual G_{n,p} -model where each possible edge appea…
Extremal Lipschitz functions in the deviation inequalities from the mean
Dainius Dzindzalieta
We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}μ\{f-\E_μ f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$…