:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Tapp, Kristopher
Format:	Preprint
Publié:	2025
Sujets:	Physics and Society Computer Vision and Pattern Recognition 05C05, 05C90, 60J20, 05C85
Accès en ligne:	https://arxiv.org/abs/2501.02325
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Minimum Spanning Tree Distribution in Grids
par: Tapp, Kristopher
Publié: (2024)

Spectral influence in networks: An application to Input-Output analysis
par: Riane, Nizar
Publié: (2023)

Approximating inter-point distances in directed Bernoulli graphs
par: Barbour, A. D., et autres
Publié: (2026)

Animal social networks as intersections graphs of random walks
par: Cermelli, Paolo, et autres
Publié: (2025)

Opinion dynamics on directed complex networks
par: Fraiman, Nicolas, et autres
Publié: (2022)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
par: Mörters, Peter, et autres
Publié: (2025)

Graph-Based Multivariate Multiscale Dispersion Entropy: Efficient Implementation and Applications to Real-World Network Data
par: Fabila-Carrasco, John Stewart, et autres
Publié: (2024)

Spanning Trees and Redistricting: New Methods for Sampling and Validation
par: Cannon, Sarah, et autres
Publié: (2022)

Local 2-separators
par: Carmesin, Johannes
Publié: (2020)

Critical beta-splitting, via contraction
par: Kolesnik, Brett
Publié: (2024)

Aspects of the commuting graph
par: Arvind, V., et autres
Publié: (2023)

Local limit of Prim's algorithm
par: Corsini, Benoît, et autres
Publié: (2025)

A Graph Random Walk Method for Calculating Time-of-Flight Charge Mobility in Organic Semiconductors from Multiscale Simulations
par: Chen, Zhongquan, et autres
Publié: (2024)

Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly
par: Ashworth, Jacob, et autres
Publié: (2024)

Coloring graphs as complete graph invariants
par: Asgarli, Shamil, et autres
Publié: (2025)

Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
par: Tanaka, Hajime, et autres
Publié: (2025)

The real-time growth rate of stochastic epidemics on random intersection graphs
par: Fransson, Carolina
Publié: (2022)

The spread of fire on a random multigraph
par: Goldschmidt, Christina, et autres
Publié: (2017)

Binary Galton-Watson trees with mutations
par: Huang, Qiao, et autres
Publié: (2025)

Urn Modeling of Random Graphs Across Granularity Scales: A Framework for Origin-Destination Human Mobility Networks
par: Vanni, Fabio, et autres
Publié: (2025)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
par: Dau, Son Hoang, et autres
Publié: (2022)

A greedy heuristic for graph burning
par: García-Díaz, Jesús, et autres
Publié: (2024)

Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
par: Park, SangHyun
Publié: (2026)

When all directed cycles have the same weight
par: Berger, Eli, et autres
Publié: (2026)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
par: Chiarelli, Nina, et autres
Publié: (2024)

Enforcing Katz and PageRank Centrality Measures in Complex Networks
par: Cipolla, Stefano, et autres
Publié: (2024)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
par: Sylvester, John
Publié: (2021)

Targeted Disruption of Hypernetworks via Spectral Partitioning
par: Bailey, Mark M., et autres
Publié: (2026)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

Minimal $L^p$-congestion spanning trees on weighted graphs
par: Lafuente, Alberto Castejón, et autres
Publié: (2025)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

Improved lower bounds for the maximum order of an induced acyclic subgraph
par: Asgarli, Shamil, et autres
Publié: (2025)

The Mutual-Visibility Problem In Directed Graphs
par: Stojanović, Vanja
Publié: (2026)

Resistance distance and Kirchhoff index in central vertex join and central edge join of two graphs
par: T, Haritha, et autres
Publié: (2024)

Distributed Optimization of Bivariate Polynomial Graph Spectral Functions via Subgraph Optimization
par: Liu, Jitian, et autres
Publié: (2025)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

Exploring the space of graphs with fixed discrete curvatures
par: Roost, Michelle, et autres
Publié: (2024)

4-cop-win graphs have at least 19 vertices
par: Turcotte, Jérémie, et autres
Publié: (2020)

Cofinality of Regular Tournaments
par: Hatem, Omar, et autres
Publié: (2026)

Randomized Zero Forcing
par: Geneson, Jesse, et autres
Publié: (2026)