Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

In the Hamadryas baboon, males are substantially larger than females. A troop of baboons is subdivided into a number of ‘one-male groups’, consisting of one adult male and one or more females with their young. The male prevents any of ‘his’ females from moving too far from him. Kummer (1971) performed the following experiment. Two males, A and B, previously unknown to each other, were placed in a large enclosure. Male A was free to move about the enclosure, but male B was shut in a small cage, from which he could observe A but not interfere. A female, unknown to both males, was then placed in the enclosure. Within 20 minutes male A had persuaded the female to accept his ownership. Male B was then released into the open enclosure. Instead of challenging male A , B avoided any contact, accepting A’s ownership.

Evolution and the Theory of Games

1. Overview 2. Erdos-Renyi random graphs 3. Fixed degree distributions 4. Power laws 5. Small worlds 6. Random walks 7. CHKNS model.

/pdf/random-graph-dynamics-5durp7r63x.pdf

Random graph dynamics

This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified framework to enable systematic study. Designed for a master's-level course, where students may only have a basic background in probability, the text covers such important preliminaries as convergence of random variables, probabilistic bounds, coupling, martingales, and branching processes. Building on this base - and motivated by many examples of real-world networks, including the Internet, collaboration networks, and the World Wide Web - it focuses on several important models for complex networks and investigates key properties, such as the connectivity of nodes. Numerous exercises allow students to develop intuition and experience in working with the models.

/pdf/random-graphs-and-complex-networks-2ht4nfa9l0.pdf

Random Graphs and Complex Networks

Elementary Fixed Point Theorems * Theorem of Borsuk and Topological Transversality * Homology and Fixed Points * Leray-Schauder Degree and Fixed Point Index * The Lefschetz-Hopf Theory * Selected Topics * Index

Fixed Point Theory

We propose a conceptual model for pollination and fertilization of tomato flowers in greenhouses crops by hoverflies, when the maximal number of adult pollinators maintained by the crops is less than what is needed for an economically successful pollination in greenhouses. The model consists of a two-stage process for additional feeding of hoverfly to maintain the pollinator density at the economically desired level. First, with a stochastic model, we calculate the density of flies necessary for the economically successful pollination, determined according to the economically expected yield. Second, using a deterministic optimal control model, we find a minimum cost supplementary feeding strategy. In summary, we theoretically demonstrate, at the present stage of the research without validations in case studies, that optimal supplementary feeding can maintain the economically desired hoverfly density.

https://www.mdpi.com/2073-4395/11/1/167/pdf

Theoretical Foundation of the Control of Pollination by Hoverflies in a Greenhouse

A linear transmission path of a communication network is considered, where some interfering traffic of random character is assumed. Limit theorems and laws of iterated logarithm are derived for the asymptotic network delay by the help of weak and strong invariance principles.

On the asymptotic network delay in a model of packet switching

The moral rule “Risk your life to save your family members” is, at the same time, a biological phenomenon. The prominent population geneticist, J.B.S. Haldane told his friends that he would risk his life to save two drowning brothers, but not one – so the story goes. In biological terms, Haldane’s arithmetic claims that sib altruism is evolutionarily rational, whenever by “self-sacrifice” an altruistic gene “rescues”, on average, more than one copy of itself in its lineage. Here, we derive conditions for evolutionary stability of sib altruism, using population genetic models for three mating systems (monogamy, promiscuity and polygyny) with linear and non-linear group effect on the siblings’ survival rate. We show that for all considered selection situations, the condition of evolutionary stability is equivalent to Haldane’s arithmetic. The condition for evolutionary stability is formulated in terms of genetic relatedness and the group effect on the survival probability, similarly to the classical Hamilton’s rule. We can set up a “scale of mating systems”, since in pairwise interactions the chance of evolutionary stability of sib altruism decreases in this order: monogamy, polygyny and promiscuity. Practice of marrying and siblings’ solidarity are moral rules in a secular world and in various religious traditions. These moral rules are not evolutionarily independent, in the sense that the subsistence of sib altruism is more likely in a monogamous population. Highlights Haldane’s arithmetic is introduced Conditions for evolutionary stability of sib altruism are given Evolutionary stability is equivalent to Haldane’s arithmetic in the studied model Generalized Hamilton’s rules are formulated

Subsistence of sib altruism in different mating systems and Haldane’s arithmetic

Random graphs are matrices with independent 0–1 elements with probabilities determined by a small number of parameters. One of the oldest models is the Rasch model where the odds are ratios of positive numbers scaling the rows and columns. Later Persi Diaconis with his coworkers rediscovered the model for symmetric matrices and called the model beta. Here we give goodness-of-fit tests for the model and extend the model to a version of the block model introduced by Holland, Laskey and Leinhard.

https://www.mdpi.com/1999-4893/5/4/629/pdf

Testing Goodness of Fit of Random Graph Models

Tossing a (not necessarily unbiased) coin n times let us denote the length of the longest head run by Zn and the number of head runs of such length by Mn. Once Erdős asked about the asymptotic behavior of Mn as n → ∞, and these questi motivated the problems that will be discussed in the present paper.

Tamás F. Móri

Papers

Theoretical Foundation of the Control of Pollination by Hoverflies in a Greenhouse

On the asymptotic network delay in a model of packet switching

Subsistence of sib altruism in different mating systems and Haldane’s arithmetic

Testing Goodness of Fit of Random Graph Models

On the Multiplicity of the Sample Maximum and the Longest Head Run