Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  median
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Estimating median and other quantiles in nonparametric models

100%
Zieliński R.
Applicationes Mathematicae
|
1995-1996
|
tom 23
|
nr 3
363-370
EN
Though widely accepted, in nonparametric models admitting asymmetric distributions the sample median, if n=2k, may be a poor estimator of the population median. Shortcomings of estimators which are not equivariant are presented.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Median of a graph with respect to edges

100%
Santhakumaran A.
Discussiones Mathematicae Graph Theory
|
2012
|
tom 32
|
nr 1
19-29
EN
For any vertex v and any edge e in a non-trivial connected graph G, the distance sum d(v) of v is $d(v) = ∑_{u ∈ V}d(v,u)$, the vertex-to-edge distance sum d₁(v) of v is $d₁(v) = ∑_{e ∈ E}d(v,e)$, the edge-to-vertex distance sum d₂(e) of e is $d₂(e) = ∑_{v ∈ V}d(e,v)$ and the edge-to-edge distance sum d₃(e) of e is $d₃(e) = ∑_{f ∈ E}d(e,f)$. The set M(G) of all vertices v for which d(v) is minimum is the median of G; the set M₁(G) of all vertices v for which d₁(v) is minimum is the vertex-to-edge median of G; the set M₂(G) of all edges e for which d₂(e) is minimum is the edge-to-vertex median of G; and the set M₃(G) of all edges e for which d₃(e) is minimum is the edge-to-edge median of G. We determine these medians for some classes of graphs. We prove that the edge-to-edge median of a graph is the same as the median of its line graph. It is shown that the center and the median; the vertex-to-edge center and the vertex-to-edge median; the edge-to-vertex center and the edge-to-vertex median; and the edge-to-edge center and the edge-to-edge median of a graph are not only different but can be arbitrarily far apart.
3
Content available remote

The Median Problem on k-Partite Graphs

88%
Pravas K., Vijayakumar A.
Discussiones Mathematicae Graph Theory
|
2015
|
tom 35
|
nr 3
439-446
EN
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipartite graphs play a significant role in designing very large interconnection networks. In this paper, we answer a problem on the structure of medians of bipartite graphs by showing that any bipartite graph is the median (or anti-median) of another bipartite graph. Also, with a different construction, we show that the similar results hold for k-partite graphs, k ≥ 3. In addition, we provide constructions to embed another graph as center in both bipartite and k-partite cases. Since any graph is a k-partite graph, for some k, these constructions can be applied in general
4
Content available remote

On functional measures of skewness

63%
Dziubińska R., Szynal D.
Applicationes Mathematicae
|
1995-1996
|
tom 23
|
nr 4
395-403
EN
We introduce a concept of functional measures of skewness which can be used in a wider context than some classical measures of asymmetry. The Hotelling and Solomons theorem is generalized.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.