Colin Cooper

CoRR, 2023

A Simple Model of Influence.

[BibT_eX]

[DOI]

Nan Kang

Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

Brief Announcement: Discrete Incremental Voting.

[BibT_eX]

[DOI]

Takeharu Shiraga

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Distributed Averaging in Opinion Dynamics.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Discrete Incremental Voting.

[BibT_eX]

[DOI]

Takeharu Shiraga

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022

Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Distributed Averaging in Population Protocols.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Nicolás Rivera

CoRR, 2022

On early extinction and the effect of travelling in the SIR model.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Proceedings of the Uncertainty in Artificial Intelligence, 2022

2021

A Triangle Process on Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2019

New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2019

On the Cover Time of Dense Graphs.

[BibT_eX]

[DOI]

Wesley Pegden

SIAM J. Discret. Math., 2019

Minors of a random binary matroid.

[BibT_eX]

[DOI]

Wesley Pegden

Random Struct. Algorithms, 2019

The flip Markov chain for connected regular graphs.

[BibT_eX]

[DOI]

Andrew J. Handley

Discret. Appl. Math., 2019

Triangle-creation processes on cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2019

On the Rank of a Random Binary Matrix.

[BibT_eX]

[DOI]

Wesley Pegden

Electron. J. Comb., 2019

2018

Discordant Voting Processes on Finite Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Dispersion processes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Threshold behaviour of discordant voting on the complete graph.

[BibT_eX]

[DOI]

Nicolás Rivera

J. Discrete Algorithms, 2018

An Experimental Study of the k-MXT Algorithm with Applications to Clustering Geo-Tagged Data.

[BibT_eX]

[DOI]

Ngoc Vu

Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

The Cover Time of a Biased Random Walk on a Random Cubic Graph.

[BibT_eX]

[DOI]

Tony Johansson

Proceedings of the 29th International Conference on Probabilistic, 2018

The cover time of a biased random walk on Gn, p.

[BibT_eX]

[DOI]

Samantha Petti

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

Constructing self-stabilizing oscillators in population protocols.

[BibT_eX]

[DOI]

Inf. Comput., 2017

The covertime of a biased random walk on Gn, p.

[BibT_eX]

[DOI]

Samantha Petti

CoRR, 2017

Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time.

[BibT_eX]

[DOI]

CoRR, 2017

Fast Plurality Consensus in Regular Expanders.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Multi-Agent Flag Coordination Games.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Rainbow Arborescence in Random Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Fast Low-Cost Estimation of Network Properties Using Random Walks.

[BibT_eX]

[DOI]

Internet Math., 2016

On the Length of a Random Minimum Spanning Tree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

The Linear Voting Model.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Spectral clustering using the kNN-MST similarity graph.

[BibT_eX]

[DOI]

Patrick Veenstra

Steve Phelps

Proceedings of the 2016 8th Computer Science and Electronic Engineering Conference, 2016

The use of Biweight Mid Correlation to improve graph based portfolio construction.

[BibT_eX]

[DOI]

Patrick Veenstra

Steve Phelps

Proceedings of the 2016 8th Computer Science and Electronic Engineering Conference, 2016

2015

Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics.

[BibT_eX]

[DOI]

Sci. Program., 2015

Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time.

[BibT_eX]

[DOI]

Tom Friedetzky

Random Struct. Algorithms, 2015

Randomized diffusion for indivisible loads.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Long Paths in Random Apollonian Networks.

[BibT_eX]

[DOI]

Internet Math., 2015

Fast Consensus for Voting on General Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Coalescing Walks on Rotor-Router Systems.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge.

[BibT_eX]

[DOI]

Moez Draief

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Estimating network parameters using random walks.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2014

The height of random k-trees and related branching processes.

[BibT_eX]

[DOI]

Ryuhei Uehara

Random Struct. Algorithms, 2014

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two.

[BibT_eX]

[DOI]

Eyal Lubetzky

Random Struct. Algorithms, 2014

A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence.

[BibT_eX]

[DOI]

Internet Math., 2014

Some Typical Properties of the Spatial Preferred Attachment Model.

[BibT_eX]

[DOI]

Pawel Pralat

Internet Math., 2014

Random walks in recommender systems: exact computation and simulations.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

The Power of Two Choices in Distributed Voting.

[BibT_eX]

[DOI]

Robert Elsässer

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

The cover times of random walks on random uniform hypergraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Coalescing Random Walks and Voting on Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Component structure of the vacant set induced by a random walk on a random graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

2012

Chains-into-bins processes.

[BibT_eX]

[DOI]

Tugkan Batu

J. Discrete Algorithms, 2012

Stationary distribution and cover time of random walks on random digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

Cover time of a random graph with given degree sequence.

[BibT_eX]

[DOI]

Discret. Math., 2012

A fast algorithm to find all high degree vertices in power law graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st World Wide Web Conference, 2012

Coalescing random walks and voting on graphs.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011

Scale-free graphs of increasing degree.

[BibT_eX]

[DOI]

Pawel Pralat

Random Struct. Algorithms, 2011

The cover time of random geometric graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Derandomizing random walks in undirected graphs using locally fair exploration strategies.

[BibT_eX]

[DOI]

Distributed Comput., 2011

On the Imitation Strategy for Games on Graphs

[BibT_eX]

[DOI]

Velumailum Mohanaraj

CoRR, 2011

Networks of random cycles.

[BibT_eX]

[DOI]

Andrew J. Handley

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

The Cover Times of Random Walks on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Viral Processes by Random Walks on Random Regular Graphs.

[BibT_eX]

[DOI]

Moez Draief

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Locating and repairing faults in a network with mobile agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Michael Krivelevich

SIAM J. Discret. Math., 2010

Random Walks with Look-Ahead in Scale-Free Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

An Efficient Sparse Regularity Concept.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

SIAM J. Discret. Math., 2010

Scale Free Properties of Random k-Trees.

[BibT_eX]

[DOI]

Ryuhei Uehara

Math. Comput. Sci., 2010

Component structure induced by a random walk on a random graph

[BibT_eX]

[DOI]

CoRR, 2010

Speeding Up Random Walks with Neighborhood Exploration.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

The Cover Time of Cartesian Product Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Realistic Data for Testing Rule Mining Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Energy efficient randomised communication in unknown AdHoc networks.

[BibT_eX]

[DOI]

Zengjian Hu

Theor. Comput. Sci., 2009

Multiple Random Walks in Random Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

The flip markov chain and a randomising P2P protocol.

[BibT_eX]

[DOI]

Andrew J. Handley

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Multiple Random Walks and Interacting Particle Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Martingales on Trees and the Empire Chromatic Number of Random Trees.

[BibT_eX]

[DOI]

Andrew R. A. McGrae

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

A randomized algorithm for the joining protocol in dynamic distributed networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

The cover time of the giant component of a random graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

A Spatial Web Graph Model with Local Influence Regions.

[BibT_eX]

[DOI]

William Aiello

Anthony Bonato

Jeannette C. M. Janssen

Pawel Pralat

Internet Math., 2008

Random Walks on Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Nano-Net - Third International ICST Conference, 2008

2007

The cover time of sparse random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

The cover time of the preferential attachment graph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2007

Sampling Regular Graphs and a Peer-to-Peer Network.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Random 2-SAT with Prescribed Literal Degrees.

[BibT_eX]

[DOI]

Gregory B. Sorkin

Algorithmica, 2007

Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

The Cover Time of Random Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

The degree distribution of the generalized duplication model.

[BibT_eX]

[DOI]

Süleyman Cenk Sahinalp

Theor. Comput. Sci., 2006

Dominating sets of random recursive trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Hamilton cycles in random lifts of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

Distribution of Vertex Degree in Web-Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Energy Efficient Randomized Communication in Unknown AdHoc Networks

[BibT_eX]

[DOI]

Zengjian Hu

CoRR, 2006

Searching for Black-Hole Faults in a Network Using Multiple Agents.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005

The Cover Time of Random Regular Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Lower Bounds and Algorithms for Dominating Sets in Web Graphs.

[BibT_eX]

[DOI]

Internet Math., 2005

The cover time of two classes of random graphs.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Improved Duplication Models for Proteome Network Evolution.

[BibT_eX]

[DOI]

Süleyman Cenk Sahinalp

Proceedings of the Systems Biology and Regulatory Genomics, 2005

2004

The cores of random hypergraphs with a given degree sequence.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Dominating Sets in Web Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2003

A general model of web graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Random Deletion in a Scale-Free Random Graph Process.

[BibT_eX]

[DOI]

Juan Vera

Internet Math., 2003

Crawling on Simple Models of Web Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

On Randomly Generated Intersecting Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

2002

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity.

[BibT_eX]

[DOI]

Bruce A. Reed

Comb. Probab. Comput., 2002

Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Crawling on web graphs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

A note on random 2-SAT with prescribed literal degrees.

[BibT_eX]

[DOI]

Gregory B. Sorkin

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Classifying Special Interest Groups in Web Graphs.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001

The union of two random permutations does not have a directed Hamilton cycle.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

On Markov Chains for Randomly H-Coloring a Graph.

[BibT_eX]

[DOI]

J. Algorithms, 2001

A General Model of Undirected Web Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Average-case complexity of shortest-paths problems in the vertex-potential model.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Hamilton cycles in random graphs and directed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

On the rank of random matrices.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

On the distribution of rank of a random matrix over a finite field.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Min-Wise Independent Linear Permutations.

[BibT_eX]

[DOI]

Tom Bohman

Electron. J. Comb., 2000

1999

Mixing properties of the Swendsen-Wang process on classes of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1999

Asymptotics for dependent sums of random vectors.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1999

1996

Perfect Matchings in Random r-regular, s-uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Asymptotic Enumeration of Predicate-Junction Flowgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

1995

On the 2-Cyclic Property in 2-Regular Digraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The vapnik-chervonenkis dimension of a random graph.

[BibT_eX]

[DOI]

Martin Anthony

Graham R. Brightwell

Discret. Math., 1995

On the Connectivity of Random k-th Nearest Neighbour Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

1994

The Threshold for Hamilton Cycles in the Square of a Random Graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Hamilton Cycles in a Class of Random Directed Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1994

Probabilistic analysis of two k-cluster problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Hamilton Cycles in Random Regular Digraphs.

[BibT_eX]

[DOI]

Michael Molloy

Comb. Probab. Comput., 1994

1993

A Note on the Connectivity of 2-Regular Digraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

1992

1-Pancyclic Hamilton Cycles in Random Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

On the Trickness of Sparse Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

1991

Pancyclic Hamilton cycles in random graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

The limiting probability that alpha-in, ß-out is strongly connected.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1990

1989

On the number of hamilton cycles in a random graph.

[BibT_eX]

[DOI]