Filters








25 Hits in 4.3 sec

Page 756 of Mathematical Reviews Vol. , Issue 2001B [page]

2001 Mathematical Reviews  
of tournaments with a given score sequence containing a specified digraph.  ...  A 73 (1996), no. 1, 77-90; MR 96m:05106] have given an asymptotic formula for the number of tournaments T (6),62,---,d,) with a specified excess sequence which holds for max |é;| = o(n?/*).  ... 

Brian Alspach and his work

Joy Morris, Mateja Šajna
2005 Discrete Mathematics  
He is a talented mentor, with a knack for encouraging young people.  ...  A substantial amount of his grant money goes toward supporting students-not only his own-with funding to attend conferences or to visit other researchers.  ...  Dave also helped us significantly with editing.  ... 
doi:10.1016/j.disc.2005.03.024 fatcat:umr2plo3hbb3jbinmsmxoewg3u

Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence [article]

Mikhail Isaev, Tejas Iyer, Brendan D. McKay
2020 arXiv   pre-print
We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph G.  ...  Our enumeration results have applications to the study of subdigraph occurrences in random orientations with given imbalance sequence.  ...  This technique was applied in [7] to asymptotically enumerate the number of tournaments containing a given small digraph.  ... 
arXiv:1908.01309v2 fatcat:vydtplyspnazdfxi2nf4czajsy

Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence

Mikhail Isaev, Tejas Iyer, Brendan D McKay
2020 Electronic Journal of Combinatorics  
We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$.  ...  Our enumeration results have applications to the study of subdigraph occurrences in random orientations with given imbalance sequence.  ...  This technique was applied in [7] to asymptotically enumerate the number of tournaments containing a given small digraph.  ... 
doi:10.37236/8929 fatcat:lxe72hswc5aknobw7iwzvury7m

Random dense bipartite graphs and directed graphs with specified degrees [article]

Catherine Greenhill, Brendan D. McKay
2009 arXiv   pre-print
Our theorems are based on an enumeration of bipartite graphs avoiding a given set of edges, proved by multidimensional complex integration.  ...  In particular, we find precise formulae for the probabilities that a given bipartite graph is edge-disjoint from, a subgraph of, or an induced subgraph of a random graph in the class.  ...  For digraphs in the dense regime, some related work includes enumeration of tournaments by score sequence with possible forbidden subgraph [13, 16, 15, 7] , Eulerian digraphs [13, 19] , Eulerian oriented  ... 
arXiv:math/0701600v5 fatcat:et3qj3iklfcjrkylfu47z5wgpm

Complex martingales and asymptotic enumeration

Mikhail Isaev, Brendan D. McKay
2017 Random structures & algorithms (Print)  
As a first illustration of the power of our theory, we considerably strengthen existing results on the relationship between random graphs or bipartite graphs with specified degrees and the so-called β-model  ...  Motivated by the need for a systematic study of the asymptotic behaviour of such integrals, we establish explicit bounds on the exponentials of complex martingales.  ...  Although we used an old theorem here for illustrative purposes, it is worth nothing that the same method can be used to enumerate tournaments according to score sequence over a very wide range of scores  ... 
doi:10.1002/rsa.20754 fatcat:a6calfg7lvfktj2xkk526aadrq

Page 176 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
(English summary) 2001j:05077 Gao, Yu Bin see Shao, Yan Ling, 2001¢:05084 Gao, Zhicheng (with McKay, Brendan D.; Wang, Xiaoji) Asymptotic enumeration of tournaments with a given score sequence containing  ...  a specified digraph.  ... 

Random Tournaments [article]

Tejas Iyer, University, The Australian National, University, The Australian National
2019
Tournaments with a Given Excess Sequence If we know that a tournament drawn from U has a given score vector δ = (δ 1 , · · · , δ n ), what is the probability that it contains a copy of a specified oriented  ...  In this chapter, we consider the more tractable problem of enumerating the number of tournaments with a given score vector asymptotically.  ...  Finding the Number of Tournaments with a Specified Oriented Graph A similar approach outlined in this section would allow the enumeration of tournaments with a δ-tame score vector s containing a fixed  ... 
doi:10.25911/5d9efbe9a04bc fatcat:gbhd5ksu5rgdjkd7vkvaxp3hdm

Minimal matrices in the Bruhat order for symmetric (0,1)-matrices

Henrique F. da Cruz, Rosário Fernandes, Susana Furtado
2017 Linear Algebra and its Applications  
each of whom gave a one-hour lecture. The third type of talks were the 20-minute contributed talks running in two parallel sessions and given by 39 speakers.  ...  A special issue of Discrete Applied Mathematics dedicated to this conference and containing full-length papers will be published.  ...  We show that, unlike for trees, all containments in the Venn diagram are proper for MOPs, a subfamily of 2-trees.  ... 
doi:10.1016/j.laa.2017.05.014 fatcat:zlcp5rb2sjeqvlyaajvf2nyoby

Learning to Predict Combinatorial Structures [article]

Shankar Vembu
2010 arXiv   pre-print
The consequence is a generalisation of the classical ridge regression for structured prediction. (ii) The second assumption is that a particular sampling problem can be solved efficiently.  ...  The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space.  ...  However, we can relax Y toỸ ⊆ 2 Σ such that all y ∈ Y form a partial tournament (a directed graph with no cycles of length two).  ... 
arXiv:0912.4473v2 fatcat:olzo64uyxfg5jcjjvtjidvek54

Preference Restrictions in Computational Social Choice: A Survey [article]

Edith Elkind, Martin Lackner, Dominik Peters
2022 arXiv   pre-print
We do this from the viewpoint of computational social choice, letting computational problems drive our interest, but we include a comprehensive discussion of the economics and social choice literatures  ...  Particular focus areas of our survey include algorithms for recognizing whether preferences belong to a particular preference domain, and algorithms for winner determination of voting rules that are hard  ...  On the other hand, there exists a sequence of length 2 2 d that does not contain monotonic subsequences of length 3; Alon et al. (1985) explicitly construct a sequence with this property that additionally  ... 
arXiv:2205.09092v1 fatcat:a4vbknzskvhotmedlaneakg2am

Page 607 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
Sinica 26 (2000), no. 4, 515-518. 93B07 Gao, Zhicheng (with McKay, Brendan D.; Wang, Xiaoji) Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.  ...  A 16 (2001), no. 1, 26-30. (Summary) 2001m:20079 20G40 Gao, Yu Bin (with Shao, Yan Ling) The set of generalized exponents of symmetric primitive digraphs. (Chinese.  ... 

Page 1279 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(Helmut Langer) 2001m:81024 81P10 (06C15) — (with Gao, Zhicheng; Wang, Xiaoji) Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.  ...  (see 2001j:68006) 68Q25 (68Q15) — (with Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert) The many faces of a translation.  ... 

Page 2110 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(see 2001d:65007) 65F15 (65F20) Wang, Xiaoji (with Gao, Zhicheng; McKay, Brendan D.) Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.  ...  (Theo Gasser) 2001i:62052 62G08 (60F 15) — (with Wu, Yao Hua') The consistency of a best-r-points-average estimator for the maximizer of a multivariable regression function. (Chinese.  ... 

Index—Volumes 1–89

1997 Artificial Intelligence  
modei of -690 containing a given hypothesis 1222 facilities 690 for a given set of observations, best -1034 inference to the best -1059 MAP -1069 of beliefs 527 of correctness 896 of decisions  ...  , recursively -913, 1081 enumerated set of solutions, pre--342 enumerating assumptions 296 the elements of a collection 140 enumerations 126 ordered set -126 environment .  ...  mathematics of non-monotonic-150 mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices of -1157 models inexact -906 multiple inheritance -966 multiple lines of -  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm
« Previous Showing results 1 — 15 out of 25 results