scispace - formally typeset
T

Tamás F. Móri

Researcher at Eötvös Loránd University

Publications -  98
Citations -  1399

Tamás F. Móri is an academic researcher from Eötvös Loránd University. The author has contributed to research in topics: Random graph & Population. The author has an hindex of 16, co-authored 93 publications receiving 1188 citations. Previous affiliations of Tamás F. Móri include Bowling Green State University & Alfréd Rényi Institute of Mathematics.

Papers
More filters
Journal Article

On an inequality of Feng Qi.

TL;DR: In this paper, the authors generalize those inequalitites by introducing weights and permitting more general functions, and present a sharp inequality between the sum of squares and the exponential sum of a nonnegative sequence, which has been extended to more general power sums by Huan-Nan Shi and independently by Yu Miao, Li-Min Liu, and Feng Qi.
Posted ContentDOI

Game of full siblings in Mendelian populations

TL;DR: In this paper , the authors adapt the concept of evolutionary stability to familial selection when a game theoretic conflicts between siblings determines the survival rate of each sibling in monogamous, exogamous families in a diploid, panmictic population.
Journal ArticleDOI

A random graph of moderate density

TL;DR: In this paper , the average degree is asymptotically equal to a constant times the square root of the number of vertices, and the clustering coefficient is rather small.
Journal ArticleDOI

Rényi 100, Quantitative and qualitative (in)dependence

TL;DR: In this paper, the authors discuss recent developments in the following important areas of Alfred Renyi's research interest: axiomatization of quantitative dependence measures, qualitative independence in combinatorics, conditional qualitative independence, and finally, prime gaps that are responsible for Renyi’s early career reputation.
Journal ArticleDOI

Random cherry graphs

TL;DR: In this paper, a substantially extended version of the cherry tree was introduced to improve Bonferroni type upper bounds on the probability of the union of random events, and embedding it into a general time dependent branching process.