EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 18 of 18

On a matching distance between rooted phylogenetic trees

Damian Bogdanowicz, Krzysztof Giaro (2013)

International Journal of Applied Mathematics and Computer Science

The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs, the values...

On a sphere of influence graph in a one-dimensional space

Zbigniew Palka, Monika Sperling (2005)

Discussiones Mathematicae Graph Theory

A sphere of influence graph generated by a finite population of generated points on the real line by a Poisson process is considered. We determine the expected number and variance of societies formed by population of n points in a one-dimensional space.

On concentration of self-bounding functions.

Boucheron, Stephane, Lugosi, Gabor, Massart, Pascal (2009)

Electronic Journal of Probability [electronic only]

On entropies of occupancy distributions

Ove Frank, Krzysztof Nowicki (1989)

Banach Center Publications

On families of weakly dependent random variables

Tomasz Łuczak (2011)

Banach Center Publications

Let $ₙ^{(k)}$ be a family of random independent k-element subsets of [n] = 1,2,...,n and let $(ₙ^{(k)}, ℓ) = ₙ^{(k)} (ℓ)$ denote a family of ℓ-element subsets of [n] such that the event that S belongs to $ₙ^{(k)} (ℓ)$ depends only on the edges of $ₙ^{(k)}$ contained in S. Then, the edges of $ₙ^{(k)} (ℓ)$ are ’weakly dependent’, say, the events that two given subsets S and T are in $ₙ^{(k)} (ℓ)$ are independent for vast majority of pairs S and T. In the paper we present some results on the structure of weakly dependent families of subsets obtained in this way. We also list...

On $(k, l)$ -radius of random graphs.

Horváthová, M. (2006)

Acta Mathematica Universitatis Comenianae. New Series

On kaleidoscopic pseudo-randomness of finite Euclidean graphs

Le Anh Vinh (2012)

Discussiones Mathematicae Graph Theory

D. Hart, A. Iosevich, D. Koh, S. Senger and I. Uriarte-Tuero (2008) showed that the distance graphs has kaleidoscopic pseudo-random property, i.e. sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations. In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods.