Results 131 to 140 of about 132,418 (291)
Bijective combinatorics of positive braids [PDF]
Electronic Notes in Discrete Mathematics, 2007 Abstract We give a new and bijective proof for the formula of the growth function of the positive braid monoid with respect to Artin generators.
openaire +3 more sources
Disease Transmission on Random Graphs Using Edge‐Based Percolation
Mathematical Methods in the Applied Sciences, Volume 48, Issue 11, Page 11265-11290, 30 July 2025.ABSTRACT Edge‐based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here, we begin by reviewing the seminal works on this field in previous studies by Newman et al. (2002, 2003) and Miller et al. (2012).
Sicheng Zhao, Felicia Maria G. Magpantay
wiley +1 more source
Gog and Magog triangles, and the Schutzenberger involution
, 2011 We describe an approach to finding a bijection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions, which is based on the Schutzenberger involution. In particular we give an explicit bijection between Gog and Magog
Biane, Philippe, Cheballah, Hayat
core +1 more source
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, Volume 109, Issue 3, Page 294-309, July 2025.ABSTRACT An independent set of size k in a finite undirected graph G is a set of k vertices of the graph, no two of which are connected by an edge. Let x k ( G ) be the number of independent sets of size k in the graph G and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 }. In 1987, Alavi, Malde, Schwenk, and Erdős asked if the independent set sequence x 0 (
Steven Heilman
wiley +1 more source
Fringe Trees for Random Trees With Given Vertex Degrees
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labeled trees with given vertex degrees, for random simply generated trees (or conditioned Galton–Watson trees), and for additive ...
Gabriel Berzunza Ojeda +2 more
wiley +1 more source
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Given access to the vertex set V$$ V $$ of a connected graph G=(V,E)$$ G=\left(V,E\right) $$ and an oracle that given two vertices u,v∈V$$ u,v\in V $$, returns the shortest path distance between u$$ u $$ and v$$ v $$, how many queries are needed to reconstruct E$$ E $$?
Paul Bastide, Carla Groenland
wiley +1 more source
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley +1 more source
A bijection for the evolution of $B$-trees
17 pages, 2 figures, accepted by 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Burghart, Fabian, Wagner, Stephan
openaire +6 more sources